/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 08:08:01,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 08:08:01,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 08:08:01,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 08:08:01,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 08:08:01,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 08:08:01,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 08:08:01,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 08:08:01,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 08:08:01,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 08:08:01,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 08:08:01,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 08:08:01,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 08:08:01,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 08:08:01,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 08:08:01,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 08:08:01,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 08:08:01,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 08:08:01,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 08:08:01,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 08:08:01,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 08:08:01,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 08:08:01,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 08:08:01,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 08:08:01,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 08:08:01,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 08:08:01,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 08:08:01,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 08:08:01,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 08:08:01,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 08:08:01,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 08:08:01,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 08:08:01,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 08:08:01,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 08:08:01,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 08:08:01,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 08:08:01,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 08:08:01,778 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 08:08:01,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 08:08:01,779 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 08:08:01,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 08:08:01,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 08:08:01,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 08:08:01,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 08:08:01,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 08:08:01,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 08:08:01,800 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 08:08:01,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 08:08:01,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 08:08:01,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 08:08:01,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 08:08:01,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 08:08:01,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 08:08:01,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 08:08:01,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 08:08:01,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 08:08:01,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 08:08:01,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 08:08:01,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 08:08:01,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 08:08:01,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 08:08:01,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 08:08:01,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 08:08:01,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:08:01,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 08:08:01,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 08:08:01,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 08:08:01,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 08:08:01,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 08:08:01,805 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 08:08:01,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 08:08:01,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 08:08:02,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 08:08:02,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 08:08:02,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 08:08:02,080 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 08:08:02,080 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 08:08:02,081 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2019-12-27 08:08:02,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2da3994/b12938d9fe304f5cb6a85452af2757e1/FLAGfb76de923 [2019-12-27 08:08:02,697 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 08:08:02,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2019-12-27 08:08:02,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2da3994/b12938d9fe304f5cb6a85452af2757e1/FLAGfb76de923 [2019-12-27 08:08:02,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f2da3994/b12938d9fe304f5cb6a85452af2757e1 [2019-12-27 08:08:02,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 08:08:02,989 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 08:08:02,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:02,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 08:08:02,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 08:08:02,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:02" (1/1) ... [2019-12-27 08:08:02,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0d5ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:02, skipping insertion in model container [2019-12-27 08:08:02,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:08:02" (1/1) ... [2019-12-27 08:08:03,004 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 08:08:03,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 08:08:03,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:03,585 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 08:08:03,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 08:08:03,720 INFO L208 MainTranslator]: Completed translation [2019-12-27 08:08:03,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03 WrapperNode [2019-12-27 08:08:03,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 08:08:03,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:03,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 08:08:03,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 08:08:03,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 08:08:03,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 08:08:03,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 08:08:03,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 08:08:03,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... [2019-12-27 08:08:03,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 08:08:03,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 08:08:03,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 08:08:03,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 08:08:03,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 08:08:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 08:08:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 08:08:03,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 08:08:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 08:08:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 08:08:03,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 08:08:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 08:08:03,923 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 08:08:03,923 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 08:08:03,924 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 08:08:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 08:08:03,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 08:08:03,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 08:08:03,926 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 08:08:04,638 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 08:08:04,638 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 08:08:04,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:04 BoogieIcfgContainer [2019-12-27 08:08:04,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 08:08:04,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 08:08:04,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 08:08:04,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 08:08:04,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:08:02" (1/3) ... [2019-12-27 08:08:04,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceed0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:04, skipping insertion in model container [2019-12-27 08:08:04,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:08:03" (2/3) ... [2019-12-27 08:08:04,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ceed0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:08:04, skipping insertion in model container [2019-12-27 08:08:04,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:08:04" (3/3) ... [2019-12-27 08:08:04,648 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2019-12-27 08:08:04,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 08:08:04,660 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 08:08:04,668 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 08:08:04,669 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 08:08:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,707 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,710 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,725 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,726 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,727 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,729 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,730 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,730 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,743 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,745 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,746 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,754 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 08:08:04,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 08:08:04,792 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 08:08:04,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 08:08:04,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 08:08:04,793 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 08:08:04,794 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 08:08:04,797 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 08:08:04,798 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 08:08:04,798 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 08:08:04,838 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-27 08:08:04,849 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 08:08:04,948 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 08:08:04,948 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:04,965 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:04,982 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 08:08:05,028 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 08:08:05,028 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 08:08:05,034 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 08:08:05,048 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 08:08:05,049 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 08:08:08,450 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 08:08:08,561 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 08:08:08,583 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47769 [2019-12-27 08:08:08,584 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 08:08:08,586 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-27 08:08:09,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16048 states. [2019-12-27 08:08:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 16048 states. [2019-12-27 08:08:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 08:08:09,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:09,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:09,414 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2062442641, now seen corresponding path program 1 times [2019-12-27 08:08:09,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:09,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013603924] [2019-12-27 08:08:09,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:09,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013603924] [2019-12-27 08:08:09,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:09,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 08:08:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418245829] [2019-12-27 08:08:09,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:09,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:09,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:09,680 INFO L87 Difference]: Start difference. First operand 16048 states. Second operand 3 states. [2019-12-27 08:08:10,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:10,185 INFO L93 Difference]: Finished difference Result 15976 states and 59309 transitions. [2019-12-27 08:08:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:10,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 08:08:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:10,396 INFO L225 Difference]: With dead ends: 15976 [2019-12-27 08:08:10,396 INFO L226 Difference]: Without dead ends: 15638 [2019-12-27 08:08:10,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15638 states. [2019-12-27 08:08:11,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15638 to 15638. [2019-12-27 08:08:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15638 states. [2019-12-27 08:08:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15638 states to 15638 states and 58100 transitions. [2019-12-27 08:08:11,845 INFO L78 Accepts]: Start accepts. Automaton has 15638 states and 58100 transitions. Word has length 7 [2019-12-27 08:08:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:11,847 INFO L462 AbstractCegarLoop]: Abstraction has 15638 states and 58100 transitions. [2019-12-27 08:08:11,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 15638 states and 58100 transitions. [2019-12-27 08:08:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:11,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:11,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:11,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:11,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1739907337, now seen corresponding path program 1 times [2019-12-27 08:08:11,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:11,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833223678] [2019-12-27 08:08:11,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:11,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833223678] [2019-12-27 08:08:11,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:11,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:11,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956994357] [2019-12-27 08:08:11,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:11,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:11,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:11,967 INFO L87 Difference]: Start difference. First operand 15638 states and 58100 transitions. Second operand 4 states. [2019-12-27 08:08:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:12,648 INFO L93 Difference]: Finished difference Result 24994 states and 89270 transitions. [2019-12-27 08:08:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:12,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 08:08:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:12,971 INFO L225 Difference]: With dead ends: 24994 [2019-12-27 08:08:12,971 INFO L226 Difference]: Without dead ends: 24980 [2019-12-27 08:08:12,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24980 states. [2019-12-27 08:08:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24980 to 22308. [2019-12-27 08:08:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22308 states. [2019-12-27 08:08:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22308 states to 22308 states and 80649 transitions. [2019-12-27 08:08:13,950 INFO L78 Accepts]: Start accepts. Automaton has 22308 states and 80649 transitions. Word has length 13 [2019-12-27 08:08:13,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:13,950 INFO L462 AbstractCegarLoop]: Abstraction has 22308 states and 80649 transitions. [2019-12-27 08:08:13,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:08:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 22308 states and 80649 transitions. [2019-12-27 08:08:13,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 08:08:13,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:13,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:13,953 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1595374669, now seen corresponding path program 1 times [2019-12-27 08:08:13,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:13,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075731135] [2019-12-27 08:08:13,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:14,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075731135] [2019-12-27 08:08:14,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:14,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:14,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576774824] [2019-12-27 08:08:14,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:14,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:14,071 INFO L87 Difference]: Start difference. First operand 22308 states and 80649 transitions. Second operand 3 states. [2019-12-27 08:08:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:14,243 INFO L93 Difference]: Finished difference Result 12738 states and 39797 transitions. [2019-12-27 08:08:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:14,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 08:08:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:14,284 INFO L225 Difference]: With dead ends: 12738 [2019-12-27 08:08:14,285 INFO L226 Difference]: Without dead ends: 12738 [2019-12-27 08:08:14,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-12-27 08:08:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 12738. [2019-12-27 08:08:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12738 states. [2019-12-27 08:08:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12738 states to 12738 states and 39797 transitions. [2019-12-27 08:08:15,685 INFO L78 Accepts]: Start accepts. Automaton has 12738 states and 39797 transitions. Word has length 13 [2019-12-27 08:08:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:15,685 INFO L462 AbstractCegarLoop]: Abstraction has 12738 states and 39797 transitions. [2019-12-27 08:08:15,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:15,686 INFO L276 IsEmpty]: Start isEmpty. Operand 12738 states and 39797 transitions. [2019-12-27 08:08:15,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 08:08:15,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:15,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:15,687 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:15,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:15,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1225120988, now seen corresponding path program 1 times [2019-12-27 08:08:15,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:15,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103509899] [2019-12-27 08:08:15,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:15,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103509899] [2019-12-27 08:08:15,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:15,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:08:15,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307336175] [2019-12-27 08:08:15,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 08:08:15,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:15,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 08:08:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:15,749 INFO L87 Difference]: Start difference. First operand 12738 states and 39797 transitions. Second operand 4 states. [2019-12-27 08:08:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:15,772 INFO L93 Difference]: Finished difference Result 1939 states and 4475 transitions. [2019-12-27 08:08:15,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 08:08:15,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 08:08:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:15,777 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 08:08:15,777 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 08:08:15,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 08:08:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 08:08:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 08:08:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 08:08:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4475 transitions. [2019-12-27 08:08:15,811 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4475 transitions. Word has length 14 [2019-12-27 08:08:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:15,811 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4475 transitions. [2019-12-27 08:08:15,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 08:08:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4475 transitions. [2019-12-27 08:08:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 08:08:15,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:15,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:15,814 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash 509934292, now seen corresponding path program 1 times [2019-12-27 08:08:15,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:15,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467929287] [2019-12-27 08:08:15,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:15,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467929287] [2019-12-27 08:08:15,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:15,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:08:15,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712755539] [2019-12-27 08:08:15,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:08:15,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:08:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:15,912 INFO L87 Difference]: Start difference. First operand 1939 states and 4475 transitions. Second operand 5 states. [2019-12-27 08:08:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:15,936 INFO L93 Difference]: Finished difference Result 670 states and 1573 transitions. [2019-12-27 08:08:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:15,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 08:08:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:15,938 INFO L225 Difference]: With dead ends: 670 [2019-12-27 08:08:15,938 INFO L226 Difference]: Without dead ends: 670 [2019-12-27 08:08:15,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-27 08:08:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 600. [2019-12-27 08:08:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-27 08:08:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1408 transitions. [2019-12-27 08:08:15,949 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1408 transitions. Word has length 26 [2019-12-27 08:08:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:15,950 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1408 transitions. [2019-12-27 08:08:15,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:08:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1408 transitions. [2019-12-27 08:08:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:15,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:15,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:15,953 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:15,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1992668075, now seen corresponding path program 1 times [2019-12-27 08:08:15,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:15,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165911344] [2019-12-27 08:08:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:16,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165911344] [2019-12-27 08:08:16,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:16,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 08:08:16,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892904516] [2019-12-27 08:08:16,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:16,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:16,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:16,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:16,023 INFO L87 Difference]: Start difference. First operand 600 states and 1408 transitions. Second operand 3 states. [2019-12-27 08:08:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:16,064 INFO L93 Difference]: Finished difference Result 612 states and 1424 transitions. [2019-12-27 08:08:16,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:16,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 08:08:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:16,067 INFO L225 Difference]: With dead ends: 612 [2019-12-27 08:08:16,067 INFO L226 Difference]: Without dead ends: 612 [2019-12-27 08:08:16,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-27 08:08:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 606. [2019-12-27 08:08:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-27 08:08:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1418 transitions. [2019-12-27 08:08:16,077 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1418 transitions. Word has length 55 [2019-12-27 08:08:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:16,078 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1418 transitions. [2019-12-27 08:08:16,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1418 transitions. [2019-12-27 08:08:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 08:08:16,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:16,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:16,080 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:16,080 INFO L82 PathProgramCache]: Analyzing trace with hash 411437521, now seen corresponding path program 1 times [2019-12-27 08:08:16,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:16,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43263552] [2019-12-27 08:08:16,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:16,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43263552] [2019-12-27 08:08:16,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:16,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:16,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148039222] [2019-12-27 08:08:16,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:16,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:16,189 INFO L87 Difference]: Start difference. First operand 606 states and 1418 transitions. Second operand 3 states. [2019-12-27 08:08:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:16,206 INFO L93 Difference]: Finished difference Result 606 states and 1392 transitions. [2019-12-27 08:08:16,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:16,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 08:08:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:16,208 INFO L225 Difference]: With dead ends: 606 [2019-12-27 08:08:16,208 INFO L226 Difference]: Without dead ends: 606 [2019-12-27 08:08:16,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-12-27 08:08:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-12-27 08:08:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-27 08:08:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1392 transitions. [2019-12-27 08:08:16,218 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1392 transitions. Word has length 55 [2019-12-27 08:08:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1392 transitions. [2019-12-27 08:08:16,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1392 transitions. [2019-12-27 08:08:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:08:16,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:16,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:16,221 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1667899224, now seen corresponding path program 1 times [2019-12-27 08:08:16,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:16,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376713848] [2019-12-27 08:08:16,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:16,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376713848] [2019-12-27 08:08:16,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:16,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 08:08:16,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212733185] [2019-12-27 08:08:16,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 08:08:16,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:16,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 08:08:16,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:08:16,392 INFO L87 Difference]: Start difference. First operand 606 states and 1392 transitions. Second operand 8 states. [2019-12-27 08:08:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:16,846 INFO L93 Difference]: Finished difference Result 1055 states and 2432 transitions. [2019-12-27 08:08:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 08:08:16,847 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-27 08:08:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:16,850 INFO L225 Difference]: With dead ends: 1055 [2019-12-27 08:08:16,850 INFO L226 Difference]: Without dead ends: 1055 [2019-12-27 08:08:16,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-27 08:08:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-12-27 08:08:16,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 744. [2019-12-27 08:08:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-12-27 08:08:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1721 transitions. [2019-12-27 08:08:16,865 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1721 transitions. Word has length 56 [2019-12-27 08:08:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:16,865 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1721 transitions. [2019-12-27 08:08:16,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 08:08:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1721 transitions. [2019-12-27 08:08:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:08:16,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:16,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:16,868 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1143632828, now seen corresponding path program 2 times [2019-12-27 08:08:16,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:16,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720914349] [2019-12-27 08:08:16,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:16,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720914349] [2019-12-27 08:08:16,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:16,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:08:16,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590885845] [2019-12-27 08:08:16,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:08:16,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:16,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:08:16,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:17,000 INFO L87 Difference]: Start difference. First operand 744 states and 1721 transitions. Second operand 5 states. [2019-12-27 08:08:17,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:17,181 INFO L93 Difference]: Finished difference Result 964 states and 2206 transitions. [2019-12-27 08:08:17,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:08:17,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 08:08:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:17,183 INFO L225 Difference]: With dead ends: 964 [2019-12-27 08:08:17,183 INFO L226 Difference]: Without dead ends: 964 [2019-12-27 08:08:17,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:08:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-12-27 08:08:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 736. [2019-12-27 08:08:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 08:08:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1701 transitions. [2019-12-27 08:08:17,196 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1701 transitions. Word has length 56 [2019-12-27 08:08:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:17,196 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1701 transitions. [2019-12-27 08:08:17,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:08:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1701 transitions. [2019-12-27 08:08:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:08:17,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:17,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:17,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:17,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:17,199 INFO L82 PathProgramCache]: Analyzing trace with hash 510037058, now seen corresponding path program 3 times [2019-12-27 08:08:17,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:17,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958200047] [2019-12-27 08:08:17,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:17,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958200047] [2019-12-27 08:08:17,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:17,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 08:08:17,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056715737] [2019-12-27 08:08:17,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 08:08:17,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 08:08:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 08:08:17,325 INFO L87 Difference]: Start difference. First operand 736 states and 1701 transitions. Second operand 5 states. [2019-12-27 08:08:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:17,371 INFO L93 Difference]: Finished difference Result 1063 states and 2291 transitions. [2019-12-27 08:08:17,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 08:08:17,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 08:08:17,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:17,373 INFO L225 Difference]: With dead ends: 1063 [2019-12-27 08:08:17,375 INFO L226 Difference]: Without dead ends: 674 [2019-12-27 08:08:17,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 08:08:17,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-12-27 08:08:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-12-27 08:08:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-12-27 08:08:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1522 transitions. [2019-12-27 08:08:17,387 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1522 transitions. Word has length 56 [2019-12-27 08:08:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:17,387 INFO L462 AbstractCegarLoop]: Abstraction has 674 states and 1522 transitions. [2019-12-27 08:08:17,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 08:08:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1522 transitions. [2019-12-27 08:08:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 08:08:17,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:17,389 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:17,389 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 281240766, now seen corresponding path program 4 times [2019-12-27 08:08:17,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:17,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235903881] [2019-12-27 08:08:17,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:17,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235903881] [2019-12-27 08:08:17,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:17,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 08:08:17,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118202905] [2019-12-27 08:08:17,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 08:08:17,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 08:08:17,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:17,465 INFO L87 Difference]: Start difference. First operand 674 states and 1522 transitions. Second operand 3 states. [2019-12-27 08:08:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:17,526 INFO L93 Difference]: Finished difference Result 674 states and 1521 transitions. [2019-12-27 08:08:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 08:08:17,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 08:08:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:17,528 INFO L225 Difference]: With dead ends: 674 [2019-12-27 08:08:17,529 INFO L226 Difference]: Without dead ends: 674 [2019-12-27 08:08:17,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 08:08:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-12-27 08:08:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 437. [2019-12-27 08:08:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-12-27 08:08:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 973 transitions. [2019-12-27 08:08:17,538 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 973 transitions. Word has length 56 [2019-12-27 08:08:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:17,538 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 973 transitions. [2019-12-27 08:08:17,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 08:08:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 973 transitions. [2019-12-27 08:08:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:17,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:17,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:17,540 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -265184758, now seen corresponding path program 1 times [2019-12-27 08:08:17,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:17,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901942464] [2019-12-27 08:08:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:17,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901942464] [2019-12-27 08:08:17,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:17,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 08:08:17,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016158700] [2019-12-27 08:08:17,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 08:08:17,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 08:08:17,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 08:08:17,682 INFO L87 Difference]: Start difference. First operand 437 states and 973 transitions. Second operand 6 states. [2019-12-27 08:08:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:17,746 INFO L93 Difference]: Finished difference Result 709 states and 1533 transitions. [2019-12-27 08:08:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 08:08:17,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-27 08:08:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:17,748 INFO L225 Difference]: With dead ends: 709 [2019-12-27 08:08:17,748 INFO L226 Difference]: Without dead ends: 245 [2019-12-27 08:08:17,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 08:08:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-12-27 08:08:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 221. [2019-12-27 08:08:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-27 08:08:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 390 transitions. [2019-12-27 08:08:17,752 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 390 transitions. Word has length 57 [2019-12-27 08:08:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:17,752 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 390 transitions. [2019-12-27 08:08:17,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 08:08:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 390 transitions. [2019-12-27 08:08:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:17,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:17,754 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:17,754 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:17,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:17,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1560317592, now seen corresponding path program 2 times [2019-12-27 08:08:17,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:17,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832094346] [2019-12-27 08:08:17,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:17,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832094346] [2019-12-27 08:08:17,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:17,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 08:08:17,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293891957] [2019-12-27 08:08:17,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 08:08:17,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:17,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 08:08:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 08:08:17,977 INFO L87 Difference]: Start difference. First operand 221 states and 390 transitions. Second operand 12 states. [2019-12-27 08:08:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:18,380 INFO L93 Difference]: Finished difference Result 386 states and 663 transitions. [2019-12-27 08:08:18,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 08:08:18,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-27 08:08:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:18,381 INFO L225 Difference]: With dead ends: 386 [2019-12-27 08:08:18,382 INFO L226 Difference]: Without dead ends: 355 [2019-12-27 08:08:18,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-27 08:08:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-12-27 08:08:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 321. [2019-12-27 08:08:18,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 08:08:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 561 transitions. [2019-12-27 08:08:18,388 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 561 transitions. Word has length 57 [2019-12-27 08:08:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:18,388 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 561 transitions. [2019-12-27 08:08:18,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 08:08:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 561 transitions. [2019-12-27 08:08:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:18,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:18,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, 1, 1, 1] [2019-12-27 08:08:18,390 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:18,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:18,390 INFO L82 PathProgramCache]: Analyzing trace with hash -438640254, now seen corresponding path program 3 times [2019-12-27 08:08:18,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:18,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055309260] [2019-12-27 08:08:18,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 08:08:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 08:08:18,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055309260] [2019-12-27 08:08:18,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 08:08:18,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 08:08:18,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076511276] [2019-12-27 08:08:18,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 08:08:18,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 08:08:18,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 08:08:18,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 08:08:18,655 INFO L87 Difference]: Start difference. First operand 321 states and 561 transitions. Second operand 13 states. [2019-12-27 08:08:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 08:08:19,152 INFO L93 Difference]: Finished difference Result 422 states and 714 transitions. [2019-12-27 08:08:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 08:08:19,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 08:08:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 08:08:19,154 INFO L225 Difference]: With dead ends: 422 [2019-12-27 08:08:19,154 INFO L226 Difference]: Without dead ends: 391 [2019-12-27 08:08:19,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-27 08:08:19,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-27 08:08:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 329. [2019-12-27 08:08:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-27 08:08:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 575 transitions. [2019-12-27 08:08:19,161 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 575 transitions. Word has length 57 [2019-12-27 08:08:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 08:08:19,161 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 575 transitions. [2019-12-27 08:08:19,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 08:08:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 575 transitions. [2019-12-27 08:08:19,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 08:08:19,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 08:08:19,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 08:08:19,163 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 08:08:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 08:08:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1131378088, now seen corresponding path program 4 times [2019-12-27 08:08:19,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 08:08:19,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337402755] [2019-12-27 08:08:19,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 08:08:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:08:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 08:08:19,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 08:08:19,298 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 08:08:19,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_7 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_15) (= v_~y~0_25 0) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_23 0) (= 0 v_~weak$$choice2~0_34) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2504~0.base_27|) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2504~0.base_27| 4)) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd0~0_50) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2504~0.base_27|)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2504~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2504~0.base_27|) |v_ULTIMATE.start_main_~#t2504~0.offset_20| 0)) |v_#memory_int_23|) (= v_~y$r_buff0_thd0~0_77 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2504~0.base_27| 1)) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_18 0) (= 0 |v_ULTIMATE.start_main_~#t2504~0.offset_20|) (= 0 v_~__unbuffered_cnt~0_22) (= v_~main$tmp_guard1~0_10 0) (= v_~z~0_12 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t2504~0.base=|v_ULTIMATE.start_main_~#t2504~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t2504~0.offset=|v_ULTIMATE.start_main_~#t2504~0.offset_20|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_18, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ULTIMATE.start_main_~#t2505~0.offset=|v_ULTIMATE.start_main_~#t2505~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_~#t2506~0.offset=|v_ULTIMATE.start_main_~#t2506~0.offset_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t2506~0.base=|v_ULTIMATE.start_main_~#t2506~0.base_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_34, ULTIMATE.start_main_~#t2505~0.base=|v_ULTIMATE.start_main_~#t2505~0.base_20|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2504~0.base, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2504~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t2505~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2506~0.offset, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2506~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t2505~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:08:19,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2505~0.base_9| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2505~0.base_9|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2505~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t2505~0.base_9|)) (= (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2505~0.base_9| 1) |v_#valid_33|) (= |v_ULTIMATE.start_main_~#t2505~0.offset_9| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2505~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2505~0.base_9|) |v_ULTIMATE.start_main_~#t2505~0.offset_9| 1)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t2505~0.offset=|v_ULTIMATE.start_main_~#t2505~0.offset_9|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2505~0.base=|v_ULTIMATE.start_main_~#t2505~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2505~0.offset, #length, ULTIMATE.start_main_~#t2505~0.base] because there is no mapped edge [2019-12-27 08:08:19,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t2506~0.offset_9| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2506~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2506~0.base_10|) |v_ULTIMATE.start_main_~#t2506~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2506~0.base_10| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2506~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2506~0.base_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2506~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t2506~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2506~0.offset=|v_ULTIMATE.start_main_~#t2506~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t2506~0.base=|v_ULTIMATE.start_main_~#t2506~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2506~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t2506~0.base, #length] because there is no mapped edge [2019-12-27 08:08:19,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] P2ENTRY-->L4-3: Formula: (and (= ~y$w_buff1~0_Out394297616 ~y$w_buff0~0_In394297616) (= |P2Thread1of1ForFork0_#in~arg.base_In394297616| P2Thread1of1ForFork0_~arg.base_Out394297616) (= 2 ~y$w_buff0~0_Out394297616) (= |P2Thread1of1ForFork0_#in~arg.offset_In394297616| P2Thread1of1ForFork0_~arg.offset_Out394297616) (= ~y$w_buff0_used~0_Out394297616 1) (= ~y$w_buff1_used~0_Out394297616 ~y$w_buff0_used~0_In394297616) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out394297616 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out394297616|) (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out394297616|) (= 0 (mod ~y$w_buff1_used~0_Out394297616 256))) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In394297616|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In394297616, ~y$w_buff0~0=~y$w_buff0~0_In394297616, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In394297616|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out394297616, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out394297616|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In394297616|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out394297616, ~y$w_buff1~0=~y$w_buff1~0_Out394297616, ~y$w_buff0~0=~y$w_buff0~0_Out394297616, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out394297616, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In394297616|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out394297616, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out394297616} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 08:08:19,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 2 v_~z~0_8) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z~0=v_~z~0_8, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 08:08:19,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-903579051 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-903579051 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite11_Out-903579051|)) (and (= ~y$w_buff0_used~0_In-903579051 |P2Thread1of1ForFork0_#t~ite11_Out-903579051|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-903579051, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-903579051} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-903579051, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-903579051|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-903579051} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 08:08:19,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-2131625616 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2131625616 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-2131625616| |P1Thread1of1ForFork2_#t~ite3_Out-2131625616|))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork2_#t~ite3_Out-2131625616| ~y~0_In-2131625616)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-2131625616| ~y$w_buff1~0_In-2131625616) (not .cse0) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2131625616, ~y$w_buff1~0=~y$w_buff1~0_In-2131625616, ~y~0=~y~0_In-2131625616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131625616} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2131625616, ~y$w_buff1~0=~y$w_buff1~0_In-2131625616, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-2131625616|, ~y~0=~y~0_In-2131625616, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-2131625616|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131625616} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 08:08:19,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1143312944 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1143312944 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1143312944 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1143312944 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1143312944 |P2Thread1of1ForFork0_#t~ite12_Out1143312944|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite12_Out1143312944|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1143312944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1143312944, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1143312944, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1143312944} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1143312944, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1143312944, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1143312944|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1143312944, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1143312944} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 08:08:19,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1408974866 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1408974866 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out1408974866|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1408974866 |P1Thread1of1ForFork2_#t~ite5_Out1408974866|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1408974866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1408974866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1408974866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1408974866, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1408974866|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 08:08:19,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-382112807 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-382112807 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-382112807 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-382112807 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-382112807 |P1Thread1of1ForFork2_#t~ite6_Out-382112807|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite6_Out-382112807|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-382112807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-382112807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-382112807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-382112807} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-382112807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-382112807, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-382112807, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-382112807|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-382112807} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 08:08:19,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In776692901 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In776692901 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out776692901| ~y$r_buff0_thd2~0_In776692901)) (and (= |P1Thread1of1ForFork2_#t~ite7_Out776692901| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In776692901, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In776692901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In776692901, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In776692901, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out776692901|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 08:08:19,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-982654216 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-982654216 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-982654216 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-982654216 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-982654216|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out-982654216| ~y$r_buff1_thd2~0_In-982654216)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-982654216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982654216, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-982654216, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-982654216} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-982654216, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-982654216, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-982654216|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-982654216, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-982654216} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 08:08:19,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 08:08:19,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1914267443 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1914267443 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out1914267443) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In1914267443 ~y$r_buff0_thd3~0_Out1914267443) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1914267443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1914267443} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1914267443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1914267443, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out1914267443|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 08:08:19,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1314399857 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1314399857 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1314399857 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1314399857 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out-1314399857|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-1314399857 |P2Thread1of1ForFork0_#t~ite14_Out-1314399857|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1314399857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1314399857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1314399857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314399857} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-1314399857|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1314399857, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1314399857, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1314399857, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1314399857} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 08:08:19,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 08:08:19,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 08:08:19,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite18_Out1458314949| |ULTIMATE.start_main_#t~ite19_Out1458314949|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1458314949 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1458314949 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff1~0_In1458314949 |ULTIMATE.start_main_#t~ite18_Out1458314949|)) (and .cse2 (= |ULTIMATE.start_main_#t~ite18_Out1458314949| ~y~0_In1458314949) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1458314949, ~y~0=~y~0_In1458314949, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1458314949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458314949} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1458314949, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1458314949|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1458314949|, ~y~0=~y~0_In1458314949, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1458314949, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1458314949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 08:08:19,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1344516521 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1344516521 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1344516521 |ULTIMATE.start_main_#t~ite20_Out-1344516521|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1344516521|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344516521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1344516521} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1344516521, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1344516521, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1344516521|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 08:08:19,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1796881404 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1796881404 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1796881404 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1796881404 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1796881404 |ULTIMATE.start_main_#t~ite21_Out1796881404|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite21_Out1796881404|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1796881404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1796881404, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1796881404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1796881404} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1796881404, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1796881404, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1796881404|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1796881404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1796881404} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 08:08:19,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1313974328 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1313974328 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1313974328 |ULTIMATE.start_main_#t~ite22_Out-1313974328|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1313974328| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313974328, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313974328} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1313974328, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1313974328, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1313974328|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 08:08:19,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1221139085 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1221139085 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1221139085 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1221139085 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1221139085|)) (and (= ~y$r_buff1_thd0~0_In1221139085 |ULTIMATE.start_main_#t~ite23_Out1221139085|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1221139085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1221139085, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1221139085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1221139085} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1221139085, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1221139085, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1221139085, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1221139085|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1221139085} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 08:08:19,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L820-->L820-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In646726087 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In646726087 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In646726087 256)) .cse0) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In646726087 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In646726087 256)))) (= |ULTIMATE.start_main_#t~ite29_Out646726087| ~y$w_buff0~0_In646726087) .cse1 (= |ULTIMATE.start_main_#t~ite29_Out646726087| |ULTIMATE.start_main_#t~ite30_Out646726087|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out646726087| ~y$w_buff0~0_In646726087) (= |ULTIMATE.start_main_#t~ite29_In646726087| |ULTIMATE.start_main_#t~ite29_Out646726087|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In646726087, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In646726087|, ~y$w_buff0~0=~y$w_buff0~0_In646726087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In646726087, ~weak$$choice2~0=~weak$$choice2~0_In646726087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In646726087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In646726087} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out646726087|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In646726087, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out646726087|, ~y$w_buff0~0=~y$w_buff0~0_In646726087, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In646726087, ~weak$$choice2~0=~weak$$choice2~0_In646726087, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In646726087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In646726087} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 08:08:19,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L821-->L821-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1371601449 256) 0))) (or (and (= ~y$w_buff1~0_In-1371601449 |ULTIMATE.start_main_#t~ite32_Out-1371601449|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1371601449 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1371601449 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-1371601449 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-1371601449 256) 0) .cse0))) (= |ULTIMATE.start_main_#t~ite33_Out-1371601449| |ULTIMATE.start_main_#t~ite32_Out-1371601449|) .cse1) (and (not .cse1) (= ~y$w_buff1~0_In-1371601449 |ULTIMATE.start_main_#t~ite33_Out-1371601449|) (= |ULTIMATE.start_main_#t~ite32_In-1371601449| |ULTIMATE.start_main_#t~ite32_Out-1371601449|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1371601449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371601449, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1371601449, ~weak$$choice2~0=~weak$$choice2~0_In-1371601449, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1371601449, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In-1371601449|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1371601449} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1371601449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1371601449, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1371601449, ~weak$$choice2~0=~weak$$choice2~0_In-1371601449, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1371601449|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1371601449, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1371601449|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1371601449} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 08:08:19,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In426529592 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out426529592| |ULTIMATE.start_main_#t~ite36_Out426529592|) (= |ULTIMATE.start_main_#t~ite35_Out426529592| ~y$w_buff0_used~0_In426529592) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In426529592 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In426529592 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In426529592 256)) (and (= 0 (mod ~y$w_buff1_used~0_In426529592 256)) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In426529592| |ULTIMATE.start_main_#t~ite35_Out426529592|) (= ~y$w_buff0_used~0_In426529592 |ULTIMATE.start_main_#t~ite36_Out426529592|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In426529592, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In426529592, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In426529592|, ~weak$$choice2~0=~weak$$choice2~0_In426529592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In426529592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426529592} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In426529592, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In426529592, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out426529592|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out426529592|, ~weak$$choice2~0=~weak$$choice2~0_In426529592, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In426529592, ~y$w_buff1_used~0=~y$w_buff1_used~0_In426529592} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 08:08:19,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L825: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff0_thd0~0_62)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 08:08:19,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L825-->L825-8: Formula: (let ((.cse5 (= |ULTIMATE.start_main_#t~ite45_Out-1594280225| |ULTIMATE.start_main_#t~ite44_Out-1594280225|)) (.cse0 (= (mod ~weak$$choice2~0_In-1594280225 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd0~0_In-1594280225 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1594280225 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1594280225 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1594280225 256)))) (or (and (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1594280225| ~y$r_buff1_thd0~0_In-1594280225) (= |ULTIMATE.start_main_#t~ite44_Out-1594280225| |ULTIMATE.start_main_#t~ite44_In-1594280225|) (not .cse0)) (and (or (and .cse1 .cse2) .cse3 (and .cse1 .cse4)) (= ~y$r_buff1_thd0~0_In-1594280225 |ULTIMATE.start_main_#t~ite44_Out-1594280225|) .cse5 .cse0)) (= |ULTIMATE.start_main_#t~ite43_In-1594280225| |ULTIMATE.start_main_#t~ite43_Out-1594280225|)) (let ((.cse6 (not .cse1))) (and (= |ULTIMATE.start_main_#t~ite43_Out-1594280225| 0) (= |ULTIMATE.start_main_#t~ite44_Out-1594280225| |ULTIMATE.start_main_#t~ite43_Out-1594280225|) .cse5 .cse0 (or .cse6 (not .cse4)) (or .cse6 (not .cse2)) (not .cse3))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594280225, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1594280225, ~weak$$choice2~0=~weak$$choice2~0_In-1594280225, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-1594280225|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1594280225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594280225, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1594280225|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1594280225, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1594280225, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1594280225|, ~weak$$choice2~0=~weak$$choice2~0_In-1594280225, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1594280225, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1594280225|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1594280225|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1594280225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 08:08:19,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_21 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 08:08:19,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 08:08:19,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:08:19 BasicIcfg [2019-12-27 08:08:19,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 08:08:19,400 INFO L168 Benchmark]: Toolchain (without parser) took 16411.51 ms. Allocated memory was 137.9 MB in the beginning and 804.3 MB in the end (delta: 666.4 MB). Free memory was 99.9 MB in the beginning and 301.4 MB in the end (delta: -201.5 MB). Peak memory consumption was 464.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,401 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.33 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 156.0 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.50 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,402 INFO L168 Benchmark]: Boogie Preprocessor took 51.17 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,403 INFO L168 Benchmark]: RCFGBuilder took 784.10 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 104.0 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,404 INFO L168 Benchmark]: TraceAbstraction took 14757.02 ms. Allocated memory was 201.9 MB in the beginning and 804.3 MB in the end (delta: 602.4 MB). Free memory was 103.3 MB in the beginning and 301.4 MB in the end (delta: -198.1 MB). Peak memory consumption was 404.3 MB. Max. memory is 7.1 GB. [2019-12-27 08:08:19,407 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.33 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 99.7 MB in the beginning and 156.0 MB in the end (delta: -56.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.50 ms. Allocated memory is still 201.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.17 ms. Allocated memory is still 201.9 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.10 ms. Allocated memory is still 201.9 MB. Free memory was 149.9 MB in the beginning and 104.0 MB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14757.02 ms. Allocated memory was 201.9 MB in the beginning and 804.3 MB in the end (delta: 602.4 MB). Free memory was 103.3 MB in the beginning and 301.4 MB in the end (delta: -198.1 MB). Peak memory consumption was 404.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 161 ProgramPointsBefore, 82 ProgramPointsAfterwards, 192 TransitionsBefore, 88 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 4003 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 47769 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2504, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L820] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L821] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L822] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1330 SDtfs, 1039 SDslu, 3103 SDs, 0 SdLazy, 1412 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22308occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3644 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 635 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 116756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...