/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:57:02,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:57:02,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:57:02,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:57:02,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:57:02,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:57:02,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:57:02,512 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:57:02,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:57:02,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:57:02,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:57:02,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:57:02,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:57:02,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:57:02,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:57:02,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:57:02,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:57:02,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:57:02,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:57:02,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:57:02,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:57:02,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:57:02,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:57:02,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:57:02,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:57:02,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:57:02,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:57:02,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:57:02,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:57:02,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:57:02,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:57:02,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:57:02,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:57:02,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:57:02,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:57:02,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:57:02,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:57:02,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:57:02,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:57:02,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:57:02,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:57:02,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:57:02,599 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:57:02,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:57:02,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:57:02,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:57:02,604 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:57:02,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:57:02,604 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:57:02,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:57:02,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:57:02,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:57:02,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:57:02,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:57:02,605 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:57:02,605 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:57:02,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:57:02,607 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:57:02,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:57:02,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:57:02,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:57:02,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:57:02,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:57:02,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:57:02,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:57:02,608 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:57:02,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:57:02,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:57:02,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:57:02,610 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:57:02,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:57:02,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:57:02,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:57:02,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:57:02,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:57:02,910 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:57:02,910 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:57:02,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-27 06:57:02,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6495b61/90d73e81c62c49ccb10bc3b0ca29fbcc/FLAG7b377ecf7 [2019-12-27 06:57:03,567 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:57:03,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2019-12-27 06:57:03,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6495b61/90d73e81c62c49ccb10bc3b0ca29fbcc/FLAG7b377ecf7 [2019-12-27 06:57:03,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6495b61/90d73e81c62c49ccb10bc3b0ca29fbcc [2019-12-27 06:57:03,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:57:03,829 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:57:03,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:57:03,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:57:03,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:57:03,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:57:03" (1/1) ... [2019-12-27 06:57:03,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:03, skipping insertion in model container [2019-12-27 06:57:03,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:57:03" (1/1) ... [2019-12-27 06:57:03,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:57:03,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:57:04,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:57:04,481 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:57:04,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:57:04,648 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:57:04,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04 WrapperNode [2019-12-27 06:57:04,649 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:57:04,650 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:57:04,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:57:04,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:57:04,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:57:04,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:57:04,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:57:04,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:57:04,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... [2019-12-27 06:57:04,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:57:04,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:57:04,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:57:04,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:57:04,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:57:04,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:57:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:57:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:57:04,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:57:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:57:04,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:57:04,863 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:57:04,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:57:04,865 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:57:04,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:57:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:57:04,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:57:04,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:57:04,868 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:57:05,651 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:57:05,651 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:57:05,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:57:05 BoogieIcfgContainer [2019-12-27 06:57:05,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:57:05,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:57:05,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:57:05,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:57:05,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:57:03" (1/3) ... [2019-12-27 06:57:05,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5653e1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:57:05, skipping insertion in model container [2019-12-27 06:57:05,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:57:04" (2/3) ... [2019-12-27 06:57:05,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5653e1c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:57:05, skipping insertion in model container [2019-12-27 06:57:05,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:57:05" (3/3) ... [2019-12-27 06:57:05,662 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2019-12-27 06:57:05,673 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:57:05,673 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:57:05,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:57:05,682 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:57:05,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,730 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,730 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,731 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,742 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,743 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,744 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,748 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,751 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:57:05,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:57:05,782 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:57:05,782 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:57:05,782 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:57:05,782 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:57:05,782 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:57:05,782 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:57:05,783 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:57:05,783 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:57:05,823 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 06:57:05,833 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 06:57:05,952 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 06:57:05,952 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:57:05,966 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:57:05,986 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 06:57:06,034 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 06:57:06,034 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:57:06,040 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 06:57:06,054 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 06:57:06,055 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:57:08,958 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-27 06:57:09,277 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 06:57:09,384 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 06:57:09,404 INFO L206 etLargeBlockEncoding]: Checked pairs total: 51676 [2019-12-27 06:57:09,404 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 06:57:09,407 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 97 transitions [2019-12-27 06:57:10,500 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 18542 states. [2019-12-27 06:57:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 18542 states. [2019-12-27 06:57:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 06:57:10,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:10,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:10,510 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:10,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:10,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1984617832, now seen corresponding path program 1 times [2019-12-27 06:57:10,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:10,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804982977] [2019-12-27 06:57:10,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:10,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804982977] [2019-12-27 06:57:10,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:10,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:57:10,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48794293] [2019-12-27 06:57:10,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:10,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:10,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:10,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:10,849 INFO L87 Difference]: Start difference. First operand 18542 states. Second operand 3 states. [2019-12-27 06:57:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:11,350 INFO L93 Difference]: Finished difference Result 18414 states and 69758 transitions. [2019-12-27 06:57:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:11,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 06:57:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:11,610 INFO L225 Difference]: With dead ends: 18414 [2019-12-27 06:57:11,611 INFO L226 Difference]: Without dead ends: 18050 [2019-12-27 06:57:11,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18050 states. [2019-12-27 06:57:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18050 to 18050. [2019-12-27 06:57:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18050 states. [2019-12-27 06:57:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18050 states to 18050 states and 68456 transitions. [2019-12-27 06:57:13,059 INFO L78 Accepts]: Start accepts. Automaton has 18050 states and 68456 transitions. Word has length 7 [2019-12-27 06:57:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:13,060 INFO L462 AbstractCegarLoop]: Abstraction has 18050 states and 68456 transitions. [2019-12-27 06:57:13,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 18050 states and 68456 transitions. [2019-12-27 06:57:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:57:13,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:13,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:13,067 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -975860123, now seen corresponding path program 1 times [2019-12-27 06:57:13,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:13,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823338545] [2019-12-27 06:57:13,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:13,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823338545] [2019-12-27 06:57:13,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:13,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:13,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407009406] [2019-12-27 06:57:13,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:57:13,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:57:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:57:13,206 INFO L87 Difference]: Start difference. First operand 18050 states and 68456 transitions. Second operand 4 states. [2019-12-27 06:57:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:14,000 INFO L93 Difference]: Finished difference Result 28066 states and 102408 transitions. [2019-12-27 06:57:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:57:14,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:57:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:14,140 INFO L225 Difference]: With dead ends: 28066 [2019-12-27 06:57:14,140 INFO L226 Difference]: Without dead ends: 28052 [2019-12-27 06:57:14,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28052 states. [2019-12-27 06:57:15,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28052 to 25418. [2019-12-27 06:57:15,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25418 states. [2019-12-27 06:57:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25418 states to 25418 states and 94124 transitions. [2019-12-27 06:57:15,280 INFO L78 Accepts]: Start accepts. Automaton has 25418 states and 94124 transitions. Word has length 13 [2019-12-27 06:57:15,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:15,281 INFO L462 AbstractCegarLoop]: Abstraction has 25418 states and 94124 transitions. [2019-12-27 06:57:15,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:57:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 25418 states and 94124 transitions. [2019-12-27 06:57:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:57:15,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:15,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:15,288 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash -595379205, now seen corresponding path program 1 times [2019-12-27 06:57:15,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:15,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439879451] [2019-12-27 06:57:15,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:15,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439879451] [2019-12-27 06:57:15,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:15,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:15,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800992138] [2019-12-27 06:57:15,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:15,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:15,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:15,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:15,386 INFO L87 Difference]: Start difference. First operand 25418 states and 94124 transitions. Second operand 3 states. [2019-12-27 06:57:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:16,415 INFO L93 Difference]: Finished difference Result 14452 states and 46370 transitions. [2019-12-27 06:57:16,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:16,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:57:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:16,497 INFO L225 Difference]: With dead ends: 14452 [2019-12-27 06:57:16,498 INFO L226 Difference]: Without dead ends: 14452 [2019-12-27 06:57:16,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14452 states. [2019-12-27 06:57:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14452 to 14452. [2019-12-27 06:57:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14452 states. [2019-12-27 06:57:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 46370 transitions. [2019-12-27 06:57:16,873 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 46370 transitions. Word has length 13 [2019-12-27 06:57:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:16,873 INFO L462 AbstractCegarLoop]: Abstraction has 14452 states and 46370 transitions. [2019-12-27 06:57:16,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 46370 transitions. [2019-12-27 06:57:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:57:16,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:16,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:16,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:16,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1512112924, now seen corresponding path program 1 times [2019-12-27 06:57:16,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:16,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195279656] [2019-12-27 06:57:16,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:16,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195279656] [2019-12-27 06:57:16,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:57:16,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011802999] [2019-12-27 06:57:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:57:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:16,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:57:16,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:57:16,940 INFO L87 Difference]: Start difference. First operand 14452 states and 46370 transitions. Second operand 4 states. [2019-12-27 06:57:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:16,979 INFO L93 Difference]: Finished difference Result 2114 states and 4969 transitions. [2019-12-27 06:57:16,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:57:16,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 06:57:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:16,983 INFO L225 Difference]: With dead ends: 2114 [2019-12-27 06:57:16,983 INFO L226 Difference]: Without dead ends: 2114 [2019-12-27 06:57:16,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:57:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-12-27 06:57:17,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2114. [2019-12-27 06:57:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-12-27 06:57:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 4969 transitions. [2019-12-27 06:57:17,024 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 4969 transitions. Word has length 14 [2019-12-27 06:57:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:17,025 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 4969 transitions. [2019-12-27 06:57:17,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:57:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 4969 transitions. [2019-12-27 06:57:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 06:57:17,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:17,027 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:57:17,028 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:17,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:17,028 INFO L82 PathProgramCache]: Analyzing trace with hash 107168072, now seen corresponding path program 1 times [2019-12-27 06:57:17,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:17,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474902690] [2019-12-27 06:57:17,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:17,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474902690] [2019-12-27 06:57:17,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:17,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:57:17,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960871362] [2019-12-27 06:57:17,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:57:17,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:17,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:57:17,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:17,092 INFO L87 Difference]: Start difference. First operand 2114 states and 4969 transitions. Second operand 5 states. [2019-12-27 06:57:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:17,124 INFO L93 Difference]: Finished difference Result 699 states and 1627 transitions. [2019-12-27 06:57:17,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:57:17,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 06:57:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:17,126 INFO L225 Difference]: With dead ends: 699 [2019-12-27 06:57:17,126 INFO L226 Difference]: Without dead ends: 655 [2019-12-27 06:57:17,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-27 06:57:17,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 599. [2019-12-27 06:57:17,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 06:57:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1405 transitions. [2019-12-27 06:57:17,144 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1405 transitions. Word has length 26 [2019-12-27 06:57:17,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:17,145 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1405 transitions. [2019-12-27 06:57:17,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:57:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1405 transitions. [2019-12-27 06:57:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:57:17,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:17,148 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, 1] [2019-12-27 06:57:17,149 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:17,149 INFO L82 PathProgramCache]: Analyzing trace with hash 523730057, now seen corresponding path program 1 times [2019-12-27 06:57:17,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:17,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191871590] [2019-12-27 06:57:17,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:17,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191871590] [2019-12-27 06:57:17,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:17,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:57:17,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205683439] [2019-12-27 06:57:17,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:17,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:17,251 INFO L87 Difference]: Start difference. First operand 599 states and 1405 transitions. Second operand 3 states. [2019-12-27 06:57:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:17,323 INFO L93 Difference]: Finished difference Result 609 states and 1420 transitions. [2019-12-27 06:57:17,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:17,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:57:17,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:17,326 INFO L225 Difference]: With dead ends: 609 [2019-12-27 06:57:17,326 INFO L226 Difference]: Without dead ends: 609 [2019-12-27 06:57:17,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-27 06:57:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 605. [2019-12-27 06:57:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 06:57:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1416 transitions. [2019-12-27 06:57:17,345 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1416 transitions. Word has length 55 [2019-12-27 06:57:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:17,346 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1416 transitions. [2019-12-27 06:57:17,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:17,346 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1416 transitions. [2019-12-27 06:57:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:57:17,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:17,348 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, 1] [2019-12-27 06:57:17,348 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:17,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1466894421, now seen corresponding path program 1 times [2019-12-27 06:57:17,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:17,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662112227] [2019-12-27 06:57:17,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:17,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662112227] [2019-12-27 06:57:17,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:17,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:57:17,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355093902] [2019-12-27 06:57:17,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:57:17,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:17,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:57:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:57:17,517 INFO L87 Difference]: Start difference. First operand 605 states and 1416 transitions. Second operand 5 states. [2019-12-27 06:57:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:17,771 INFO L93 Difference]: Finished difference Result 894 states and 2088 transitions. [2019-12-27 06:57:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:57:17,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 06:57:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:17,774 INFO L225 Difference]: With dead ends: 894 [2019-12-27 06:57:17,774 INFO L226 Difference]: Without dead ends: 894 [2019-12-27 06:57:17,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-12-27 06:57:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 719. [2019-12-27 06:57:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-27 06:57:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1697 transitions. [2019-12-27 06:57:17,790 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1697 transitions. Word has length 55 [2019-12-27 06:57:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:17,792 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1697 transitions. [2019-12-27 06:57:17,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:57:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1697 transitions. [2019-12-27 06:57:17,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:57:17,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:17,794 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, 1] [2019-12-27 06:57:17,795 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:17,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:17,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1931223363, now seen corresponding path program 2 times [2019-12-27 06:57:17,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:17,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983870806] [2019-12-27 06:57:17,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:17,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983870806] [2019-12-27 06:57:17,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:17,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:57:17,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846723952] [2019-12-27 06:57:17,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:57:17,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:57:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:17,958 INFO L87 Difference]: Start difference. First operand 719 states and 1697 transitions. Second operand 6 states. [2019-12-27 06:57:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:18,329 INFO L93 Difference]: Finished difference Result 1193 states and 2783 transitions. [2019-12-27 06:57:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:57:18,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 06:57:18,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:18,332 INFO L225 Difference]: With dead ends: 1193 [2019-12-27 06:57:18,332 INFO L226 Difference]: Without dead ends: 1193 [2019-12-27 06:57:18,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:57:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-12-27 06:57:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 761. [2019-12-27 06:57:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-12-27 06:57:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1800 transitions. [2019-12-27 06:57:18,349 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1800 transitions. Word has length 55 [2019-12-27 06:57:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:18,351 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1800 transitions. [2019-12-27 06:57:18,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:57:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1800 transitions. [2019-12-27 06:57:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:57:18,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:18,355 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, 1] [2019-12-27 06:57:18,355 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 891728533, now seen corresponding path program 3 times [2019-12-27 06:57:18,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:18,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676564533] [2019-12-27 06:57:18,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:18,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676564533] [2019-12-27 06:57:18,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:18,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:57:18,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822620534] [2019-12-27 06:57:18,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:57:18,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:18,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:57:18,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:18,538 INFO L87 Difference]: Start difference. First operand 761 states and 1800 transitions. Second operand 6 states. [2019-12-27 06:57:18,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:18,895 INFO L93 Difference]: Finished difference Result 1187 states and 2772 transitions. [2019-12-27 06:57:18,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:57:18,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 06:57:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:18,897 INFO L225 Difference]: With dead ends: 1187 [2019-12-27 06:57:18,897 INFO L226 Difference]: Without dead ends: 1187 [2019-12-27 06:57:18,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:57:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-12-27 06:57:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 841. [2019-12-27 06:57:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-27 06:57:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1992 transitions. [2019-12-27 06:57:18,912 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1992 transitions. Word has length 55 [2019-12-27 06:57:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:18,913 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1992 transitions. [2019-12-27 06:57:18,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:57:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1992 transitions. [2019-12-27 06:57:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 06:57:18,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:18,916 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, 1] [2019-12-27 06:57:18,916 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash 882034857, now seen corresponding path program 4 times [2019-12-27 06:57:18,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:18,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358019816] [2019-12-27 06:57:18,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:18,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358019816] [2019-12-27 06:57:18,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:18,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:18,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292502107] [2019-12-27 06:57:18,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:18,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:18,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:18,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:18,973 INFO L87 Difference]: Start difference. First operand 841 states and 1992 transitions. Second operand 3 states. [2019-12-27 06:57:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:18,990 INFO L93 Difference]: Finished difference Result 739 states and 1709 transitions. [2019-12-27 06:57:18,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:18,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 06:57:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:18,992 INFO L225 Difference]: With dead ends: 739 [2019-12-27 06:57:18,992 INFO L226 Difference]: Without dead ends: 739 [2019-12-27 06:57:18,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-12-27 06:57:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-12-27 06:57:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-12-27 06:57:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1709 transitions. [2019-12-27 06:57:19,004 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1709 transitions. Word has length 55 [2019-12-27 06:57:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:19,005 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1709 transitions. [2019-12-27 06:57:19,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1709 transitions. [2019-12-27 06:57:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 06:57:19,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:19,007 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, 1, 1] [2019-12-27 06:57:19,008 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1867905542, now seen corresponding path program 1 times [2019-12-27 06:57:19,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:19,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622944728] [2019-12-27 06:57:19,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:19,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622944728] [2019-12-27 06:57:19,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:19,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:57:19,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518972223] [2019-12-27 06:57:19,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:57:19,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:57:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:19,082 INFO L87 Difference]: Start difference. First operand 739 states and 1709 transitions. Second operand 3 states. [2019-12-27 06:57:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:19,134 INFO L93 Difference]: Finished difference Result 738 states and 1707 transitions. [2019-12-27 06:57:19,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:57:19,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 06:57:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:19,137 INFO L225 Difference]: With dead ends: 738 [2019-12-27 06:57:19,137 INFO L226 Difference]: Without dead ends: 738 [2019-12-27 06:57:19,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:57:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-27 06:57:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 475. [2019-12-27 06:57:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-12-27 06:57:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1096 transitions. [2019-12-27 06:57:19,151 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 1096 transitions. Word has length 56 [2019-12-27 06:57:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:19,151 INFO L462 AbstractCegarLoop]: Abstraction has 475 states and 1096 transitions. [2019-12-27 06:57:19,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:57:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 1096 transitions. [2019-12-27 06:57:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:57:19,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:19,153 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, 1, 1, 1] [2019-12-27 06:57:19,153 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1825683623, now seen corresponding path program 1 times [2019-12-27 06:57:19,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:19,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367712301] [2019-12-27 06:57:19,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:19,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367712301] [2019-12-27 06:57:19,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:19,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:57:19,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138366221] [2019-12-27 06:57:19,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:57:19,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:57:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:57:19,296 INFO L87 Difference]: Start difference. First operand 475 states and 1096 transitions. Second operand 6 states. [2019-12-27 06:57:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:19,373 INFO L93 Difference]: Finished difference Result 783 states and 1701 transitions. [2019-12-27 06:57:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:57:19,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 06:57:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:19,374 INFO L225 Difference]: With dead ends: 783 [2019-12-27 06:57:19,374 INFO L226 Difference]: Without dead ends: 312 [2019-12-27 06:57:19,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:57:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-27 06:57:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 279. [2019-12-27 06:57:19,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-12-27 06:57:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 509 transitions. [2019-12-27 06:57:19,379 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 509 transitions. Word has length 57 [2019-12-27 06:57:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:19,380 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 509 transitions. [2019-12-27 06:57:19,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:57:19,380 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 509 transitions. [2019-12-27 06:57:19,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:57:19,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:19,381 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, 1, 1, 1] [2019-12-27 06:57:19,381 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash 543693155, now seen corresponding path program 2 times [2019-12-27 06:57:19,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:19,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747393601] [2019-12-27 06:57:19,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:19,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747393601] [2019-12-27 06:57:19,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:19,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:57:19,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049501396] [2019-12-27 06:57:19,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:57:19,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:19,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:57:19,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:57:19,806 INFO L87 Difference]: Start difference. First operand 279 states and 509 transitions. Second operand 15 states. [2019-12-27 06:57:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:20,487 INFO L93 Difference]: Finished difference Result 442 states and 779 transitions. [2019-12-27 06:57:20,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:57:20,487 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 06:57:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:20,488 INFO L225 Difference]: With dead ends: 442 [2019-12-27 06:57:20,488 INFO L226 Difference]: Without dead ends: 410 [2019-12-27 06:57:20,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:57:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-12-27 06:57:20,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 329. [2019-12-27 06:57:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 06:57:20,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 588 transitions. [2019-12-27 06:57:20,494 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 588 transitions. Word has length 57 [2019-12-27 06:57:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:20,496 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 588 transitions. [2019-12-27 06:57:20,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:57:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 588 transitions. [2019-12-27 06:57:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:57:20,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:20,498 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, 1, 1, 1] [2019-12-27 06:57:20,499 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -280237799, now seen corresponding path program 3 times [2019-12-27 06:57:20,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:20,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804214057] [2019-12-27 06:57:20,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:20,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804214057] [2019-12-27 06:57:20,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:20,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:57:20,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783720782] [2019-12-27 06:57:20,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:57:20,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:20,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:57:20,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:57:20,784 INFO L87 Difference]: Start difference. First operand 329 states and 588 transitions. Second operand 14 states. [2019-12-27 06:57:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:21,423 INFO L93 Difference]: Finished difference Result 538 states and 950 transitions. [2019-12-27 06:57:21,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:57:21,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 06:57:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:21,425 INFO L225 Difference]: With dead ends: 538 [2019-12-27 06:57:21,425 INFO L226 Difference]: Without dead ends: 506 [2019-12-27 06:57:21,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2019-12-27 06:57:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-12-27 06:57:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 379. [2019-12-27 06:57:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-27 06:57:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 680 transitions. [2019-12-27 06:57:21,432 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 680 transitions. Word has length 57 [2019-12-27 06:57:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:21,432 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 680 transitions. [2019-12-27 06:57:21,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:57:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 680 transitions. [2019-12-27 06:57:21,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:57:21,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:21,434 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, 1, 1, 1] [2019-12-27 06:57:21,434 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:21,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1607584303, now seen corresponding path program 4 times [2019-12-27 06:57:21,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:21,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741158705] [2019-12-27 06:57:21,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:57:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:57:21,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741158705] [2019-12-27 06:57:21,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:57:21,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 06:57:21,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407399345] [2019-12-27 06:57:21,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 06:57:21,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:57:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 06:57:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:57:21,692 INFO L87 Difference]: Start difference. First operand 379 states and 680 transitions. Second operand 14 states. [2019-12-27 06:57:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:57:22,248 INFO L93 Difference]: Finished difference Result 525 states and 925 transitions. [2019-12-27 06:57:22,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:57:22,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 06:57:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:57:22,249 INFO L225 Difference]: With dead ends: 525 [2019-12-27 06:57:22,249 INFO L226 Difference]: Without dead ends: 493 [2019-12-27 06:57:22,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:57:22,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-12-27 06:57:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 387. [2019-12-27 06:57:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-12-27 06:57:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 694 transitions. [2019-12-27 06:57:22,256 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 694 transitions. Word has length 57 [2019-12-27 06:57:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:57:22,256 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 694 transitions. [2019-12-27 06:57:22,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 06:57:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 694 transitions. [2019-12-27 06:57:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 06:57:22,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:57:22,258 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, 1, 1, 1] [2019-12-27 06:57:22,258 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:57:22,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:57:22,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1879148695, now seen corresponding path program 5 times [2019-12-27 06:57:22,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:57:22,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468362993] [2019-12-27 06:57:22,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:57:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:57:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:57:22,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:57:22,353 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:57:22,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_45) (= v_~y~0_25 0) (= v_~y$r_buff0_thd1~0_8 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1492~0.base_27| 4) |v_#length_25|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~weak$$choice2~0_32) (= v_~y$r_buff1_thd1~0_8 0) (= 0 v_~y$flush_delayed~0_13) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd3~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 |v_#NULL.base_6|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_27|) 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_25) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1492~0.base_27|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~y$r_buff1_thd3~0_18) (= v_~z~0_12 0) (= v_~y$mem_tmp~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1492~0.offset_20|) (= v_~x~0_12 0) (= v_~y$r_buff0_thd0~0_76 0) (= 0 v_~y$r_buff1_thd2~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t1492~0.base_27| 1) |v_#valid_64|) (= v_~y$w_buff1_used~0_63 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1492~0.base_27| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1492~0.base_27|) |v_ULTIMATE.start_main_~#t1492~0.offset_20| 0)) |v_#memory_int_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_20|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_18, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_22|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_12, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_15|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_27|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1492~0.offset=|v_ULTIMATE.start_main_~#t1492~0.offset_20|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_~#t1492~0.base=|v_ULTIMATE.start_main_~#t1492~0.base_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1493~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t1494~0.base, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1494~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1493~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1492~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_~#t1492~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:57:22,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L800-1-->L802: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1493~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t1493~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1493~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1493~0.base_13|) |v_ULTIMATE.start_main_~#t1493~0.offset_11| 1)) |v_#memory_int_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1493~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1493~0.offset=|v_ULTIMATE.start_main_~#t1493~0.offset_11|, ULTIMATE.start_main_~#t1493~0.base=|v_ULTIMATE.start_main_~#t1493~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1493~0.offset, ULTIMATE.start_main_~#t1493~0.base] because there is no mapped edge [2019-12-27 06:57:22,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L802-1-->L804: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1494~0.offset_10|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t1494~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1494~0.base_12|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1494~0.base_12| 1) |v_#valid_38|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1494~0.base_12|) |v_ULTIMATE.start_main_~#t1494~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1494~0.offset=|v_ULTIMATE.start_main_~#t1494~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1494~0.base=|v_ULTIMATE.start_main_~#t1494~0.base_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1494~0.offset, ULTIMATE.start_main_~#t1494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-27 06:57:22,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_79) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= (mod v_~y$w_buff1_used~0_51 256) 0) (= v_~y$w_buff1_used~0_51 v_~y$w_buff0_used~0_80) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8) (= v_~y$w_buff0~0_16 v_~y$w_buff1~0_16) (= 2 v_~y$w_buff0~0_15) (= v_P2Thread1of1ForFork0_~arg.offset_4 |v_P2Thread1of1ForFork0_#in~arg.offset_4|) (= v_P2Thread1of1ForFork0_~arg.base_4 |v_P2Thread1of1ForFork0_#in~arg.base_4|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_16, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_4, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_4|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_15, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_4, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_4|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_51} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:57:22,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_9) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~z~0_7) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z~0=v_~z~0_7, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_9, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 06:57:22,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-282746812 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-282746812 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-282746812|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-282746812 |P2Thread1of1ForFork0_#t~ite11_Out-282746812|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-282746812, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-282746812} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-282746812, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-282746812|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-282746812} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:57:22,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-543389275 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-543389275 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-543389275| ~y$w_buff1~0_In-543389275)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite3_Out-543389275| ~y~0_In-543389275)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-543389275, ~y$w_buff1~0=~y$w_buff1~0_In-543389275, ~y~0=~y~0_In-543389275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-543389275} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-543389275, ~y$w_buff1~0=~y$w_buff1~0_In-543389275, ~y~0=~y~0_In-543389275, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-543389275|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-543389275} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:57:22,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork2_#t~ite3_8|) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_8|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_7|, ~y~0=v_~y~0_16, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 06:57:22,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-568970341 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-568970341 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-568970341|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-568970341 |P1Thread1of1ForFork2_#t~ite5_Out-568970341|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-568970341, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-568970341} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-568970341, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-568970341, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-568970341|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:57:22,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1628529186 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1628529186 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1628529186 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1628529186 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1628529186| ~y$w_buff1_used~0_In-1628529186) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite6_Out-1628529186| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1628529186, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628529186, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628529186, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628529186} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1628529186, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1628529186, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1628529186, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1628529186|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1628529186} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:57:22,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1410808844 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1410808844 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1410808844 |P1Thread1of1ForFork2_#t~ite7_Out-1410808844|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite7_Out-1410808844|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410808844, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1410808844} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1410808844, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1410808844, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1410808844|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:57:22,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In395280359 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In395280359 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In395280359 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In395280359 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite12_Out395280359| ~y$w_buff1_used~0_In395280359)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out395280359| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In395280359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In395280359, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In395280359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In395280359} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In395280359, ~y$w_buff0_used~0=~y$w_buff0_used~0_In395280359, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out395280359|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In395280359, ~y$w_buff1_used~0=~y$w_buff1_used~0_In395280359} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:57:22,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1385491016 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1385491016 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1385491016 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1385491016 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1385491016|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite8_Out1385491016| ~y$r_buff1_thd2~0_In1385491016) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1385491016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1385491016, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1385491016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1385491016} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1385491016, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1385491016, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1385491016|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1385491016, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1385491016} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:57:22,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L752-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_12, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:57:22,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-389135945 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-389135945 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out-389135945 ~y$r_buff0_thd3~0_In-389135945) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out-389135945 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-389135945, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-389135945} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-389135945, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-389135945, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-389135945|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:57:22,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1586353990 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1586353990 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In1586353990 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1586353990 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite14_Out1586353990| ~y$r_buff1_thd3~0_In1586353990) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out1586353990| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1586353990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1586353990, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1586353990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586353990} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1586353990|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1586353990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1586353990, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1586353990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1586353990} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:57:22,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite14_8|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_14, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:57:22,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_3|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:57:22,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2005960575 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2005960575 256)))) (or (and (= ~y$w_buff1~0_In2005960575 |ULTIMATE.start_main_#t~ite18_Out2005960575|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out2005960575| ~y~0_In2005960575) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2005960575, ~y~0=~y~0_In2005960575, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2005960575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2005960575} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2005960575, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out2005960575|, ~y~0=~y~0_In2005960575, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2005960575, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2005960575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 06:57:22,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite18_7|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-27 06:57:22,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-464817903 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-464817903 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-464817903| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out-464817903| ~y$w_buff0_used~0_In-464817903) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-464817903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-464817903} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-464817903, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-464817903, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-464817903|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 06:57:22,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-2129231752 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2129231752 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-2129231752 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2129231752 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite21_Out-2129231752|)) (and (= ~y$w_buff1_used~0_In-2129231752 |ULTIMATE.start_main_#t~ite21_Out-2129231752|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129231752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2129231752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2129231752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129231752} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2129231752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2129231752, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-2129231752|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2129231752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2129231752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 06:57:22,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2146885020 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2146885020 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-2146885020 |ULTIMATE.start_main_#t~ite22_Out-2146885020|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite22_Out-2146885020|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146885020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2146885020} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2146885020, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2146885020, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2146885020|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 06:57:22,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1576054206 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1576054206 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1576054206 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1576054206 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out-1576054206| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out-1576054206| ~y$r_buff1_thd0~0_In-1576054206)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1576054206, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1576054206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1576054206, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1576054206} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1576054206, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1576054206, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1576054206, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1576054206|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1576054206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 06:57:22,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1631602162 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In1631602162| |ULTIMATE.start_main_#t~ite29_Out1631602162|) (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out1631602162| ~y$w_buff0~0_In1631602162)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1631602162 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1631602162 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1631602162 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1631602162 256))))) (= |ULTIMATE.start_main_#t~ite30_Out1631602162| |ULTIMATE.start_main_#t~ite29_Out1631602162|) (= ~y$w_buff0~0_In1631602162 |ULTIMATE.start_main_#t~ite29_Out1631602162|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1631602162, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1631602162|, ~y$w_buff0~0=~y$w_buff0~0_In1631602162, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1631602162, ~weak$$choice2~0=~weak$$choice2~0_In1631602162, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1631602162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631602162} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1631602162|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1631602162, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1631602162|, ~y$w_buff0~0=~y$w_buff0~0_In1631602162, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1631602162, ~weak$$choice2~0=~weak$$choice2~0_In1631602162, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1631602162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1631602162} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:57:22,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:57:22,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_23 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_23, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:57:22,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) 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_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:57:22,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:57:22 BasicIcfg [2019-12-27 06:57:22,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:57:22,470 INFO L168 Benchmark]: Toolchain (without parser) took 18640.87 ms. Allocated memory was 137.9 MB in the beginning and 869.8 MB in the end (delta: 731.9 MB). Free memory was 100.5 MB in the beginning and 335.6 MB in the end (delta: -235.1 MB). Peak memory consumption was 496.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,476 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.03 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 157.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.07 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,478 INFO L168 Benchmark]: Boogie Preprocessor took 38.14 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,479 INFO L168 Benchmark]: RCFGBuilder took 878.45 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 104.9 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,480 INFO L168 Benchmark]: TraceAbstraction took 16813.74 ms. Allocated memory was 202.9 MB in the beginning and 869.8 MB in the end (delta: 666.9 MB). Free memory was 104.9 MB in the beginning and 335.6 MB in the end (delta: -230.8 MB). Peak memory consumption was 436.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:57:22,486 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 819.03 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.3 MB in the beginning and 157.1 MB in the end (delta: -56.8 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.07 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.14 ms. Allocated memory is still 202.9 MB. Free memory was 153.8 MB in the beginning and 151.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 878.45 ms. Allocated memory is still 202.9 MB. Free memory was 151.1 MB in the beginning and 104.9 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16813.74 ms. Allocated memory was 202.9 MB in the beginning and 869.8 MB in the end (delta: 666.9 MB). Free memory was 104.9 MB in the beginning and 335.6 MB in the end (delta: -230.8 MB). Peak memory consumption was 436.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 162 ProgramPointsBefore, 86 ProgramPointsAfterwards, 193 TransitionsBefore, 97 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 24 ChoiceCompositions, 3760 VarBasedMoverChecksPositive, 156 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 51676 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1559 SDtfs, 1654 SDslu, 4259 SDs, 0 SdLazy, 2347 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25418occurred 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: 3.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 4257 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 121419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...