/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 15:10:02,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 15:10:02,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 15:10:02,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 15:10:02,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 15:10:02,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 15:10:02,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 15:10:02,686 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 15:10:02,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 15:10:02,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 15:10:02,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 15:10:02,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 15:10:02,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 15:10:02,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 15:10:02,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 15:10:02,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 15:10:02,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 15:10:02,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 15:10:02,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 15:10:02,699 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 15:10:02,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 15:10:02,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 15:10:02,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 15:10:02,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 15:10:02,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 15:10:02,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 15:10:02,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 15:10:02,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 15:10:02,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 15:10:02,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 15:10:02,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 15:10:02,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 15:10:02,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 15:10:02,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 15:10:02,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 15:10:02,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 15:10:02,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 15:10:02,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 15:10:02,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 15:10:02,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 15:10:02,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 15:10:02,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 15:10:02,738 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 15:10:02,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 15:10:02,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 15:10:02,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 15:10:02,740 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 15:10:02,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 15:10:02,740 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 15:10:02,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 15:10:02,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 15:10:02,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 15:10:02,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 15:10:02,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 15:10:02,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 15:10:02,741 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 15:10:02,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 15:10:02,742 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 15:10:02,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 15:10:02,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 15:10:02,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 15:10:02,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 15:10:02,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 15:10:02,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:10:02,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 15:10:02,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 15:10:02,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 15:10:02,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 15:10:02,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 15:10:02,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 15:10:02,744 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 15:10:02,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 15:10:03,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 15:10:03,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 15:10:03,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 15:10:03,099 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 15:10:03,099 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 15:10:03,100 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-10-11 15:10:03,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da12e3ff/b58617900d8844f893fdf3b8c38b115a/FLAGe0f38f586 [2020-10-11 15:10:03,677 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 15:10:03,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-10-11 15:10:03,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da12e3ff/b58617900d8844f893fdf3b8c38b115a/FLAGe0f38f586 [2020-10-11 15:10:04,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da12e3ff/b58617900d8844f893fdf3b8c38b115a [2020-10-11 15:10:04,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 15:10:04,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 15:10:04,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 15:10:04,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 15:10:04,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 15:10:04,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4046afe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04, skipping insertion in model container [2020-10-11 15:10:04,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 15:10:04,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 15:10:04,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:10:04,620 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 15:10:04,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 15:10:04,760 INFO L208 MainTranslator]: Completed translation [2020-10-11 15:10:04,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04 WrapperNode [2020-10-11 15:10:04,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 15:10:04,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 15:10:04,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 15:10:04,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 15:10:04,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,792 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 15:10:04,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 15:10:04,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 15:10:04,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 15:10:04,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... [2020-10-11 15:10:04,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 15:10:04,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 15:10:04,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 15:10:04,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 15:10:04,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 15:10:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 15:10:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 15:10:04,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 15:10:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 15:10:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 15:10:04,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 15:10:04,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 15:10:04,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 15:10:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 15:10:04,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 15:10:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 15:10:04,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 15:10:04,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 15:10:04,950 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 15:10:06,787 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 15:10:06,787 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 15:10:06,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:06 BoogieIcfgContainer [2020-10-11 15:10:06,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 15:10:06,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 15:10:06,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 15:10:06,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 15:10:06,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:10:04" (1/3) ... [2020-10-11 15:10:06,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494f114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:06, skipping insertion in model container [2020-10-11 15:10:06,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:10:04" (2/3) ... [2020-10-11 15:10:06,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@494f114f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:10:06, skipping insertion in model container [2020-10-11 15:10:06,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:10:06" (3/3) ... [2020-10-11 15:10:06,799 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2020-10-11 15:10:06,811 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 15:10:06,811 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 15:10:06,819 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 15:10:06,820 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 15:10:06,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,848 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,849 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,853 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,853 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,854 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,854 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,855 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,856 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,857 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,861 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,861 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,869 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,870 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,870 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,871 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,872 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,872 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,873 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,873 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 15:10:06,887 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 15:10:06,909 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 15:10:06,909 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 15:10:06,909 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 15:10:06,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 15:10:06,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 15:10:06,910 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 15:10:06,910 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 15:10:06,910 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 15:10:06,923 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 15:10:06,926 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-11 15:10:06,929 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-11 15:10:06,931 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-11 15:10:06,976 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-11 15:10:06,976 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 15:10:06,981 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 15:10:06,984 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-11 15:10:07,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 15:10:07,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:07,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 15:10:07,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:07,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:07,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:07,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:07,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:08,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:08,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:10:08,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:10:08,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:10:08,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:10:08,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:10:08,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:10:08,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-11 15:10:08,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 15:10:08,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:10:08,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:10:08,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:10:08,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:10:08,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:08,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-11 15:10:08,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 15:10:08,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 15:10:08,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:08,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 15:10:08,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 15:10:08,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-11 15:10:08,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:08,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-11 15:10:08,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:08,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:08,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:09,786 WARN L193 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-11 15:10:09,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-11 15:10:09,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:09,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-11 15:10:09,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:10,607 WARN L193 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-11 15:10:10,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:10,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:10,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:10,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:10,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:10,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:10,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:10,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:10,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 15:10:11,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,580 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-11 15:10:11,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:11,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:11,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:11,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:11,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:11,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:11,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:11,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:11,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:12,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:12,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:12,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:12,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:12,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:12,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:12,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:12,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:12,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:12,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 15:10:12,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 15:10:12,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 15:10:12,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:12,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 15:10:12,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 15:10:12,813 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-11 15:10:12,929 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-11 15:10:12,937 INFO L132 LiptonReduction]: Checked pairs total: 4033 [2020-10-11 15:10:12,937 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-11 15:10:12,944 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-11 15:10:13,004 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-10-11 15:10:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-10-11 15:10:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-11 15:10:13,014 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:13,014 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:13,015 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash -66047429, now seen corresponding path program 1 times [2020-10-11 15:10:13,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:13,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064983549] [2020-10-11 15:10:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:13,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064983549] [2020-10-11 15:10:13,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:13,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 15:10:13,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771149111] [2020-10-11 15:10:13,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 15:10:13,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:13,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 15:10:13,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 15:10:13,310 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-10-11 15:10:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:13,418 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-11 15:10:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 15:10:13,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-11 15:10:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:13,468 INFO L225 Difference]: With dead ends: 650 [2020-10-11 15:10:13,469 INFO L226 Difference]: Without dead ends: 550 [2020-10-11 15:10:13,471 INFO L673 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 [2020-10-11 15:10:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-11 15:10:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-10-11 15:10:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-11 15:10:13,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-10-11 15:10:13,580 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-10-11 15:10:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:13,581 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-10-11 15:10:13,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 15:10:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-10-11 15:10:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-11 15:10:13,584 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:13,584 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:13,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 15:10:13,584 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:13,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash -522474688, now seen corresponding path program 1 times [2020-10-11 15:10:13,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:13,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163012521] [2020-10-11 15:10:13,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:13,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163012521] [2020-10-11 15:10:13,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:13,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:10:13,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689712289] [2020-10-11 15:10:13,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:10:13,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:10:13,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:10:13,742 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-10-11 15:10:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:13,783 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-10-11 15:10:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:10:13,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-11 15:10:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:13,789 INFO L225 Difference]: With dead ends: 630 [2020-10-11 15:10:13,789 INFO L226 Difference]: Without dead ends: 530 [2020-10-11 15:10:13,790 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-11 15:10:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-11 15:10:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-11 15:10:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-10-11 15:10:13,818 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-10-11 15:10:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:13,819 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-10-11 15:10:13,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:10:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-10-11 15:10:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 15:10:13,821 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:13,821 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:13,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 15:10:13,822 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1950155091, now seen corresponding path program 1 times [2020-10-11 15:10:13,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:13,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339800266] [2020-10-11 15:10:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:13,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339800266] [2020-10-11 15:10:13,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:13,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 15:10:13,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844991889] [2020-10-11 15:10:13,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:10:13,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:10:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:10:13,928 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-10-11 15:10:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:13,977 INFO L93 Difference]: Finished difference Result 594 states and 1749 transitions. [2020-10-11 15:10:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:10:13,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-11 15:10:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:13,982 INFO L225 Difference]: With dead ends: 594 [2020-10-11 15:10:13,982 INFO L226 Difference]: Without dead ends: 514 [2020-10-11 15:10:13,983 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-11 15:10:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-10-11 15:10:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-10-11 15:10:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-10-11 15:10:14,002 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2020-10-11 15:10:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:14,002 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-10-11 15:10:14,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:10:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-10-11 15:10:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 15:10:14,005 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:14,005 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:14,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 15:10:14,006 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 325262475, now seen corresponding path program 1 times [2020-10-11 15:10:14,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:14,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109512348] [2020-10-11 15:10:14,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:14,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109512348] [2020-10-11 15:10:14,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:14,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:10:14,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005476610] [2020-10-11 15:10:14,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:10:14,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:14,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:10:14,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:14,127 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 5 states. [2020-10-11 15:10:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:14,261 INFO L93 Difference]: Finished difference Result 564 states and 1642 transitions. [2020-10-11 15:10:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:10:14,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-11 15:10:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:14,267 INFO L225 Difference]: With dead ends: 564 [2020-10-11 15:10:14,267 INFO L226 Difference]: Without dead ends: 482 [2020-10-11 15:10:14,267 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:10:14,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-11 15:10:14,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-10-11 15:10:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-11 15:10:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1441 transitions. [2020-10-11 15:10:14,285 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1441 transitions. Word has length 12 [2020-10-11 15:10:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:14,286 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1441 transitions. [2020-10-11 15:10:14,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:10:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1441 transitions. [2020-10-11 15:10:14,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 15:10:14,292 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:14,292 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:14,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 15:10:14,292 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:14,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1491768963, now seen corresponding path program 1 times [2020-10-11 15:10:14,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:14,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618374583] [2020-10-11 15:10:14,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:14,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:14,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618374583] [2020-10-11 15:10:14,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:14,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:10:14,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690165255] [2020-10-11 15:10:14,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:10:14,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:14,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:10:14,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:14,443 INFO L87 Difference]: Start difference. First operand 482 states and 1441 transitions. Second operand 5 states. [2020-10-11 15:10:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:14,559 INFO L93 Difference]: Finished difference Result 564 states and 1634 transitions. [2020-10-11 15:10:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:10:14,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-11 15:10:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:14,564 INFO L225 Difference]: With dead ends: 564 [2020-10-11 15:10:14,564 INFO L226 Difference]: Without dead ends: 502 [2020-10-11 15:10:14,569 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:10:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-10-11 15:10:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 486. [2020-10-11 15:10:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-11 15:10:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1437 transitions. [2020-10-11 15:10:14,592 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1437 transitions. Word has length 13 [2020-10-11 15:10:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:14,593 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1437 transitions. [2020-10-11 15:10:14,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:10:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1437 transitions. [2020-10-11 15:10:14,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:10:14,594 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:14,594 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:14,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 15:10:14,596 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:14,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:14,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1962812064, now seen corresponding path program 1 times [2020-10-11 15:10:14,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:14,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911275612] [2020-10-11 15:10:14,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911275612] [2020-10-11 15:10:14,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:14,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:10:14,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506939496] [2020-10-11 15:10:14,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:10:14,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:14,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:10:14,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:10:14,766 INFO L87 Difference]: Start difference. First operand 486 states and 1437 transitions. Second operand 6 states. [2020-10-11 15:10:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:14,930 INFO L93 Difference]: Finished difference Result 729 states and 2077 transitions. [2020-10-11 15:10:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:10:14,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-11 15:10:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:14,937 INFO L225 Difference]: With dead ends: 729 [2020-10-11 15:10:14,937 INFO L226 Difference]: Without dead ends: 502 [2020-10-11 15:10:14,939 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:10:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2020-10-11 15:10:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 466. [2020-10-11 15:10:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-10-11 15:10:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1326 transitions. [2020-10-11 15:10:14,965 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1326 transitions. Word has length 14 [2020-10-11 15:10:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:14,966 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 1326 transitions. [2020-10-11 15:10:14,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:10:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1326 transitions. [2020-10-11 15:10:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 15:10:14,968 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:14,968 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:14,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 15:10:14,968 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash -999850772, now seen corresponding path program 1 times [2020-10-11 15:10:14,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:14,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918753576] [2020-10-11 15:10:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:15,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918753576] [2020-10-11 15:10:15,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:15,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:10:15,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920560693] [2020-10-11 15:10:15,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:10:15,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:15,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:10:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:10:15,152 INFO L87 Difference]: Start difference. First operand 466 states and 1326 transitions. Second operand 6 states. [2020-10-11 15:10:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:15,349 INFO L93 Difference]: Finished difference Result 488 states and 1364 transitions. [2020-10-11 15:10:15,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:10:15,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-11 15:10:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:15,353 INFO L225 Difference]: With dead ends: 488 [2020-10-11 15:10:15,354 INFO L226 Difference]: Without dead ends: 458 [2020-10-11 15:10:15,355 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-11 15:10:15,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-11 15:10:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 454. [2020-10-11 15:10:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-10-11 15:10:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1288 transitions. [2020-10-11 15:10:15,372 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1288 transitions. Word has length 14 [2020-10-11 15:10:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:15,372 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 1288 transitions. [2020-10-11 15:10:15,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:10:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1288 transitions. [2020-10-11 15:10:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 15:10:15,374 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:15,374 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:15,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 15:10:15,374 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -717635042, now seen corresponding path program 1 times [2020-10-11 15:10:15,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:15,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453349331] [2020-10-11 15:10:15,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:15,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453349331] [2020-10-11 15:10:15,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:15,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:10:15,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142282829] [2020-10-11 15:10:15,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:10:15,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:15,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:10:15,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:10:15,465 INFO L87 Difference]: Start difference. First operand 454 states and 1288 transitions. Second operand 4 states. [2020-10-11 15:10:15,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:15,502 INFO L93 Difference]: Finished difference Result 438 states and 1097 transitions. [2020-10-11 15:10:15,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:10:15,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-11 15:10:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:15,505 INFO L225 Difference]: With dead ends: 438 [2020-10-11 15:10:15,505 INFO L226 Difference]: Without dead ends: 330 [2020-10-11 15:10:15,506 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-10-11 15:10:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2020-10-11 15:10:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2020-10-11 15:10:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 808 transitions. [2020-10-11 15:10:15,517 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 808 transitions. Word has length 15 [2020-10-11 15:10:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:15,518 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 808 transitions. [2020-10-11 15:10:15,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:10:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 808 transitions. [2020-10-11 15:10:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 15:10:15,519 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:15,519 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:15,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 15:10:15,519 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:15,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:15,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1081399702, now seen corresponding path program 1 times [2020-10-11 15:10:15,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:15,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098837956] [2020-10-11 15:10:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:15,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098837956] [2020-10-11 15:10:15,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:15,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 15:10:15,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573850733] [2020-10-11 15:10:15,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 15:10:15,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 15:10:15,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:15,622 INFO L87 Difference]: Start difference. First operand 330 states and 808 transitions. Second operand 5 states. [2020-10-11 15:10:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:15,672 INFO L93 Difference]: Finished difference Result 261 states and 579 transitions. [2020-10-11 15:10:15,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 15:10:15,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-11 15:10:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:15,674 INFO L225 Difference]: With dead ends: 261 [2020-10-11 15:10:15,674 INFO L226 Difference]: Without dead ends: 204 [2020-10-11 15:10:15,675 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:10:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-11 15:10:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2020-10-11 15:10:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-10-11 15:10:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 442 transitions. [2020-10-11 15:10:15,682 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 442 transitions. Word has length 16 [2020-10-11 15:10:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:15,682 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 442 transitions. [2020-10-11 15:10:15,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 15:10:15,682 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 442 transitions. [2020-10-11 15:10:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 15:10:15,683 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:15,683 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:15,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 15:10:15,683 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1975064388, now seen corresponding path program 1 times [2020-10-11 15:10:15,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:15,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958543814] [2020-10-11 15:10:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:15,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958543814] [2020-10-11 15:10:15,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:15,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 15:10:15,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664462412] [2020-10-11 15:10:15,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 15:10:15,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 15:10:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 15:10:15,761 INFO L87 Difference]: Start difference. First operand 204 states and 442 transitions. Second operand 4 states. [2020-10-11 15:10:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:15,786 INFO L93 Difference]: Finished difference Result 299 states and 616 transitions. [2020-10-11 15:10:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 15:10:15,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-11 15:10:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:15,788 INFO L225 Difference]: With dead ends: 299 [2020-10-11 15:10:15,788 INFO L226 Difference]: Without dead ends: 190 [2020-10-11 15:10:15,788 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 15:10:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2020-10-11 15:10:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2020-10-11 15:10:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-11 15:10:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 354 transitions. [2020-10-11 15:10:15,794 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 354 transitions. Word has length 17 [2020-10-11 15:10:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:15,794 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 354 transitions. [2020-10-11 15:10:15,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 15:10:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 354 transitions. [2020-10-11 15:10:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-11 15:10:15,795 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:15,795 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:15,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 15:10:15,796 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash 704500665, now seen corresponding path program 1 times [2020-10-11 15:10:15,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:15,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659364635] [2020-10-11 15:10:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:15,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:15,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659364635] [2020-10-11 15:10:15,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:15,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 15:10:15,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511906170] [2020-10-11 15:10:15,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 15:10:15,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:15,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 15:10:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 15:10:15,872 INFO L87 Difference]: Start difference. First operand 182 states and 354 transitions. Second operand 6 states. [2020-10-11 15:10:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:15,918 INFO L93 Difference]: Finished difference Result 155 states and 300 transitions. [2020-10-11 15:10:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 15:10:15,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-11 15:10:15,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:15,919 INFO L225 Difference]: With dead ends: 155 [2020-10-11 15:10:15,919 INFO L226 Difference]: Without dead ends: 52 [2020-10-11 15:10:15,921 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-11 15:10:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-11 15:10:15,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-10-11 15:10:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-11 15:10:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-11 15:10:15,924 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-10-11 15:10:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:15,924 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-11 15:10:15,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 15:10:15,925 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-11 15:10:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:10:15,925 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:15,925 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:15,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 15:10:15,926 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:15,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:15,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1659320673, now seen corresponding path program 1 times [2020-10-11 15:10:15,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:15,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160935350] [2020-10-11 15:10:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 15:10:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 15:10:16,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160935350] [2020-10-11 15:10:16,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 15:10:16,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 15:10:16,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292718797] [2020-10-11 15:10:16,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 15:10:16,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 15:10:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 15:10:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-11 15:10:16,357 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 9 states. [2020-10-11 15:10:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 15:10:16,539 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-10-11 15:10:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 15:10:16,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-11 15:10:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 15:10:16,541 INFO L225 Difference]: With dead ends: 63 [2020-10-11 15:10:16,541 INFO L226 Difference]: Without dead ends: 36 [2020-10-11 15:10:16,541 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-11 15:10:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-11 15:10:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-11 15:10:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-11 15:10:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-10-11 15:10:16,543 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-10-11 15:10:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 15:10:16,544 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-10-11 15:10:16,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 15:10:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-10-11 15:10:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-11 15:10:16,544 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 15:10:16,544 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 15:10:16,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 15:10:16,545 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 15:10:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 15:10:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 923826655, now seen corresponding path program 2 times [2020-10-11 15:10:16,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 15:10:16,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035252022] [2020-10-11 15:10:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 15:10:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:10:16,580 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:10:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 15:10:16,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 15:10:16,647 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 15:10:16,647 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 15:10:16,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 15:10:16,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,666 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,668 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,669 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,669 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,669 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,671 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,671 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,672 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,672 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,673 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,673 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,674 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,674 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,675 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,675 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,676 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,676 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,677 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,677 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,678 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 15:10:16,678 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 15:10:16,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:10:16 BasicIcfg [2020-10-11 15:10:16,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 15:10:16,748 INFO L168 Benchmark]: Toolchain (without parser) took 12728.91 ms. Allocated memory was 248.5 MB in the beginning and 507.0 MB in the end (delta: 258.5 MB). Free memory was 203.6 MB in the beginning and 247.5 MB in the end (delta: -43.8 MB). Peak memory consumption was 214.7 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:16,749 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 15:10:16,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.72 ms. Allocated memory was 248.5 MB in the beginning and 306.7 MB in the end (delta: 58.2 MB). Free memory was 203.6 MB in the beginning and 255.1 MB in the end (delta: -51.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:16,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.22 ms. Allocated memory is still 306.7 MB. Free memory was 255.1 MB in the beginning and 250.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:16,754 INFO L168 Benchmark]: Boogie Preprocessor took 46.09 ms. Allocated memory is still 306.7 MB. Free memory was 250.0 MB in the beginning and 247.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:16,755 INFO L168 Benchmark]: RCFGBuilder took 1910.93 ms. Allocated memory was 306.7 MB in the beginning and 354.9 MB in the end (delta: 48.2 MB). Free memory was 247.5 MB in the beginning and 205.8 MB in the end (delta: 41.7 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:16,756 INFO L168 Benchmark]: TraceAbstraction took 9953.70 ms. Allocated memory was 354.9 MB in the beginning and 507.0 MB in the end (delta: 152.0 MB). Free memory was 205.8 MB in the beginning and 247.5 MB in the end (delta: -41.7 MB). Peak memory consumption was 110.4 MB. Max. memory is 14.2 GB. [2020-10-11 15:10:16,764 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 248.5 MB. Free memory is still 224.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 740.72 ms. Allocated memory was 248.5 MB in the beginning and 306.7 MB in the end (delta: 58.2 MB). Free memory was 203.6 MB in the beginning and 255.1 MB in the end (delta: -51.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.22 ms. Allocated memory is still 306.7 MB. Free memory was 255.1 MB in the beginning and 250.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.09 ms. Allocated memory is still 306.7 MB. Free memory was 250.0 MB in the beginning and 247.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1910.93 ms. Allocated memory was 306.7 MB in the beginning and 354.9 MB in the end (delta: 48.2 MB). Free memory was 247.5 MB in the beginning and 205.8 MB in the end (delta: 41.7 MB). Peak memory consumption was 95.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9953.70 ms. Allocated memory was 354.9 MB in the beginning and 507.0 MB in the end (delta: 152.0 MB). Free memory was 205.8 MB in the beginning and 247.5 MB in the end (delta: -41.7 MB). Peak memory consumption was 110.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 998 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.0s, 98 PlacesBefore, 36 PlacesAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4033 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2492; [L801] FCALL, FORK 0 pthread_create(&t2492, ((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] [L802] 0 pthread_t t2493; [L803] FCALL, FORK 0 pthread_create(&t2493, ((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] [L804] 0 pthread_t t2494; [L805] FCALL, FORK 0 pthread_create(&t2494, ((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] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)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=0] [L775] 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] [L728] 1 z = 2 VAL [__unbuffered_cnt=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=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=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=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=1, 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=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] 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) [L778] 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) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 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 [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L749] 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) [L749] 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) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$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 [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L811] 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) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] 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) [L811] 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) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$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 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 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 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 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) [L822] 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) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 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)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 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)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 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)) [L826] 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)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 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)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() 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=255, x=2, y=2, y$flush_delayed=0, 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, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 333 SDtfs, 361 SDslu, 644 SDs, 0 SdLazy, 305 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 68 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 18887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...