/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:08:29,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:08:29,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:08:29,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:08:29,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:08:29,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:08:29,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:08:29,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:08:29,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:08:29,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:08:29,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:08:29,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:08:29,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:08:29,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:08:29,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:08:29,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:08:29,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:08:29,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:08:29,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:08:29,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:08:29,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:08:29,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:08:29,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:08:29,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:08:29,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:08:29,570 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:08:29,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:08:29,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:08:29,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:08:29,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:08:29,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:08:29,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:08:29,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:08:29,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:08:29,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:08:29,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:08:29,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:08:29,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:08:29,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:08:29,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:08:29,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:08:29,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:08:29,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:08:29,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:08:29,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:08:29,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:08:29,599 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:08:29,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:08:29,599 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:08:29,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:08:29,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:08:29,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:08:29,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:08:29,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:08:29,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:08:29,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:08:29,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:08:29,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:08:29,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:08:29,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:08:29,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:08:29,601 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:08:29,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:08:29,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:08:29,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:08:29,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:08:29,602 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:08:29,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:08:29,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:08:29,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:08:29,603 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:08:29,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:08:29,880 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:08:29,900 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:08:29,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:08:29,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:08:29,905 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:08:29,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-18 15:08:29,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0a6dcd6/612d5420543f42baa02e11ed6f4fb05c/FLAG10d0ce760 [2019-12-18 15:08:30,510 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:08:30,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-18 15:08:30,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0a6dcd6/612d5420543f42baa02e11ed6f4fb05c/FLAG10d0ce760 [2019-12-18 15:08:30,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae0a6dcd6/612d5420543f42baa02e11ed6f4fb05c [2019-12-18 15:08:30,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:08:30,836 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:08:30,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:30,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:08:30,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:08:30,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:30" (1/1) ... [2019-12-18 15:08:30,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c4e2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:30, skipping insertion in model container [2019-12-18 15:08:30,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:08:30" (1/1) ... [2019-12-18 15:08:30,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:08:30,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:08:31,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:31,517 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:08:31,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:08:31,681 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:08:31,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31 WrapperNode [2019-12-18 15:08:31,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:08:31,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:31,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:08:31,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:08:31,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:08:31,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:08:31,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:08:31,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:08:31,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... [2019-12-18 15:08:31,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:08:31,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:08:31,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:08:31,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:08:31,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:08:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:08:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:08:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:08:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:08:31,857 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:08:31,857 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:08:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:08:31,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:08:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:08:31,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:08:31,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:08:31,861 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:08:32,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:08:32,629 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:08:32,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:32 BoogieIcfgContainer [2019-12-18 15:08:32,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:08:32,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:08:32,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:08:32,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:08:32,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:08:30" (1/3) ... [2019-12-18 15:08:32,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1221408c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:32, skipping insertion in model container [2019-12-18 15:08:32,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:08:31" (2/3) ... [2019-12-18 15:08:32,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1221408c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:08:32, skipping insertion in model container [2019-12-18 15:08:32,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:08:32" (3/3) ... [2019-12-18 15:08:32,640 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2019-12-18 15:08:32,650 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:08:32,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:08:32,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:08:32,660 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:08:32,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,695 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,704 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,705 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,725 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:08:32,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 15:08:32,764 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:08:32,764 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:08:32,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:08:32,765 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:08:32,765 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:08:32,765 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:08:32,765 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:08:32,766 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:08:32,782 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 15:08:32,785 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:32,875 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:32,876 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:32,890 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:32,907 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 15:08:32,944 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 15:08:32,944 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:08:32,951 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 253 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 15:08:32,968 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-18 15:08:32,969 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:08:37,180 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 15:08:37,307 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47380 [2019-12-18 15:08:37,307 INFO L214 etLargeBlockEncoding]: Total number of compositions: 96 [2019-12-18 15:08:37,311 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-18 15:08:37,787 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8608 states. [2019-12-18 15:08:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8608 states. [2019-12-18 15:08:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 15:08:37,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:37,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 15:08:37,798 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:37,805 INFO L82 PathProgramCache]: Analyzing trace with hash 689103523, now seen corresponding path program 1 times [2019-12-18 15:08:37,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:37,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39873015] [2019-12-18 15:08:37,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:38,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39873015] [2019-12-18 15:08:38,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:38,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:08:38,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963123647] [2019-12-18 15:08:38,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:38,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:38,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:38,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:38,036 INFO L87 Difference]: Start difference. First operand 8608 states. Second operand 3 states. [2019-12-18 15:08:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:38,323 INFO L93 Difference]: Finished difference Result 8560 states and 27962 transitions. [2019-12-18 15:08:38,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:38,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 15:08:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:38,423 INFO L225 Difference]: With dead ends: 8560 [2019-12-18 15:08:38,423 INFO L226 Difference]: Without dead ends: 8391 [2019-12-18 15:08:38,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2019-12-18 15:08:38,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 8391. [2019-12-18 15:08:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8391 states. [2019-12-18 15:08:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8391 states to 8391 states and 27442 transitions. [2019-12-18 15:08:39,031 INFO L78 Accepts]: Start accepts. Automaton has 8391 states and 27442 transitions. Word has length 5 [2019-12-18 15:08:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:39,032 INFO L462 AbstractCegarLoop]: Abstraction has 8391 states and 27442 transitions. [2019-12-18 15:08:39,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:39,032 INFO L276 IsEmpty]: Start isEmpty. Operand 8391 states and 27442 transitions. [2019-12-18 15:08:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:39,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:39,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:39,037 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1296433146, now seen corresponding path program 1 times [2019-12-18 15:08:39,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:39,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955810410] [2019-12-18 15:08:39,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:39,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955810410] [2019-12-18 15:08:39,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:39,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:39,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107503089] [2019-12-18 15:08:39,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:39,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:39,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:39,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:39,197 INFO L87 Difference]: Start difference. First operand 8391 states and 27442 transitions. Second operand 4 states. [2019-12-18 15:08:39,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:39,580 INFO L93 Difference]: Finished difference Result 13399 states and 41962 transitions. [2019-12-18 15:08:39,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:39,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:39,670 INFO L225 Difference]: With dead ends: 13399 [2019-12-18 15:08:39,671 INFO L226 Difference]: Without dead ends: 13392 [2019-12-18 15:08:39,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2019-12-18 15:08:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 11787. [2019-12-18 15:08:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11787 states. [2019-12-18 15:08:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11787 states to 11787 states and 37494 transitions. [2019-12-18 15:08:40,733 INFO L78 Accepts]: Start accepts. Automaton has 11787 states and 37494 transitions. Word has length 11 [2019-12-18 15:08:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:40,733 INFO L462 AbstractCegarLoop]: Abstraction has 11787 states and 37494 transitions. [2019-12-18 15:08:40,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:40,733 INFO L276 IsEmpty]: Start isEmpty. Operand 11787 states and 37494 transitions. [2019-12-18 15:08:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:08:40,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:40,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:40,745 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 825675890, now seen corresponding path program 1 times [2019-12-18 15:08:40,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:40,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086961919] [2019-12-18 15:08:40,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:40,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086961919] [2019-12-18 15:08:40,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:40,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:40,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048554743] [2019-12-18 15:08:40,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:40,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:40,879 INFO L87 Difference]: Start difference. First operand 11787 states and 37494 transitions. Second operand 4 states. [2019-12-18 15:08:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:41,220 INFO L93 Difference]: Finished difference Result 14846 states and 46774 transitions. [2019-12-18 15:08:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:41,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 15:08:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:41,280 INFO L225 Difference]: With dead ends: 14846 [2019-12-18 15:08:41,280 INFO L226 Difference]: Without dead ends: 14846 [2019-12-18 15:08:41,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14846 states. [2019-12-18 15:08:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14846 to 13070. [2019-12-18 15:08:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13070 states. [2019-12-18 15:08:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13070 states to 13070 states and 41519 transitions. [2019-12-18 15:08:41,959 INFO L78 Accepts]: Start accepts. Automaton has 13070 states and 41519 transitions. Word has length 11 [2019-12-18 15:08:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:41,959 INFO L462 AbstractCegarLoop]: Abstraction has 13070 states and 41519 transitions. [2019-12-18 15:08:41,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:41,959 INFO L276 IsEmpty]: Start isEmpty. Operand 13070 states and 41519 transitions. [2019-12-18 15:08:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:08:41,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:41,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:41,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:41,966 INFO L82 PathProgramCache]: Analyzing trace with hash 727521173, now seen corresponding path program 1 times [2019-12-18 15:08:41,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:41,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45892356] [2019-12-18 15:08:41,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:42,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45892356] [2019-12-18 15:08:42,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:42,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:42,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368685435] [2019-12-18 15:08:42,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:42,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:42,087 INFO L87 Difference]: Start difference. First operand 13070 states and 41519 transitions. Second operand 5 states. [2019-12-18 15:08:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:42,579 INFO L93 Difference]: Finished difference Result 17840 states and 55421 transitions. [2019-12-18 15:08:42,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:08:42,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 15:08:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:42,654 INFO L225 Difference]: With dead ends: 17840 [2019-12-18 15:08:42,655 INFO L226 Difference]: Without dead ends: 17833 [2019-12-18 15:08:42,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2019-12-18 15:08:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 13112. [2019-12-18 15:08:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13112 states. [2019-12-18 15:08:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13112 states to 13112 states and 41511 transitions. [2019-12-18 15:08:43,396 INFO L78 Accepts]: Start accepts. Automaton has 13112 states and 41511 transitions. Word has length 17 [2019-12-18 15:08:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:43,397 INFO L462 AbstractCegarLoop]: Abstraction has 13112 states and 41511 transitions. [2019-12-18 15:08:43,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 13112 states and 41511 transitions. [2019-12-18 15:08:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:08:43,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:43,415 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:43,415 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:43,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:43,417 INFO L82 PathProgramCache]: Analyzing trace with hash -569311522, now seen corresponding path program 1 times [2019-12-18 15:08:43,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:43,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102367685] [2019-12-18 15:08:43,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:43,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102367685] [2019-12-18 15:08:43,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:43,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:43,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604914056] [2019-12-18 15:08:43,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:43,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:43,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:43,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:43,513 INFO L87 Difference]: Start difference. First operand 13112 states and 41511 transitions. Second operand 3 states. [2019-12-18 15:08:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:43,666 INFO L93 Difference]: Finished difference Result 15933 states and 49812 transitions. [2019-12-18 15:08:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:43,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 15:08:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:43,742 INFO L225 Difference]: With dead ends: 15933 [2019-12-18 15:08:43,743 INFO L226 Difference]: Without dead ends: 15933 [2019-12-18 15:08:43,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15933 states. [2019-12-18 15:08:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15933 to 14126. [2019-12-18 15:08:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14126 states. [2019-12-18 15:08:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14126 states to 14126 states and 44593 transitions. [2019-12-18 15:08:45,008 INFO L78 Accepts]: Start accepts. Automaton has 14126 states and 44593 transitions. Word has length 25 [2019-12-18 15:08:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:45,009 INFO L462 AbstractCegarLoop]: Abstraction has 14126 states and 44593 transitions. [2019-12-18 15:08:45,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 14126 states and 44593 transitions. [2019-12-18 15:08:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:08:45,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:45,023 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:45,023 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:45,024 INFO L82 PathProgramCache]: Analyzing trace with hash -569496623, now seen corresponding path program 1 times [2019-12-18 15:08:45,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:45,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224207236] [2019-12-18 15:08:45,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:45,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224207236] [2019-12-18 15:08:45,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:45,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:08:45,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831091271] [2019-12-18 15:08:45,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:08:45,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:45,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:08:45,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:08:45,120 INFO L87 Difference]: Start difference. First operand 14126 states and 44593 transitions. Second operand 4 states. [2019-12-18 15:08:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:45,155 INFO L93 Difference]: Finished difference Result 2310 states and 5267 transitions. [2019-12-18 15:08:45,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:08:45,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 15:08:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:45,160 INFO L225 Difference]: With dead ends: 2310 [2019-12-18 15:08:45,160 INFO L226 Difference]: Without dead ends: 2024 [2019-12-18 15:08:45,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2019-12-18 15:08:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 2024. [2019-12-18 15:08:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2024 states. [2019-12-18 15:08:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 4476 transitions. [2019-12-18 15:08:45,196 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 4476 transitions. Word has length 25 [2019-12-18 15:08:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:45,197 INFO L462 AbstractCegarLoop]: Abstraction has 2024 states and 4476 transitions. [2019-12-18 15:08:45,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:08:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 4476 transitions. [2019-12-18 15:08:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 15:08:45,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:45,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:45,201 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash 355873678, now seen corresponding path program 1 times [2019-12-18 15:08:45,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:45,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587618251] [2019-12-18 15:08:45,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:45,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587618251] [2019-12-18 15:08:45,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:45,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:45,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942281327] [2019-12-18 15:08:45,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:45,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:45,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:45,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:45,288 INFO L87 Difference]: Start difference. First operand 2024 states and 4476 transitions. Second operand 5 states. [2019-12-18 15:08:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:45,330 INFO L93 Difference]: Finished difference Result 426 states and 776 transitions. [2019-12-18 15:08:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:08:45,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 15:08:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:45,332 INFO L225 Difference]: With dead ends: 426 [2019-12-18 15:08:45,332 INFO L226 Difference]: Without dead ends: 380 [2019-12-18 15:08:45,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:08:45,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-18 15:08:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 345. [2019-12-18 15:08:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 15:08:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 621 transitions. [2019-12-18 15:08:45,339 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 621 transitions. Word has length 37 [2019-12-18 15:08:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:45,340 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 621 transitions. [2019-12-18 15:08:45,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 621 transitions. [2019-12-18 15:08:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:08:45,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:45,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:45,342 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:45,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1678296005, now seen corresponding path program 1 times [2019-12-18 15:08:45,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:45,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936264055] [2019-12-18 15:08:45,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:45,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936264055] [2019-12-18 15:08:45,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:45,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:45,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453472169] [2019-12-18 15:08:45,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:45,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:45,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:45,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:45,436 INFO L87 Difference]: Start difference. First operand 345 states and 621 transitions. Second operand 5 states. [2019-12-18 15:08:45,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:45,642 INFO L93 Difference]: Finished difference Result 476 states and 857 transitions. [2019-12-18 15:08:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:45,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 15:08:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:45,644 INFO L225 Difference]: With dead ends: 476 [2019-12-18 15:08:45,644 INFO L226 Difference]: Without dead ends: 476 [2019-12-18 15:08:45,645 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-18 15:08:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-18 15:08:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 435. [2019-12-18 15:08:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-18 15:08:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 785 transitions. [2019-12-18 15:08:45,653 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 785 transitions. Word has length 52 [2019-12-18 15:08:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:45,655 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 785 transitions. [2019-12-18 15:08:45,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 785 transitions. [2019-12-18 15:08:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:08:45,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:45,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:45,657 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash -856791897, now seen corresponding path program 2 times [2019-12-18 15:08:45,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:45,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686050217] [2019-12-18 15:08:45,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:45,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686050217] [2019-12-18 15:08:45,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:45,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:08:45,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070319638] [2019-12-18 15:08:45,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:45,778 INFO L87 Difference]: Start difference. First operand 435 states and 785 transitions. Second operand 6 states. [2019-12-18 15:08:46,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,115 INFO L93 Difference]: Finished difference Result 661 states and 1197 transitions. [2019-12-18 15:08:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:08:46,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 15:08:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,118 INFO L225 Difference]: With dead ends: 661 [2019-12-18 15:08:46,118 INFO L226 Difference]: Without dead ends: 661 [2019-12-18 15:08:46,119 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-18 15:08:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2019-12-18 15:08:46,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 480. [2019-12-18 15:08:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-18 15:08:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 875 transitions. [2019-12-18 15:08:46,130 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 875 transitions. Word has length 52 [2019-12-18 15:08:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,131 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 875 transitions. [2019-12-18 15:08:46,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 875 transitions. [2019-12-18 15:08:46,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 15:08:46,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:46,135 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1692114105, now seen corresponding path program 3 times [2019-12-18 15:08:46,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982778978] [2019-12-18 15:08:46,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:46,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982778978] [2019-12-18 15:08:46,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:46,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508634857] [2019-12-18 15:08:46,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:46,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:46,231 INFO L87 Difference]: Start difference. First operand 480 states and 875 transitions. Second operand 3 states. [2019-12-18 15:08:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,243 INFO L93 Difference]: Finished difference Result 435 states and 770 transitions. [2019-12-18 15:08:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:46,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 15:08:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,245 INFO L225 Difference]: With dead ends: 435 [2019-12-18 15:08:46,245 INFO L226 Difference]: Without dead ends: 435 [2019-12-18 15:08:46,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-12-18 15:08:46,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 423. [2019-12-18 15:08:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-18 15:08:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 748 transitions. [2019-12-18 15:08:46,252 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 748 transitions. Word has length 52 [2019-12-18 15:08:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,253 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 748 transitions. [2019-12-18 15:08:46,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 748 transitions. [2019-12-18 15:08:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:08:46,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:46,255 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash -798948617, now seen corresponding path program 1 times [2019-12-18 15:08:46,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062170920] [2019-12-18 15:08:46,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:46,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062170920] [2019-12-18 15:08:46,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:08:46,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896673261] [2019-12-18 15:08:46,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:08:46,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:08:46,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:08:46,350 INFO L87 Difference]: Start difference. First operand 423 states and 748 transitions. Second operand 5 states. [2019-12-18 15:08:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:46,477 INFO L93 Difference]: Finished difference Result 519 states and 916 transitions. [2019-12-18 15:08:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:46,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-18 15:08:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:46,478 INFO L225 Difference]: With dead ends: 519 [2019-12-18 15:08:46,480 INFO L226 Difference]: Without dead ends: 519 [2019-12-18 15:08:46,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:08:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-12-18 15:08:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 437. [2019-12-18 15:08:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-18 15:08:46,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 774 transitions. [2019-12-18 15:08:46,488 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 774 transitions. Word has length 53 [2019-12-18 15:08:46,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:46,488 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 774 transitions. [2019-12-18 15:08:46,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:08:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 774 transitions. [2019-12-18 15:08:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:08:46,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:46,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:46,490 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:46,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:46,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1548250017, now seen corresponding path program 2 times [2019-12-18 15:08:46,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:46,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769780246] [2019-12-18 15:08:46,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:46,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:46,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769780246] [2019-12-18 15:08:46,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:46,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 15:08:46,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909174400] [2019-12-18 15:08:46,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:08:46,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:08:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:08:46,812 INFO L87 Difference]: Start difference. First operand 437 states and 774 transitions. Second operand 9 states. [2019-12-18 15:08:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:47,402 INFO L93 Difference]: Finished difference Result 711 states and 1240 transitions. [2019-12-18 15:08:47,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:08:47,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-18 15:08:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:47,408 INFO L225 Difference]: With dead ends: 711 [2019-12-18 15:08:47,409 INFO L226 Difference]: Without dead ends: 711 [2019-12-18 15:08:47,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:08:47,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-12-18 15:08:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 433. [2019-12-18 15:08:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-12-18 15:08:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 763 transitions. [2019-12-18 15:08:47,416 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 763 transitions. Word has length 53 [2019-12-18 15:08:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:47,417 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 763 transitions. [2019-12-18 15:08:47,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:08:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 763 transitions. [2019-12-18 15:08:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 15:08:47,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:47,418 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:47,419 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:47,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1975941905, now seen corresponding path program 3 times [2019-12-18 15:08:47,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:47,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350308380] [2019-12-18 15:08:47,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:47,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350308380] [2019-12-18 15:08:47,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:47,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:08:47,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066153805] [2019-12-18 15:08:47,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:08:47,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:08:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:47,528 INFO L87 Difference]: Start difference. First operand 433 states and 763 transitions. Second operand 3 states. [2019-12-18 15:08:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:47,567 INFO L93 Difference]: Finished difference Result 432 states and 761 transitions. [2019-12-18 15:08:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:08:47,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 15:08:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:47,569 INFO L225 Difference]: With dead ends: 432 [2019-12-18 15:08:47,570 INFO L226 Difference]: Without dead ends: 432 [2019-12-18 15:08:47,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:08:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-18 15:08:47,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 344. [2019-12-18 15:08:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-18 15:08:47,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 597 transitions. [2019-12-18 15:08:47,577 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 597 transitions. Word has length 53 [2019-12-18 15:08:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:47,577 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 597 transitions. [2019-12-18 15:08:47,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:08:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 597 transitions. [2019-12-18 15:08:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:47,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:47,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:47,579 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1826767497, now seen corresponding path program 1 times [2019-12-18 15:08:47,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:47,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886507745] [2019-12-18 15:08:47,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:47,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886507745] [2019-12-18 15:08:47,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:47,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:08:47,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127575505] [2019-12-18 15:08:47,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:08:47,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:47,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:08:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:08:47,737 INFO L87 Difference]: Start difference. First operand 344 states and 597 transitions. Second operand 6 states. [2019-12-18 15:08:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:47,797 INFO L93 Difference]: Finished difference Result 548 states and 951 transitions. [2019-12-18 15:08:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:08:47,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-18 15:08:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:47,799 INFO L225 Difference]: With dead ends: 548 [2019-12-18 15:08:47,799 INFO L226 Difference]: Without dead ends: 221 [2019-12-18 15:08:47,799 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-18 15:08:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-18 15:08:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2019-12-18 15:08:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-18 15:08:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 335 transitions. [2019-12-18 15:08:47,803 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 335 transitions. Word has length 54 [2019-12-18 15:08:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:47,803 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 335 transitions. [2019-12-18 15:08:47,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:08:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 335 transitions. [2019-12-18 15:08:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:47,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:47,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:47,805 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 584180705, now seen corresponding path program 2 times [2019-12-18 15:08:47,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:47,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915258309] [2019-12-18 15:08:47,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:48,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915258309] [2019-12-18 15:08:48,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:48,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 15:08:48,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092364272] [2019-12-18 15:08:48,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:08:48,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:48,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:08:48,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:08:48,141 INFO L87 Difference]: Start difference. First operand 197 states and 335 transitions. Second operand 17 states. [2019-12-18 15:08:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:49,379 INFO L93 Difference]: Finished difference Result 487 states and 826 transitions. [2019-12-18 15:08:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 15:08:49,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2019-12-18 15:08:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:49,381 INFO L225 Difference]: With dead ends: 487 [2019-12-18 15:08:49,381 INFO L226 Difference]: Without dead ends: 455 [2019-12-18 15:08:49,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:08:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-12-18 15:08:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 307. [2019-12-18 15:08:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 15:08:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 525 transitions. [2019-12-18 15:08:49,389 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 525 transitions. Word has length 54 [2019-12-18 15:08:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:49,389 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 525 transitions. [2019-12-18 15:08:49,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:08:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 525 transitions. [2019-12-18 15:08:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:49,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:49,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:49,390 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:49,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:49,391 INFO L82 PathProgramCache]: Analyzing trace with hash -129579657, now seen corresponding path program 3 times [2019-12-18 15:08:49,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:49,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946250528] [2019-12-18 15:08:49,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:08:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:08:49,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946250528] [2019-12-18 15:08:49,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:08:49,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:08:49,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106695218] [2019-12-18 15:08:49,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:08:49,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:08:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:08:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:08:49,824 INFO L87 Difference]: Start difference. First operand 307 states and 525 transitions. Second operand 14 states. [2019-12-18 15:08:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:08:50,256 INFO L93 Difference]: Finished difference Result 429 states and 716 transitions. [2019-12-18 15:08:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:08:50,257 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2019-12-18 15:08:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:08:50,258 INFO L225 Difference]: With dead ends: 429 [2019-12-18 15:08:50,258 INFO L226 Difference]: Without dead ends: 397 [2019-12-18 15:08:50,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:08:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-18 15:08:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 305. [2019-12-18 15:08:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-18 15:08:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 520 transitions. [2019-12-18 15:08:50,264 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 520 transitions. Word has length 54 [2019-12-18 15:08:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:08:50,264 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 520 transitions. [2019-12-18 15:08:50,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:08:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 520 transitions. [2019-12-18 15:08:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 15:08:50,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:08:50,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:08:50,266 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:08:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:08:50,266 INFO L82 PathProgramCache]: Analyzing trace with hash -695821945, now seen corresponding path program 4 times [2019-12-18 15:08:50,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:08:50,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997203528] [2019-12-18 15:08:50,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:08:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:08:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:08:50,359 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:08:50,359 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:08:50,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~x$w_buff1_used~0_344) (= v_~x$r_buff0_thd0~0_298 0) (= v_~x$r_buff0_thd1~0_128 0) (= 0 v_~weak$$choice0~0_26) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2475~0.base_19|)) (= 0 |v_ULTIMATE.start_main_~#t2475~0.offset_16|) (= v_~x$r_buff1_thd2~0_87 0) (= v_~x$flush_delayed~0_47 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff1~0_200) (= v_~x$r_buff1_thd0~0_184 0) (= v_~y~0_77 0) (= 0 v_~x$w_buff0_used~0_631) (= v_~x$mem_tmp~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~main$tmp_guard1~0_19 0) (= |v_#NULL.offset_5| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2475~0.base_19| 4)) (= 0 v_~x$r_buff0_thd2~0_137) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2475~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2475~0.base_19|) |v_ULTIMATE.start_main_~#t2475~0.offset_16| 0)) |v_#memory_int_17|) (= 0 v_~x~0_143) (= v_~weak$$choice2~0_101 0) (= v_~x$r_buff1_thd1~0_135 0) (= 0 v_~__unbuffered_cnt~0_59) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2475~0.base_19|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2475~0.base_19| 1) |v_#valid_40|) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0~0_255) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_255, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~x$flush_delayed~0=v_~x$flush_delayed~0_47, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_31|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_57|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2476~0.base=|v_ULTIMATE.start_main_~#t2476~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_298, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_25|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_45|, ~x$w_buff1~0=v_~x$w_buff1~0_200, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_25|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_344, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_87, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_38|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_25|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~x~0=v_~x~0_143, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_128, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_23|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_38|, ~x$mem_tmp~0=v_~x$mem_tmp~0_31, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_40|, ULTIMATE.start_main_~#t2475~0.offset=|v_ULTIMATE.start_main_~#t2475~0.offset_16|, ~y~0=v_~y~0_77, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_45|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_25|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_29|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_184, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_631, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_25|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2476~0.offset=|v_ULTIMATE.start_main_~#t2476~0.offset_16|, ULTIMATE.start_main_~#t2475~0.base=|v_ULTIMATE.start_main_~#t2475~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~weak$$choice2~0=v_~weak$$choice2~0_101, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, #length, ULTIMATE.start_main_~#t2476~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t2475~0.offset, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2476~0.offset, ULTIMATE.start_main_~#t2475~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 15:08:50,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L777-1-->L779: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2476~0.base_10| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2476~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2476~0.base_10|) |v_ULTIMATE.start_main_~#t2476~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2476~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2476~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2476~0.offset_9|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2476~0.base_10| 4)) (= (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2476~0.base_10|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t2476~0.offset=|v_ULTIMATE.start_main_~#t2476~0.offset_9|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2476~0.base=|v_ULTIMATE.start_main_~#t2476~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2476~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2476~0.base] because there is no mapped edge [2019-12-18 15:08:50,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P1ENTRY-->L4-3: Formula: (and (= |P1Thread1of1ForFork1_#in~arg.base_In1649949276| P1Thread1of1ForFork1_~arg.base_Out1649949276) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1649949276 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1649949276|) (= ~x$w_buff1~0_Out1649949276 ~x$w_buff0~0_In1649949276) (= 0 (mod ~x$w_buff1_used~0_Out1649949276 256)) (= P1Thread1of1ForFork1_~arg.offset_Out1649949276 |P1Thread1of1ForFork1_#in~arg.offset_In1649949276|) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1649949276|) (= ~x$w_buff0_used~0_In1649949276 ~x$w_buff1_used~0_Out1649949276) (= ~x$w_buff0_used~0_Out1649949276 1) (= 2 ~x$w_buff0~0_Out1649949276)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1649949276, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1649949276|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1649949276|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1649949276} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1649949276, ~x$w_buff0~0=~x$w_buff0~0_Out1649949276, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out1649949276, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1649949276|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out1649949276, ~x$w_buff1~0=~x$w_buff1~0_Out1649949276, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1649949276|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1649949276|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1649949276, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1649949276} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 15:08:50,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L726-2-->L726-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In-2133184465 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-2133184465| |P0Thread1of1ForFork0_#t~ite3_Out-2133184465|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2133184465 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P0Thread1of1ForFork0_#t~ite3_Out-2133184465| ~x~0_In-2133184465)) (and (not .cse0) .cse2 (= ~x$w_buff1~0_In-2133184465 |P0Thread1of1ForFork0_#t~ite3_Out-2133184465|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2133184465, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2133184465, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2133184465, ~x~0=~x~0_In-2133184465} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-2133184465|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-2133184465|, ~x$w_buff1~0=~x$w_buff1~0_In-2133184465, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2133184465, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2133184465, ~x~0=~x~0_In-2133184465} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 15:08:50,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1670270177 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1670270177 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1670270177| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1670270177| ~x$w_buff0_used~0_In-1670270177)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1670270177, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670270177} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1670270177|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1670270177, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1670270177} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 15:08:50,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L727-->L727-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1022205045 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1022205045 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1022205045 |P0Thread1of1ForFork0_#t~ite5_Out-1022205045|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1022205045| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1022205045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1022205045} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1022205045|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1022205045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1022205045} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 15:08:50,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L728-->L728-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1920645893 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In1920645893 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1920645893 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1920645893 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1920645893|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1920645893 |P0Thread1of1ForFork0_#t~ite6_Out1920645893|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1920645893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1920645893, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1920645893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1920645893} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1920645893|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1920645893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1920645893, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1920645893, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1920645893} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 15:08:50,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L729-->L729-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In296396761 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In296396761 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out296396761|) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In296396761 |P0Thread1of1ForFork0_#t~ite7_Out296396761|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In296396761, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296396761} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In296396761, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out296396761|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In296396761} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 15:08:50,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1410325535 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1410325535 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1410325535 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1410325535 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1410325535| ~x$r_buff1_thd1~0_In-1410325535)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1410325535|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1410325535, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1410325535, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1410325535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1410325535} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1410325535, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1410325535|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1410325535, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1410325535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1410325535} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 15:08:50,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L730-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_79 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_79} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 15:08:50,370 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In851240588 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In851240588 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In851240588 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In851240588 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out851240588| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In851240588 |P1Thread1of1ForFork1_#t~ite12_Out851240588|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In851240588, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In851240588, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In851240588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In851240588} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In851240588, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In851240588, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out851240588|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In851240588, ~x$w_buff0_used~0=~x$w_buff0_used~0_In851240588} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 15:08:50,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1202798925 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1202798925 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1202798925 ~x$r_buff0_thd2~0_Out1202798925)) (and (= 0 ~x$r_buff0_thd2~0_Out1202798925) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1202798925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202798925} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1202798925|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1202798925, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202798925} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 15:08:50,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In404502168 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In404502168 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In404502168 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In404502168 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out404502168| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite14_Out404502168| ~x$r_buff1_thd2~0_In404502168)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In404502168, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In404502168, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In404502168, ~x$w_buff0_used~0=~x$w_buff0_used~0_In404502168} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In404502168, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In404502168, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In404502168, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out404502168|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In404502168} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:08:50,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= v_~x$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 15:08:50,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [585] [585] L783-->L785-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_91 256) 0) (= (mod v_~x$r_buff0_thd0~0_49 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:08:50,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L785-2-->L785-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1923947953 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1923947953 256) 0))) (or (and (= ~x~0_In1923947953 |ULTIMATE.start_main_#t~ite17_Out1923947953|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite17_Out1923947953| ~x$w_buff1~0_In1923947953) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1923947953, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1923947953, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1923947953, ~x~0=~x~0_In1923947953} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1923947953|, ~x$w_buff1~0=~x$w_buff1~0_In1923947953, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1923947953, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1923947953, ~x~0=~x~0_In1923947953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 15:08:50,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L785-4-->L786: Formula: (= v_~x~0_39 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-18 15:08:50,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In283460891 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In283460891 256) 0))) (or (and (= ~x$w_buff0_used~0_In283460891 |ULTIMATE.start_main_#t~ite19_Out283460891|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite19_Out283460891|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In283460891, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283460891} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In283460891, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out283460891|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283460891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 15:08:50,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In41214332 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In41214332 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In41214332 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In41214332 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite20_Out41214332| ~x$w_buff1_used~0_In41214332) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite20_Out41214332| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In41214332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In41214332, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In41214332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41214332} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In41214332, ~x$w_buff1_used~0=~x$w_buff1_used~0_In41214332, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out41214332|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In41214332, ~x$w_buff0_used~0=~x$w_buff0_used~0_In41214332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 15:08:50,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1784992917 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1784992917 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-1784992917|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1784992917 |ULTIMATE.start_main_#t~ite21_Out-1784992917|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1784992917, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784992917} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1784992917, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1784992917|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784992917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 15:08:50,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L789-->L789-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In700654348 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In700654348 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In700654348 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In700654348 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out700654348| ~x$r_buff1_thd0~0_In700654348) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out700654348|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In700654348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In700654348, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In700654348, ~x$w_buff0_used~0=~x$w_buff0_used~0_In700654348} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In700654348, ~x$w_buff1_used~0=~x$w_buff1_used~0_In700654348, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In700654348, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out700654348|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In700654348} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 15:08:50,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L800-->L800-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1005965093 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1005965093| |ULTIMATE.start_main_#t~ite37_Out-1005965093|) (= |ULTIMATE.start_main_#t~ite37_Out-1005965093| ~x$w_buff1_used~0_In-1005965093) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1005965093 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1005965093 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1005965093 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1005965093 256))))) .cse1) (and (= |ULTIMATE.start_main_#t~ite38_Out-1005965093| ~x$w_buff1_used~0_In-1005965093) (not .cse1) (= |ULTIMATE.start_main_#t~ite37_In-1005965093| |ULTIMATE.start_main_#t~ite37_Out-1005965093|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1005965093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1005965093, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In-1005965093|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1005965093, ~weak$$choice2~0=~weak$$choice2~0_In-1005965093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005965093} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1005965093, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1005965093, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1005965093|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1005965093|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1005965093, ~weak$$choice2~0=~weak$$choice2~0_In-1005965093, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005965093} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 15:08:50,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [590] [590] L801-->L802: Formula: (and (= v_~x$r_buff0_thd0~0_57 v_~x$r_buff0_thd0~0_56) (not (= (mod v_~weak$$choice2~0_21 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_56, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 15:08:50,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= v_~x~0_75 v_~x$mem_tmp~0_14) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_14, ~x~0=v_~x~0_75, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:08:50,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 15:08:50,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:08:50 BasicIcfg [2019-12-18 15:08:50,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:08:50,449 INFO L168 Benchmark]: Toolchain (without parser) took 19613.09 ms. Allocated memory was 138.9 MB in the beginning and 808.5 MB in the end (delta: 669.5 MB). Free memory was 102.2 MB in the beginning and 533.7 MB in the end (delta: -431.5 MB). Peak memory consumption was 238.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:50,449 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:08:50,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.53 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.8 MB in the beginning and 158.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:50,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 204.5 MB. Free memory was 158.8 MB in the beginning and 155.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:50,452 INFO L168 Benchmark]: Boogie Preprocessor took 36.19 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 154.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:50,452 INFO L168 Benchmark]: RCFGBuilder took 849.44 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 109.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:50,455 INFO L168 Benchmark]: TraceAbstraction took 17812.87 ms. Allocated memory was 204.5 MB in the beginning and 808.5 MB in the end (delta: 604.0 MB). Free memory was 109.4 MB in the beginning and 533.7 MB in the end (delta: -424.2 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:08:50,464 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.48 ms. Allocated memory is still 138.9 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.53 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 101.8 MB in the beginning and 158.8 MB in the end (delta: -57.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.83 ms. Allocated memory is still 204.5 MB. Free memory was 158.8 MB in the beginning and 155.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.19 ms. Allocated memory is still 204.5 MB. Free memory was 155.9 MB in the beginning and 154.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.44 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 109.4 MB in the end (delta: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17812.87 ms. Allocated memory was 204.5 MB in the beginning and 808.5 MB in the end (delta: 604.0 MB). Free memory was 109.4 MB in the beginning and 533.7 MB in the end (delta: -424.2 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 145 ProgramPointsBefore, 79 ProgramPointsAfterwards, 179 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 28 ConcurrentYvCompositions, 26 ChoiceCompositions, 3606 VarBasedMoverChecksPositive, 166 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 205 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 47380 CheckedPairsTotal, 96 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L726] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1701 SDtfs, 1599 SDslu, 4047 SDs, 0 SdLazy, 2949 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14126occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 10890 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 592 ConstructedInterpolants, 0 QuantifiedInterpolants, 105531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...