/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:30:55,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:30:55,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:30:55,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:30:55,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:30:55,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:30:55,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:30:55,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:30:55,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:30:55,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:30:55,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:30:55,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:30:55,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:30:55,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:30:55,520 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:30:55,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:30:55,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:30:55,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:30:55,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:30:55,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:30:55,537 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:30:55,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:30:55,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:30:55,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:30:55,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:30:55,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:30:55,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:30:55,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:30:55,544 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:30:55,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:30:55,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:30:55,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:30:55,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:30:55,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:30:55,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:30:55,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:30:55,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:30:55,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:30:55,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:30:55,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:30:55,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:30:55,552 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:30:55,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:30:55,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:30:55,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:30:55,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:30:55,579 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:30:55,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:30:55,579 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:30:55,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:30:55,580 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:30:55,580 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:30:55,580 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:30:55,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:30:55,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:30:55,581 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:30:55,581 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:30:55,581 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:30:55,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:30:55,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:30:55,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:30:55,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:30:55,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:30:55,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:30:55,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:30:55,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:30:55,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:30:55,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:30:55,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:30:55,583 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:30:55,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:30:55,584 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:30:55,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:30:55,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:30:55,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:30:55,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:30:55,883 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:30:55,884 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-18 13:30:55,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3075fe31d/4136b41a352a4af3bed85cd94f8fd004/FLAGc7288437d [2019-12-18 13:30:56,526 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:30:56,526 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.opt.i [2019-12-18 13:30:56,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3075fe31d/4136b41a352a4af3bed85cd94f8fd004/FLAGc7288437d [2019-12-18 13:30:56,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3075fe31d/4136b41a352a4af3bed85cd94f8fd004 [2019-12-18 13:30:56,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:30:56,809 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:30:56,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:30:56,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:30:56,814 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:30:56,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:30:56" (1/1) ... [2019-12-18 13:30:56,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634104fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:56, skipping insertion in model container [2019-12-18 13:30:56,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:30:56" (1/1) ... [2019-12-18 13:30:56,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:30:56,895 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:30:57,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:30:57,424 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:30:57,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:30:57,572 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:30:57,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57 WrapperNode [2019-12-18 13:30:57,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:30:57,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:30:57,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:30:57,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:30:57,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:30:57,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:30:57,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:30:57,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:30:57,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... [2019-12-18 13:30:57,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:30:57,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:30:57,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:30:57,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:30:57,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:30:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:30:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:30:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:30:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:30:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:30:57,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:30:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:30:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:30:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:30:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:30:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:30:57,759 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:30:58,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:30:58,482 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:30:58,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:30:58 BoogieIcfgContainer [2019-12-18 13:30:58,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:30:58,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:30:58,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:30:58,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:30:58,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:30:56" (1/3) ... [2019-12-18 13:30:58,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e187e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:30:58, skipping insertion in model container [2019-12-18 13:30:58,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:30:57" (2/3) ... [2019-12-18 13:30:58,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131e187e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:30:58, skipping insertion in model container [2019-12-18 13:30:58,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:30:58" (3/3) ... [2019-12-18 13:30:58,494 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.opt.i [2019-12-18 13:30:58,505 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:30:58,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:30:58,516 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:30:58,517 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:30:58,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,551 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,552 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,565 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,586 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,587 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,591 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,592 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,593 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:30:58,611 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 13:30:58,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:30:58,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:30:58,632 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:30:58,632 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:30:58,632 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:30:58,632 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:30:58,633 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:30:58,633 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:30:58,661 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 13:30:58,663 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 13:30:58,775 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 13:30:58,775 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:30:58,799 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. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:30:58,816 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 13:30:58,890 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 13:30:58,891 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:30:58,899 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. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 13:30:58,915 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 13:30:58,916 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:31:03,324 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 13:31:03,454 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 13:31:03,480 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45620 [2019-12-18 13:31:03,480 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-18 13:31:03,483 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-18 13:31:03,960 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8218 states. [2019-12-18 13:31:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states. [2019-12-18 13:31:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 13:31:03,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:03,971 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 13:31:03,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:03,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:03,978 INFO L82 PathProgramCache]: Analyzing trace with hash 699456563, now seen corresponding path program 1 times [2019-12-18 13:31:03,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:03,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824995968] [2019-12-18 13:31:03,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:04,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824995968] [2019-12-18 13:31:04,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:04,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:31:04,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682476559] [2019-12-18 13:31:04,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:04,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:04,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:04,359 INFO L87 Difference]: Start difference. First operand 8218 states. Second operand 3 states. [2019-12-18 13:31:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:04,655 INFO L93 Difference]: Finished difference Result 8170 states and 26597 transitions. [2019-12-18 13:31:04,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:04,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 13:31:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:04,801 INFO L225 Difference]: With dead ends: 8170 [2019-12-18 13:31:04,801 INFO L226 Difference]: Without dead ends: 8001 [2019-12-18 13:31:04,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2019-12-18 13:31:05,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2019-12-18 13:31:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8001 states. [2019-12-18 13:31:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 26077 transitions. [2019-12-18 13:31:05,189 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 26077 transitions. Word has length 5 [2019-12-18 13:31:05,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:05,190 INFO L462 AbstractCegarLoop]: Abstraction has 8001 states and 26077 transitions. [2019-12-18 13:31:05,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:05,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 26077 transitions. [2019-12-18 13:31:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:31:05,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:05,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:05,193 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:05,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:05,193 INFO L82 PathProgramCache]: Analyzing trace with hash 336736415, now seen corresponding path program 1 times [2019-12-18 13:31:05,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:05,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631587447] [2019-12-18 13:31:05,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:05,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631587447] [2019-12-18 13:31:05,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:05,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:05,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790662979] [2019-12-18 13:31:05,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:05,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:05,318 INFO L87 Difference]: Start difference. First operand 8001 states and 26077 transitions. Second operand 4 states. [2019-12-18 13:31:05,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:05,880 INFO L93 Difference]: Finished difference Result 12769 states and 39815 transitions. [2019-12-18 13:31:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:05,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:31:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:05,956 INFO L225 Difference]: With dead ends: 12769 [2019-12-18 13:31:05,956 INFO L226 Difference]: Without dead ends: 12762 [2019-12-18 13:31:05,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2019-12-18 13:31:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11253. [2019-12-18 13:31:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11253 states. [2019-12-18 13:31:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11253 states to 11253 states and 35607 transitions. [2019-12-18 13:31:06,356 INFO L78 Accepts]: Start accepts. Automaton has 11253 states and 35607 transitions. Word has length 11 [2019-12-18 13:31:06,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:06,356 INFO L462 AbstractCegarLoop]: Abstraction has 11253 states and 35607 transitions. [2019-12-18 13:31:06,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 11253 states and 35607 transitions. [2019-12-18 13:31:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:31:06,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:06,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:06,360 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1460182026, now seen corresponding path program 1 times [2019-12-18 13:31:06,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:06,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050369030] [2019-12-18 13:31:06,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:06,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:06,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050369030] [2019-12-18 13:31:06,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:06,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:06,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442587408] [2019-12-18 13:31:06,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:31:06,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:06,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:31:06,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:31:06,488 INFO L87 Difference]: Start difference. First operand 11253 states and 35607 transitions. Second operand 4 states. [2019-12-18 13:31:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:06,544 INFO L93 Difference]: Finished difference Result 1887 states and 4356 transitions. [2019-12-18 13:31:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:31:06,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:31:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:06,549 INFO L225 Difference]: With dead ends: 1887 [2019-12-18 13:31:06,549 INFO L226 Difference]: Without dead ends: 1601 [2019-12-18 13:31:06,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-12-18 13:31:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2019-12-18 13:31:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-12-18 13:31:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 3565 transitions. [2019-12-18 13:31:07,088 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 3565 transitions. Word has length 11 [2019-12-18 13:31:07,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:07,088 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 3565 transitions. [2019-12-18 13:31:07,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:31:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 3565 transitions. [2019-12-18 13:31:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 13:31:07,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:07,095 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-18 13:31:07,096 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:07,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1717219497, now seen corresponding path program 1 times [2019-12-18 13:31:07,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:07,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80247291] [2019-12-18 13:31:07,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:07,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80247291] [2019-12-18 13:31:07,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:07,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:07,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767623567] [2019-12-18 13:31:07,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:07,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:07,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:07,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:07,281 INFO L87 Difference]: Start difference. First operand 1601 states and 3565 transitions. Second operand 5 states. [2019-12-18 13:31:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:07,598 INFO L93 Difference]: Finished difference Result 2053 states and 4473 transitions. [2019-12-18 13:31:07,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:31:07,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-18 13:31:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:07,604 INFO L225 Difference]: With dead ends: 2053 [2019-12-18 13:31:07,604 INFO L226 Difference]: Without dead ends: 2053 [2019-12-18 13:31:07,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-12-18 13:31:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1824. [2019-12-18 13:31:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2019-12-18 13:31:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 4021 transitions. [2019-12-18 13:31:07,645 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 4021 transitions. Word has length 23 [2019-12-18 13:31:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:07,646 INFO L462 AbstractCegarLoop]: Abstraction has 1824 states and 4021 transitions. [2019-12-18 13:31:07,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 4021 transitions. [2019-12-18 13:31:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:31:07,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:07,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:07,650 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:07,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:07,650 INFO L82 PathProgramCache]: Analyzing trace with hash 736634855, now seen corresponding path program 1 times [2019-12-18 13:31:07,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:07,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841884802] [2019-12-18 13:31:07,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:07,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841884802] [2019-12-18 13:31:07,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:07,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:07,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262540506] [2019-12-18 13:31:07,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:07,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:07,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:07,849 INFO L87 Difference]: Start difference. First operand 1824 states and 4021 transitions. Second operand 6 states. [2019-12-18 13:31:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:08,237 INFO L93 Difference]: Finished difference Result 2140 states and 4675 transitions. [2019-12-18 13:31:08,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:08,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 13:31:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:08,244 INFO L225 Difference]: With dead ends: 2140 [2019-12-18 13:31:08,244 INFO L226 Difference]: Without dead ends: 2139 [2019-12-18 13:31:08,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:31:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-12-18 13:31:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1913. [2019-12-18 13:31:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1913 states. [2019-12-18 13:31:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 4214 transitions. [2019-12-18 13:31:08,288 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 4214 transitions. Word has length 37 [2019-12-18 13:31:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:08,289 INFO L462 AbstractCegarLoop]: Abstraction has 1913 states and 4214 transitions. [2019-12-18 13:31:08,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:31:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 4214 transitions. [2019-12-18 13:31:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:31:08,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:08,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:08,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 736375509, now seen corresponding path program 1 times [2019-12-18 13:31:08,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:08,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679249821] [2019-12-18 13:31:08,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:08,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679249821] [2019-12-18 13:31:08,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:08,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:31:08,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380099470] [2019-12-18 13:31:08,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:08,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:08,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:08,340 INFO L87 Difference]: Start difference. First operand 1913 states and 4214 transitions. Second operand 3 states. [2019-12-18 13:31:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:08,393 INFO L93 Difference]: Finished difference Result 2286 states and 5054 transitions. [2019-12-18 13:31:08,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:08,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-18 13:31:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:08,400 INFO L225 Difference]: With dead ends: 2286 [2019-12-18 13:31:08,401 INFO L226 Difference]: Without dead ends: 2286 [2019-12-18 13:31:08,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2019-12-18 13:31:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2176. [2019-12-18 13:31:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2176 states. [2019-12-18 13:31:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 4831 transitions. [2019-12-18 13:31:08,447 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 4831 transitions. Word has length 37 [2019-12-18 13:31:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:08,447 INFO L462 AbstractCegarLoop]: Abstraction has 2176 states and 4831 transitions. [2019-12-18 13:31:08,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 4831 transitions. [2019-12-18 13:31:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 13:31:08,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:08,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:08,452 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:08,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1247447097, now seen corresponding path program 1 times [2019-12-18 13:31:08,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:08,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294271053] [2019-12-18 13:31:08,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:08,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294271053] [2019-12-18 13:31:08,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:08,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:08,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178507613] [2019-12-18 13:31:08,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:08,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:08,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:08,571 INFO L87 Difference]: Start difference. First operand 2176 states and 4831 transitions. Second operand 6 states. [2019-12-18 13:31:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:08,981 INFO L93 Difference]: Finished difference Result 2496 states and 5480 transitions. [2019-12-18 13:31:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:31:08,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-18 13:31:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:08,992 INFO L225 Difference]: With dead ends: 2496 [2019-12-18 13:31:08,992 INFO L226 Difference]: Without dead ends: 2495 [2019-12-18 13:31:08,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:31:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2019-12-18 13:31:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2208. [2019-12-18 13:31:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2208 states. [2019-12-18 13:31:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 4902 transitions. [2019-12-18 13:31:09,039 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 4902 transitions. Word has length 37 [2019-12-18 13:31:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,040 INFO L462 AbstractCegarLoop]: Abstraction has 2208 states and 4902 transitions. [2019-12-18 13:31:09,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:31:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 4902 transitions. [2019-12-18 13:31:09,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:31:09,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:09,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] [2019-12-18 13:31:09,045 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:09,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1448438286, now seen corresponding path program 1 times [2019-12-18 13:31:09,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:09,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071948158] [2019-12-18 13:31:09,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:09,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071948158] [2019-12-18 13:31:09,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:09,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:09,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313995034] [2019-12-18 13:31:09,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:09,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:09,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:09,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:09,132 INFO L87 Difference]: Start difference. First operand 2208 states and 4902 transitions. Second operand 5 states. [2019-12-18 13:31:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:09,623 INFO L93 Difference]: Finished difference Result 2933 states and 6390 transitions. [2019-12-18 13:31:09,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:09,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 13:31:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:09,632 INFO L225 Difference]: With dead ends: 2933 [2019-12-18 13:31:09,632 INFO L226 Difference]: Without dead ends: 2933 [2019-12-18 13:31:09,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:09,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2019-12-18 13:31:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2639. [2019-12-18 13:31:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-18 13:31:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5800 transitions. [2019-12-18 13:31:09,683 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5800 transitions. Word has length 41 [2019-12-18 13:31:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,683 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5800 transitions. [2019-12-18 13:31:09,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5800 transitions. [2019-12-18 13:31:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:31:09,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:09,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:09,690 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:09,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1707003335, now seen corresponding path program 1 times [2019-12-18 13:31:09,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:09,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743168524] [2019-12-18 13:31:09,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:09,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743168524] [2019-12-18 13:31:09,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:09,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:09,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238433865] [2019-12-18 13:31:09,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:09,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:09,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:09,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:09,760 INFO L87 Difference]: Start difference. First operand 2639 states and 5800 transitions. Second operand 3 states. [2019-12-18 13:31:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:09,783 INFO L93 Difference]: Finished difference Result 2639 states and 5738 transitions. [2019-12-18 13:31:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:09,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 13:31:09,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:09,790 INFO L225 Difference]: With dead ends: 2639 [2019-12-18 13:31:09,790 INFO L226 Difference]: Without dead ends: 2639 [2019-12-18 13:31:09,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-12-18 13:31:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2631. [2019-12-18 13:31:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2019-12-18 13:31:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 5722 transitions. [2019-12-18 13:31:09,842 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 5722 transitions. Word has length 42 [2019-12-18 13:31:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,843 INFO L462 AbstractCegarLoop]: Abstraction has 2631 states and 5722 transitions. [2019-12-18 13:31:09,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:09,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 5722 transitions. [2019-12-18 13:31:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:31:09,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:09,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:31:09,851 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash -238839865, now seen corresponding path program 1 times [2019-12-18 13:31:09,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:09,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464873396] [2019-12-18 13:31:09,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:09,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464873396] [2019-12-18 13:31:09,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:09,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:31:09,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781058757] [2019-12-18 13:31:09,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:31:09,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:31:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:31:09,944 INFO L87 Difference]: Start difference. First operand 2631 states and 5722 transitions. Second operand 5 states. [2019-12-18 13:31:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:09,987 INFO L93 Difference]: Finished difference Result 587 states and 1050 transitions. [2019-12-18 13:31:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:31:09,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 13:31:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:09,989 INFO L225 Difference]: With dead ends: 587 [2019-12-18 13:31:09,990 INFO L226 Difference]: Without dead ends: 518 [2019-12-18 13:31:09,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-18 13:31:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 434. [2019-12-18 13:31:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-18 13:31:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 762 transitions. [2019-12-18 13:31:09,997 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 762 transitions. Word has length 42 [2019-12-18 13:31:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:09,998 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 762 transitions. [2019-12-18 13:31:09,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:31:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 762 transitions. [2019-12-18 13:31:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:10,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:10,000 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-18 13:31:10,000 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:10,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2130042739, now seen corresponding path program 1 times [2019-12-18 13:31:10,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:10,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279581343] [2019-12-18 13:31:10,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:10,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279581343] [2019-12-18 13:31:10,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:10,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:31:10,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096925514] [2019-12-18 13:31:10,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:31:10,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:10,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:31:10,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:31:10,189 INFO L87 Difference]: Start difference. First operand 434 states and 762 transitions. Second operand 6 states. [2019-12-18 13:31:10,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:10,386 INFO L93 Difference]: Finished difference Result 563 states and 981 transitions. [2019-12-18 13:31:10,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:31:10,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-18 13:31:10,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:10,388 INFO L225 Difference]: With dead ends: 563 [2019-12-18 13:31:10,389 INFO L226 Difference]: Without dead ends: 563 [2019-12-18 13:31:10,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:10,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-18 13:31:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 448. [2019-12-18 13:31:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-18 13:31:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 788 transitions. [2019-12-18 13:31:10,398 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 788 transitions. Word has length 53 [2019-12-18 13:31:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:10,398 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 788 transitions. [2019-12-18 13:31:10,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:31:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 788 transitions. [2019-12-18 13:31:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:10,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:10,400 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-18 13:31:10,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1191623101, now seen corresponding path program 2 times [2019-12-18 13:31:10,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:10,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379865742] [2019-12-18 13:31:10,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:10,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379865742] [2019-12-18 13:31:10,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:10,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:31:10,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619736837] [2019-12-18 13:31:10,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:31:10,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:10,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:31:10,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:31:10,646 INFO L87 Difference]: Start difference. First operand 448 states and 788 transitions. Second operand 10 states. [2019-12-18 13:31:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:11,451 INFO L93 Difference]: Finished difference Result 743 states and 1293 transitions. [2019-12-18 13:31:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 13:31:11,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-18 13:31:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:11,455 INFO L225 Difference]: With dead ends: 743 [2019-12-18 13:31:11,455 INFO L226 Difference]: Without dead ends: 743 [2019-12-18 13:31:11,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:31:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-12-18 13:31:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 444. [2019-12-18 13:31:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-18 13:31:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 777 transitions. [2019-12-18 13:31:11,465 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 777 transitions. Word has length 53 [2019-12-18 13:31:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:11,465 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 777 transitions. [2019-12-18 13:31:11,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:31:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 777 transitions. [2019-12-18 13:31:11,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 13:31:11,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:11,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] [2019-12-18 13:31:11,467 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:11,468 INFO L82 PathProgramCache]: Analyzing trace with hash -424695835, now seen corresponding path program 3 times [2019-12-18 13:31:11,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:11,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867636004] [2019-12-18 13:31:11,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:11,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867636004] [2019-12-18 13:31:11,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:11,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:31:11,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542884797] [2019-12-18 13:31:11,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:31:11,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:11,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:31:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:11,535 INFO L87 Difference]: Start difference. First operand 444 states and 777 transitions. Second operand 3 states. [2019-12-18 13:31:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:11,565 INFO L93 Difference]: Finished difference Result 443 states and 775 transitions. [2019-12-18 13:31:11,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:31:11,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 13:31:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:11,567 INFO L225 Difference]: With dead ends: 443 [2019-12-18 13:31:11,567 INFO L226 Difference]: Without dead ends: 443 [2019-12-18 13:31:11,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:31:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-12-18 13:31:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 355. [2019-12-18 13:31:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-18 13:31:11,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 611 transitions. [2019-12-18 13:31:11,576 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 611 transitions. Word has length 53 [2019-12-18 13:31:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:11,577 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 611 transitions. [2019-12-18 13:31:11,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:31:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 611 transitions. [2019-12-18 13:31:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:31:11,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:11,578 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-18 13:31:11,579 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash -752439480, now seen corresponding path program 1 times [2019-12-18 13:31:11,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:11,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402125446] [2019-12-18 13:31:11,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:31:11,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:31:11,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402125446] [2019-12-18 13:31:11,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:31:11,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:31:11,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259547116] [2019-12-18 13:31:11,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:31:11,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:31:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:31:11,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:31:11,749 INFO L87 Difference]: Start difference. First operand 355 states and 611 transitions. Second operand 7 states. [2019-12-18 13:31:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:31:11,851 INFO L93 Difference]: Finished difference Result 558 states and 967 transitions. [2019-12-18 13:31:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:31:11,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 13:31:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:31:11,852 INFO L225 Difference]: With dead ends: 558 [2019-12-18 13:31:11,852 INFO L226 Difference]: Without dead ends: 220 [2019-12-18 13:31:11,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:31:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-18 13:31:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-18 13:31:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-18 13:31:11,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 337 transitions. [2019-12-18 13:31:11,857 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 337 transitions. Word has length 54 [2019-12-18 13:31:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:31:11,857 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 337 transitions. [2019-12-18 13:31:11,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:31:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 337 transitions. [2019-12-18 13:31:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 13:31:11,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:31:11,858 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-18 13:31:11,859 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:31:11,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:31:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 516281010, now seen corresponding path program 2 times [2019-12-18 13:31:11,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:31:11,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393530287] [2019-12-18 13:31:11,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:31:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:31:11,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:31:11,968 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:31:11,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$r_buff1_thd2~0_157) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1095~0.base_20|) |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0)) |v_#memory_int_17|) (= |v_#NULL.offset_6| 0) (= v_~x$mem_tmp~0_21 0) (= 0 v_~x$w_buff0~0_235) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~x$w_buff1~0_175) (= 0 v_~x$w_buff1_used~0_360) (= v_~weak$$choice2~0_113 0) (= 0 v_~x$read_delayed~0_5) (= 0 v_~x$r_buff0_thd2~0_211) (= (store .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20| 1) |v_#valid_44|) (= v_~main$tmp_guard1~0_26 0) (= v_~x$r_buff0_thd0~0_331 0) (= |v_ULTIMATE.start_main_~#t1095~0.offset_15| 0) (= v_~x$r_buff1_thd0~0_268 0) (= v_~__unbuffered_p1_EAX~0_126 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff1_thd1~0_198 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1095~0.base_20|)) (= 0 v_~__unbuffered_cnt~0_64) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EBX~0_126) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1095~0.base_20| 4) |v_#length_17|) (= 0 v_~x$w_buff0_used~0_638) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1095~0.base_20|) (= 0 v_~x~0_158) (= v_~x$flush_delayed~0_38 0) (= v_~z~0_80 0) (= v_~y~0_115 0) (= v_~x$r_buff0_thd1~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_235, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_45|, ~x$flush_delayed~0=v_~x$flush_delayed~0_38, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_34|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_126, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_17|, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_331, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_35|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_24|, ~x$w_buff1~0=v_~x$w_buff1~0_175, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_24|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_360, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_157, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_29|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_30|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~x~0=v_~x~0_158, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_45|, ~x$mem_tmp~0=v_~x$mem_tmp~0_21, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_46|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_36|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_26|, ULTIMATE.start_main_~#t1095~0.offset=|v_ULTIMATE.start_main_~#t1095~0.offset_15|, ~y~0=v_~y~0_115, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_126, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_34|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_268, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_211, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_638, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_17|, ~z~0=v_~z~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_113, ULTIMATE.start_main_~#t1095~0.base=|v_ULTIMATE.start_main_~#t1095~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_5} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1096~0.offset, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1096~0.base, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1095~0.offset, ~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, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1095~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 13:31:11,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L789-1-->L791: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1096~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1096~0.offset_10| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1096~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1096~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1096~0.base_11|) |v_ULTIMATE.start_main_~#t1096~0.offset_10| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1096~0.base=|v_ULTIMATE.start_main_~#t1096~0.base_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1096~0.offset=|v_ULTIMATE.start_main_~#t1096~0.offset_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1096~0.base, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1096~0.offset] because there is no mapped edge [2019-12-18 13:31:11,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= 1 v_~x$w_buff0_used~0_78) (= (mod v_~x$w_buff1_used~0_47 256) 0) (= 2 v_~x$w_buff0~0_19) (= v_~x$w_buff0~0_20 v_~x$w_buff1~0_15) (= v_~x$w_buff1_used~0_47 v_~x$w_buff0_used~0_79) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_79} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, ~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_47, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 13:31:11,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L732-2-->L732-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In107706644 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out107706644| |P0Thread1of1ForFork0_#t~ite4_Out107706644|)) (.cse2 (= (mod ~x$w_buff1_used~0_In107706644 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out107706644| ~x~0_In107706644) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out107706644| ~x$w_buff1~0_In107706644)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In107706644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In107706644, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In107706644, ~x~0=~x~0_In107706644} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out107706644|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out107706644|, ~x$w_buff1~0=~x$w_buff1~0_In107706644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In107706644, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In107706644, ~x~0=~x~0_In107706644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 13:31:11,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In281413280 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In281413280 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out281413280| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out281413280| ~x$w_buff0_used~0_In281413280) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In281413280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In281413280} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out281413280|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In281413280, ~x$w_buff0_used~0=~x$w_buff0_used~0_In281413280} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:31:11,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In443500370 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In443500370 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In443500370 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In443500370 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out443500370| ~x$w_buff1_used~0_In443500370) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out443500370| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In443500370, ~x$w_buff1_used~0=~x$w_buff1_used~0_In443500370, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In443500370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In443500370} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out443500370|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In443500370, ~x$w_buff1_used~0=~x$w_buff1_used~0_In443500370, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In443500370, ~x$w_buff0_used~0=~x$w_buff0_used~0_In443500370} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:31:11,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-621969180 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-621969180 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-621969180 |P0Thread1of1ForFork0_#t~ite7_Out-621969180|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out-621969180|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-621969180, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-621969180} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-621969180, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-621969180|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-621969180} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 13:31:11,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In2144319484 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In2144319484 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In2144319484 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2144319484 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2144319484|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out2144319484| ~x$r_buff1_thd1~0_In2144319484) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2144319484, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2144319484, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2144319484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2144319484} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2144319484, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2144319484|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2144319484, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2144319484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2144319484} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:31:11,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_144 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_144} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 13:31:11,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-529532124 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-529532124 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-529532124| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-529532124 |P1Thread1of1ForFork1_#t~ite11_Out-529532124|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-529532124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529532124} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-529532124|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-529532124, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-529532124} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:31:11,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1111768838 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1111768838 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In1111768838 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1111768838 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out1111768838| ~x$w_buff1_used~0_In1111768838)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out1111768838| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1111768838, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1111768838, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1111768838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111768838} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1111768838, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1111768838, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1111768838|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1111768838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1111768838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:31:11,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L769-->L770: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1582780666 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1582780666 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In1582780666 ~x$r_buff0_thd2~0_Out1582780666) (or .cse0 .cse1)) (and (= 0 ~x$r_buff0_thd2~0_Out1582780666) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1582780666, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1582780666} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1582780666|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1582780666, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1582780666} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 13:31:11,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L770-->L770-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1362074366 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In-1362074366 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1362074366 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1362074366 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-1362074366 |P1Thread1of1ForFork1_#t~ite14_Out-1362074366|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1362074366| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1362074366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1362074366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1362074366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1362074366} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1362074366, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1362074366, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1362074366, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1362074366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1362074366} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:31:11,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L770-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_134 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_134, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:31:11,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_128 256) 0) (= 0 (mod v_~x$w_buff0_used~0_232 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_232} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 13:31:11,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1265928681 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1265928681 256)))) (or (and (= ~x~0_In-1265928681 |ULTIMATE.start_main_#t~ite17_Out-1265928681|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out-1265928681| ~x$w_buff1~0_In-1265928681) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1265928681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265928681, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1265928681, ~x~0=~x~0_In-1265928681} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1265928681|, ~x$w_buff1~0=~x$w_buff1~0_In-1265928681, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1265928681, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1265928681, ~x~0=~x~0_In-1265928681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 13:31:11,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L797-4-->L798: Formula: (= v_~x~0_43 |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|, ~x~0=v_~x~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 13:31:11,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1892150075 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1892150075 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1892150075 |ULTIMATE.start_main_#t~ite19_Out1892150075|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite19_Out1892150075| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1892150075, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1892150075} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1892150075, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1892150075|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1892150075} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 13:31:11,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1501974157 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1501974157 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1501974157 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1501974157 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite20_Out1501974157|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite20_Out1501974157| ~x$w_buff1_used~0_In1501974157)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1501974157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1501974157, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1501974157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1501974157} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1501974157, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1501974157, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1501974157|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1501974157, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1501974157} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 13:31:11,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-392479354 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-392479354 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-392479354|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-392479354| ~x$r_buff0_thd0~0_In-392479354)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392479354, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392479354} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392479354, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-392479354|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392479354} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 13:31:11,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-2028499488 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In-2028499488 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2028499488 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-2028499488 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-2028499488|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In-2028499488 |ULTIMATE.start_main_#t~ite22_Out-2028499488|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2028499488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028499488, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2028499488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028499488} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2028499488, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2028499488, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2028499488, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2028499488|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2028499488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 13:31:11,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-582809047 256)))) (or (and (= |ULTIMATE.start_main_#t~ite31_Out-582809047| ~x$w_buff1~0_In-582809047) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-582809047 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-582809047 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-582809047 256)) (and (= (mod ~x$r_buff1_thd0~0_In-582809047 256) 0) .cse1))) (= |ULTIMATE.start_main_#t~ite31_Out-582809047| |ULTIMATE.start_main_#t~ite32_Out-582809047|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_Out-582809047| ~x$w_buff1~0_In-582809047) (= |ULTIMATE.start_main_#t~ite31_In-582809047| |ULTIMATE.start_main_#t~ite31_Out-582809047|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-582809047, ~x$w_buff1~0=~x$w_buff1~0_In-582809047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582809047, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-582809047, ~weak$$choice2~0=~weak$$choice2~0_In-582809047, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-582809047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582809047} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-582809047, ~x$w_buff1~0=~x$w_buff1~0_In-582809047, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-582809047, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-582809047|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-582809047, ~weak$$choice2~0=~weak$$choice2~0_In-582809047, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-582809047|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-582809047} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-18 13:31:11,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In707496418 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out707496418| |ULTIMATE.start_main_#t~ite37_Out707496418|) (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In707496418 256) 0))) (or (and (= (mod ~x$r_buff1_thd0~0_In707496418 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In707496418 256) 0) (and (= (mod ~x$w_buff1_used~0_In707496418 256) 0) .cse0))) (= ~x$w_buff1_used~0_In707496418 |ULTIMATE.start_main_#t~ite37_Out707496418|) .cse1) (and (= ~x$w_buff1_used~0_In707496418 |ULTIMATE.start_main_#t~ite38_Out707496418|) (= |ULTIMATE.start_main_#t~ite37_In707496418| |ULTIMATE.start_main_#t~ite37_Out707496418|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In707496418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In707496418, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In707496418|, ~weak$$choice2~0=~weak$$choice2~0_In707496418, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In707496418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707496418} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In707496418, ~x$w_buff1_used~0=~x$w_buff1_used~0_In707496418, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out707496418|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out707496418|, ~weak$$choice2~0=~weak$$choice2~0_In707496418, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In707496418, ~x$w_buff0_used~0=~x$w_buff0_used~0_In707496418} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 13:31:11,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [602] [602] L813-->L814: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~x$r_buff0_thd0~0_85 v_~x$r_buff0_thd0~0_84)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_84, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 13:31:11,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L816-->L819-1: Formula: (and (= v_~x$mem_tmp~0_16 v_~x~0_122) (not (= 0 (mod v_~x$flush_delayed~0_31 256))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$flush_delayed~0_30 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ~x~0=v_~x~0_122, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_27|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:31:11,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] 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-18 13:31:12,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:31:12 BasicIcfg [2019-12-18 13:31:12,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:31:12,085 INFO L168 Benchmark]: Toolchain (without parser) took 15276.60 ms. Allocated memory was 138.9 MB in the beginning and 552.1 MB in the end (delta: 413.1 MB). Free memory was 102.4 MB in the beginning and 198.7 MB in the end (delta: -96.3 MB). Peak memory consumption was 316.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,086 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.14 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,087 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 203.4 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,088 INFO L168 Benchmark]: Boogie Preprocessor took 39.30 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,089 INFO L168 Benchmark]: RCFGBuilder took 797.32 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 108.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,090 INFO L168 Benchmark]: TraceAbstraction took 13598.39 ms. Allocated memory was 203.4 MB in the beginning and 552.1 MB in the end (delta: 348.7 MB). Free memory was 107.4 MB in the beginning and 198.7 MB in the end (delta: -91.3 MB). Peak memory consumption was 257.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:31:12,094 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.14 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 157.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.11 ms. Allocated memory is still 203.4 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.30 ms. Allocated memory is still 203.4 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 797.32 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 108.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13598.39 ms. Allocated memory was 203.4 MB in the beginning and 552.1 MB in the end (delta: 348.7 MB). Free memory was 107.4 MB in the beginning and 198.7 MB in the end (delta: -91.3 MB). Peak memory consumption was 257.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 88 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 3874 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 57 SemBasedMoverChecksPositive, 186 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 45620 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1095, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1096, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L751] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L752] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L753] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L754] 2 x$r_buff0_thd2 = (_Bool)1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 __unbuffered_p1_EBX = z 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L726] 1 z = 1 [L729] 1 x = 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L732] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L734] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L735] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L766] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [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=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L799] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L800] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L801] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 x$flush_delayed = weak$$choice2 [L807] 0 x$mem_tmp = x 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L809] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L810] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L811] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L812] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(x == 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=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1833 SDtfs, 1528 SDslu, 3671 SDs, 0 SdLazy, 2153 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 21 SyntacticMatches, 20 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11253occurred 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.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 3273 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 553 NumberOfCodeBlocks, 553 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 83675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...