/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:18:15,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:18:15,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:18:15,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:18:15,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:18:15,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:18:15,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:18:15,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:18:15,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:18:15,520 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:18:15,521 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:18:15,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:18:15,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:18:15,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:18:15,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:18:15,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:18:15,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:18:15,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:18:15,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:18:15,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:18:15,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:18:15,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:18:15,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:18:15,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:18:15,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:18:15,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:18:15,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:18:15,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:18:15,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:18:15,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:18:15,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:18:15,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:18:15,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:18:15,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:18:15,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:18:15,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:18:15,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:18:15,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:18:15,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:18:15,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:18:15,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:18:15,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:18:15,614 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:18:15,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:18:15,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:18:15,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:18:15,616 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:18:15,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:18:15,616 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:18:15,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:18:15,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:18:15,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:18:15,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:18:15,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:18:15,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:18:15,619 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:18:15,619 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:18:15,619 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:18:15,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:18:15,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:18:15,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:18:15,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:18:15,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:18:15,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:18:15,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:18:15,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:18:15,621 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:18:15,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:18:15,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:18:15,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:18:15,622 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:18:15,622 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:18:15,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:18:15,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:18:15,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:18:15,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:18:15,924 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:18:15,925 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2020-10-16 11:18:16,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8bb285746/17944811aad84c339b2d9d2f05755c9a/FLAG20c2529cb [2020-10-16 11:18:16,563 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:18:16,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2020-10-16 11:18:16,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8bb285746/17944811aad84c339b2d9d2f05755c9a/FLAG20c2529cb [2020-10-16 11:18:16,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8bb285746/17944811aad84c339b2d9d2f05755c9a [2020-10-16 11:18:16,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:18:16,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:18:16,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:18:16,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:18:16,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:18:16,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:18:16" (1/1) ... [2020-10-16 11:18:16,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec1e5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:16, skipping insertion in model container [2020-10-16 11:18:16,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:18:16" (1/1) ... [2020-10-16 11:18:16,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:18:16,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:18:17,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:18:17,410 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:18:17,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:18:17,562 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:18:17,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17 WrapperNode [2020-10-16 11:18:17,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:18:17,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:18:17,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:18:17,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:18:17,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:18:17,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:18:17,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:18:17,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:18:17,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... [2020-10-16 11:18:17,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:18:17,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:18:17,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:18:17,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:18:17,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 11:18:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:18:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:18:17,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:18:17,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:18:17,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:18:17,761 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:18:17,766 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:18:17,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:18:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:18:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:18:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:18:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:18:17,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:18:17,771 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:18:19,881 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:18:19,882 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:18:19,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:18:19 BoogieIcfgContainer [2020-10-16 11:18:19,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:18:19,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:18:19,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:18:19,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:18:19,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:18:16" (1/3) ... [2020-10-16 11:18:19,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203bdca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:18:19, skipping insertion in model container [2020-10-16 11:18:19,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:18:17" (2/3) ... [2020-10-16 11:18:19,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@203bdca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:18:19, skipping insertion in model container [2020-10-16 11:18:19,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:18:19" (3/3) ... [2020-10-16 11:18:19,895 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_pso.opt.i [2020-10-16 11:18:19,907 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:18:19,908 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:18:19,916 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:18:19,918 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:18:19,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,952 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,955 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,957 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:18:19,981 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:18:19,997 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 11:18:20,021 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:18:20,022 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:18:20,022 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:18:20,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:18:20,022 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:18:20,022 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:18:20,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:18:20,023 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:18:20,036 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:18:20,039 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 11:18:20,042 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 11:18:20,043 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 11:18:20,087 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 11:18:20,087 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:18:20,092 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 11:18:20,095 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 11:18:20,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:20,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,908 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 11:18:20,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:20,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:20,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:20,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:20,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:21,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:21,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:21,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:21,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:21,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:18:21,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:21,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:21,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:22,546 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-16 11:18:22,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 11:18:22,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:22,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 11:18:22,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:23,602 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-16 11:18:23,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:23,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:23,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:23,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:23,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:23,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:23,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:23,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:23,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:23,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:23,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:23,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:23,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:23,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:23,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:23,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:23,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:23,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,310 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 11:18:24,430 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 11:18:24,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:24,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:24,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:24,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:24,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:24,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:24,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:24,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 11:18:25,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:18:25,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:18:25,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:18:25,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:25,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:18:25,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:18:25,804 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-16 11:18:26,092 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 11:18:26,215 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 11:18:26,223 INFO L132 LiptonReduction]: Checked pairs total: 4614 [2020-10-16 11:18:26,223 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 11:18:26,229 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-16 11:18:26,311 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-16 11:18:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-16 11:18:26,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 11:18:26,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:26,323 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 11:18:26,324 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:26,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1042200, now seen corresponding path program 1 times [2020-10-16 11:18:26,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:26,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122983282] [2020-10-16 11:18:26,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:26,564 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-16 11:18:26,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122983282] [2020-10-16 11:18:26,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:26,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:18:26,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295274578] [2020-10-16 11:18:26,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:18:26,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:18:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:18:26,590 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-16 11:18:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:26,691 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-16 11:18:26,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:18:26,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 11:18:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:26,721 INFO L225 Difference]: With dead ends: 812 [2020-10-16 11:18:26,721 INFO L226 Difference]: Without dead ends: 687 [2020-10-16 11:18:26,722 INFO L677 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-16 11:18:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-16 11:18:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-16 11:18:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-16 11:18:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-16 11:18:26,833 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-16 11:18:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:26,833 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-16 11:18:26,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:18:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-16 11:18:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:18:26,839 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:26,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:26,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:18:26,841 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash -703108047, now seen corresponding path program 1 times [2020-10-16 11:18:26,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:26,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435391401] [2020-10-16 11:18:26,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:27,074 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-16 11:18:27,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435391401] [2020-10-16 11:18:27,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:27,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:18:27,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864066482] [2020-10-16 11:18:27,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:27,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:27,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:27,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:27,078 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-16 11:18:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:27,172 INFO L93 Difference]: Finished difference Result 802 states and 2417 transitions. [2020-10-16 11:18:27,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:27,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 11:18:27,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:27,181 INFO L225 Difference]: With dead ends: 802 [2020-10-16 11:18:27,181 INFO L226 Difference]: Without dead ends: 677 [2020-10-16 11:18:27,182 INFO L677 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-16 11:18:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-16 11:18:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2020-10-16 11:18:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-16 11:18:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions. [2020-10-16 11:18:27,212 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10 [2020-10-16 11:18:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:27,214 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions. [2020-10-16 11:18:27,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions. [2020-10-16 11:18:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:18:27,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:27,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:27,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:18:27,220 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 478511466, now seen corresponding path program 1 times [2020-10-16 11:18:27,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:27,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772433833] [2020-10-16 11:18:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:27,366 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-16 11:18:27,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772433833] [2020-10-16 11:18:27,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:27,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:18:27,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105682268] [2020-10-16 11:18:27,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:27,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:27,368 INFO L87 Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 4 states. [2020-10-16 11:18:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:27,405 INFO L93 Difference]: Finished difference Result 737 states and 2225 transitions. [2020-10-16 11:18:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:27,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 11:18:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:27,410 INFO L225 Difference]: With dead ends: 737 [2020-10-16 11:18:27,411 INFO L226 Difference]: Without dead ends: 637 [2020-10-16 11:18:27,411 INFO L677 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-16 11:18:27,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-10-16 11:18:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2020-10-16 11:18:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-10-16 11:18:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2020-10-16 11:18:27,433 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 11 [2020-10-16 11:18:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:27,433 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2020-10-16 11:18:27,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2020-10-16 11:18:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:18:27,436 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:27,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:27,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:18:27,436 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:27,437 INFO L82 PathProgramCache]: Analyzing trace with hash -363739686, now seen corresponding path program 1 times [2020-10-16 11:18:27,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:27,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696734669] [2020-10-16 11:18:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:27,558 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-16 11:18:27,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696734669] [2020-10-16 11:18:27,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:27,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:27,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905153142] [2020-10-16 11:18:27,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:27,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:27,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:27,560 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand 5 states. [2020-10-16 11:18:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:27,666 INFO L93 Difference]: Finished difference Result 729 states and 2179 transitions. [2020-10-16 11:18:27,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:27,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 11:18:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:27,673 INFO L225 Difference]: With dead ends: 729 [2020-10-16 11:18:27,673 INFO L226 Difference]: Without dead ends: 629 [2020-10-16 11:18:27,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-16 11:18:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2020-10-16 11:18:27,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-16 11:18:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1940 transitions. [2020-10-16 11:18:27,697 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1940 transitions. Word has length 11 [2020-10-16 11:18:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:27,698 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1940 transitions. [2020-10-16 11:18:27,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1940 transitions. [2020-10-16 11:18:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:18:27,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:27,700 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:27,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:18:27,701 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:27,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1906726849, now seen corresponding path program 1 times [2020-10-16 11:18:27,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:27,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649099395] [2020-10-16 11:18:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:27,798 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-16 11:18:27,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649099395] [2020-10-16 11:18:27,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:27,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:27,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510478583] [2020-10-16 11:18:27,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:27,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:27,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:27,801 INFO L87 Difference]: Start difference. First operand 629 states and 1940 transitions. Second operand 5 states. [2020-10-16 11:18:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:27,855 INFO L93 Difference]: Finished difference Result 677 states and 2028 transitions. [2020-10-16 11:18:27,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:27,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 11:18:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:27,861 INFO L225 Difference]: With dead ends: 677 [2020-10-16 11:18:27,862 INFO L226 Difference]: Without dead ends: 597 [2020-10-16 11:18:27,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2020-10-16 11:18:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2020-10-16 11:18:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2020-10-16 11:18:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1828 transitions. [2020-10-16 11:18:27,885 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1828 transitions. Word has length 12 [2020-10-16 11:18:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:27,886 INFO L481 AbstractCegarLoop]: Abstraction has 597 states and 1828 transitions. [2020-10-16 11:18:27,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1828 transitions. [2020-10-16 11:18:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:18:27,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:27,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:27,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:18:27,925 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:27,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1500736766, now seen corresponding path program 1 times [2020-10-16 11:18:27,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:27,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509426966] [2020-10-16 11:18:27,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:28,013 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-16 11:18:28,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509426966] [2020-10-16 11:18:28,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:28,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:28,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752966826] [2020-10-16 11:18:28,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:28,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:28,015 INFO L87 Difference]: Start difference. First operand 597 states and 1828 transitions. Second operand 5 states. [2020-10-16 11:18:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:28,178 INFO L93 Difference]: Finished difference Result 705 states and 2109 transitions. [2020-10-16 11:18:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:28,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 11:18:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:28,184 INFO L225 Difference]: With dead ends: 705 [2020-10-16 11:18:28,184 INFO L226 Difference]: Without dead ends: 625 [2020-10-16 11:18:28,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-10-16 11:18:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2020-10-16 11:18:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2020-10-16 11:18:28,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1909 transitions. [2020-10-16 11:18:28,209 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1909 transitions. Word has length 12 [2020-10-16 11:18:28,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:28,209 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 1909 transitions. [2020-10-16 11:18:28,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1909 transitions. [2020-10-16 11:18:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:28,211 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:28,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:28,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:18:28,212 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash 164249083, now seen corresponding path program 1 times [2020-10-16 11:18:28,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:28,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390867585] [2020-10-16 11:18:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:28,323 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-16 11:18:28,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390867585] [2020-10-16 11:18:28,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:28,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:18:28,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228386378] [2020-10-16 11:18:28,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 11:18:28,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 11:18:28,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:18:28,327 INFO L87 Difference]: Start difference. First operand 625 states and 1909 transitions. Second operand 7 states. [2020-10-16 11:18:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:28,616 INFO L93 Difference]: Finished difference Result 757 states and 2297 transitions. [2020-10-16 11:18:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:18:28,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 11:18:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:28,624 INFO L225 Difference]: With dead ends: 757 [2020-10-16 11:18:28,624 INFO L226 Difference]: Without dead ends: 693 [2020-10-16 11:18:28,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:18:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-10-16 11:18:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 661. [2020-10-16 11:18:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2020-10-16 11:18:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 2041 transitions. [2020-10-16 11:18:28,653 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 2041 transitions. Word has length 13 [2020-10-16 11:18:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:28,654 INFO L481 AbstractCegarLoop]: Abstraction has 661 states and 2041 transitions. [2020-10-16 11:18:28,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 11:18:28,654 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 2041 transitions. [2020-10-16 11:18:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:28,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:28,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:28,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:18:28,657 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1511603118, now seen corresponding path program 1 times [2020-10-16 11:18:28,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:28,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206230679] [2020-10-16 11:18:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:28,782 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-16 11:18:28,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206230679] [2020-10-16 11:18:28,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:28,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:28,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87587309] [2020-10-16 11:18:28,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:28,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:28,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:28,785 INFO L87 Difference]: Start difference. First operand 661 states and 2041 transitions. Second operand 5 states. [2020-10-16 11:18:28,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:28,897 INFO L93 Difference]: Finished difference Result 715 states and 2155 transitions. [2020-10-16 11:18:28,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:28,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-16 11:18:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:28,903 INFO L225 Difference]: With dead ends: 715 [2020-10-16 11:18:28,903 INFO L226 Difference]: Without dead ends: 655 [2020-10-16 11:18:28,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:28,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2020-10-16 11:18:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2020-10-16 11:18:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2020-10-16 11:18:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 2019 transitions. [2020-10-16 11:18:28,925 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 2019 transitions. Word has length 13 [2020-10-16 11:18:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:28,925 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 2019 transitions. [2020-10-16 11:18:28,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 2019 transitions. [2020-10-16 11:18:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:28,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:28,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:28,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:18:28,928 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash 690656053, now seen corresponding path program 2 times [2020-10-16 11:18:28,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:28,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478042568] [2020-10-16 11:18:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:29,025 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-16 11:18:29,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478042568] [2020-10-16 11:18:29,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:29,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:29,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835180528] [2020-10-16 11:18:29,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:29,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:29,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:29,028 INFO L87 Difference]: Start difference. First operand 655 states and 2019 transitions. Second operand 6 states. [2020-10-16 11:18:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:29,213 INFO L93 Difference]: Finished difference Result 1006 states and 3077 transitions. [2020-10-16 11:18:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:29,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 11:18:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:29,219 INFO L225 Difference]: With dead ends: 1006 [2020-10-16 11:18:29,220 INFO L226 Difference]: Without dead ends: 533 [2020-10-16 11:18:29,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-16 11:18:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-10-16 11:18:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-10-16 11:18:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1616 transitions. [2020-10-16 11:18:29,241 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1616 transitions. Word has length 13 [2020-10-16 11:18:29,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:29,241 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 1616 transitions. [2020-10-16 11:18:29,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1616 transitions. [2020-10-16 11:18:29,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:18:29,243 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:29,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:29,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:18:29,244 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:29,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1637780923, now seen corresponding path program 3 times [2020-10-16 11:18:29,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:29,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306982551] [2020-10-16 11:18:29,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:29,313 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-16 11:18:29,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306982551] [2020-10-16 11:18:29,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:29,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:29,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270578607] [2020-10-16 11:18:29,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:29,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:29,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:29,315 INFO L87 Difference]: Start difference. First operand 533 states and 1616 transitions. Second operand 6 states. [2020-10-16 11:18:29,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:29,488 INFO L93 Difference]: Finished difference Result 781 states and 2333 transitions. [2020-10-16 11:18:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:29,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 11:18:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:29,492 INFO L225 Difference]: With dead ends: 781 [2020-10-16 11:18:29,493 INFO L226 Difference]: Without dead ends: 421 [2020-10-16 11:18:29,493 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:18:29,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-16 11:18:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-16 11:18:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-16 11:18:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1222 transitions. [2020-10-16 11:18:29,508 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1222 transitions. Word has length 13 [2020-10-16 11:18:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:29,508 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1222 transitions. [2020-10-16 11:18:29,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1222 transitions. [2020-10-16 11:18:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:18:29,509 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:29,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:29,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:18:29,510 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2036260720, now seen corresponding path program 1 times [2020-10-16 11:18:29,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:29,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552351769] [2020-10-16 11:18:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:29,601 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-16 11:18:29,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552351769] [2020-10-16 11:18:29,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:29,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:29,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971200302] [2020-10-16 11:18:29,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:29,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:29,604 INFO L87 Difference]: Start difference. First operand 421 states and 1222 transitions. Second operand 6 states. [2020-10-16 11:18:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:29,757 INFO L93 Difference]: Finished difference Result 639 states and 1846 transitions. [2020-10-16 11:18:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:29,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 11:18:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:29,761 INFO L225 Difference]: With dead ends: 639 [2020-10-16 11:18:29,761 INFO L226 Difference]: Without dead ends: 387 [2020-10-16 11:18:29,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2020-10-16 11:18:29,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2020-10-16 11:18:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2020-10-16 11:18:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 1114 transitions. [2020-10-16 11:18:29,775 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 1114 transitions. Word has length 14 [2020-10-16 11:18:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:29,776 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 1114 transitions. [2020-10-16 11:18:29,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 1114 transitions. [2020-10-16 11:18:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:18:29,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:29,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:29,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:18:29,778 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:29,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:29,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1052148230, now seen corresponding path program 1 times [2020-10-16 11:18:29,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:29,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197747451] [2020-10-16 11:18:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:29,908 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-16 11:18:29,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197747451] [2020-10-16 11:18:29,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:29,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:29,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459558095] [2020-10-16 11:18:29,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:29,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:29,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:29,910 INFO L87 Difference]: Start difference. First operand 387 states and 1114 transitions. Second operand 6 states. [2020-10-16 11:18:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:29,989 INFO L93 Difference]: Finished difference Result 513 states and 1459 transitions. [2020-10-16 11:18:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:29,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-16 11:18:29,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:29,994 INFO L225 Difference]: With dead ends: 513 [2020-10-16 11:18:29,994 INFO L226 Difference]: Without dead ends: 277 [2020-10-16 11:18:29,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:18:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2020-10-16 11:18:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2020-10-16 11:18:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2020-10-16 11:18:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 754 transitions. [2020-10-16 11:18:30,005 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 754 transitions. Word has length 15 [2020-10-16 11:18:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:30,005 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 754 transitions. [2020-10-16 11:18:30,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 754 transitions. [2020-10-16 11:18:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:18:30,006 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:30,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:30,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:18:30,007 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash -206433700, now seen corresponding path program 1 times [2020-10-16 11:18:30,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:30,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790901353] [2020-10-16 11:18:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:30,135 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-16 11:18:30,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790901353] [2020-10-16 11:18:30,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:30,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:30,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105382293] [2020-10-16 11:18:30,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:30,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:30,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:30,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:30,141 INFO L87 Difference]: Start difference. First operand 277 states and 754 transitions. Second operand 5 states. [2020-10-16 11:18:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:30,274 INFO L93 Difference]: Finished difference Result 311 states and 822 transitions. [2020-10-16 11:18:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:30,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 11:18:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:30,278 INFO L225 Difference]: With dead ends: 311 [2020-10-16 11:18:30,278 INFO L226 Difference]: Without dead ends: 275 [2020-10-16 11:18:30,278 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:18:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-10-16 11:18:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2020-10-16 11:18:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-10-16 11:18:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 746 transitions. [2020-10-16 11:18:30,289 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 746 transitions. Word has length 15 [2020-10-16 11:18:30,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:30,290 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 746 transitions. [2020-10-16 11:18:30,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 746 transitions. [2020-10-16 11:18:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:18:30,291 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:30,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:30,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:18:30,291 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:30,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:30,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1762021450, now seen corresponding path program 1 times [2020-10-16 11:18:30,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:30,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45860811] [2020-10-16 11:18:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:30,399 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-16 11:18:30,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45860811] [2020-10-16 11:18:30,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:30,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:18:30,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454256808] [2020-10-16 11:18:30,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:18:30,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:30,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:18:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:18:30,402 INFO L87 Difference]: Start difference. First operand 275 states and 746 transitions. Second operand 4 states. [2020-10-16 11:18:30,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:30,432 INFO L93 Difference]: Finished difference Result 262 states and 628 transitions. [2020-10-16 11:18:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:18:30,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-16 11:18:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:30,434 INFO L225 Difference]: With dead ends: 262 [2020-10-16 11:18:30,434 INFO L226 Difference]: Without dead ends: 209 [2020-10-16 11:18:30,435 INFO L677 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-16 11:18:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-16 11:18:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-16 11:18:30,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-16 11:18:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 498 transitions. [2020-10-16 11:18:30,442 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 498 transitions. Word has length 16 [2020-10-16 11:18:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:30,442 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 498 transitions. [2020-10-16 11:18:30,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:18:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 498 transitions. [2020-10-16 11:18:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:18:30,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:30,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:30,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:18:30,444 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1308070420, now seen corresponding path program 1 times [2020-10-16 11:18:30,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:30,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810748069] [2020-10-16 11:18:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:30,526 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-16 11:18:30,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810748069] [2020-10-16 11:18:30,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:30,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:18:30,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566135583] [2020-10-16 11:18:30,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:18:30,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:30,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:18:30,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:18:30,529 INFO L87 Difference]: Start difference. First operand 209 states and 498 transitions. Second operand 5 states. [2020-10-16 11:18:30,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:30,566 INFO L93 Difference]: Finished difference Result 164 states and 346 transitions. [2020-10-16 11:18:30,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:18:30,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-16 11:18:30,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:30,567 INFO L225 Difference]: With dead ends: 164 [2020-10-16 11:18:30,567 INFO L226 Difference]: Without dead ends: 133 [2020-10-16 11:18:30,568 INFO L677 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-16 11:18:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-16 11:18:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2020-10-16 11:18:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-16 11:18:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 274 transitions. [2020-10-16 11:18:30,574 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 274 transitions. Word has length 17 [2020-10-16 11:18:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:30,575 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 274 transitions. [2020-10-16 11:18:30,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:18:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 274 transitions. [2020-10-16 11:18:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-16 11:18:30,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:30,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:30,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:18:30,576 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:30,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:30,577 INFO L82 PathProgramCache]: Analyzing trace with hash -997974655, now seen corresponding path program 1 times [2020-10-16 11:18:30,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:30,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483777505] [2020-10-16 11:18:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:30,696 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-16 11:18:30,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483777505] [2020-10-16 11:18:30,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:30,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:18:30,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766835483] [2020-10-16 11:18:30,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:18:30,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:30,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:18:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:18:30,699 INFO L87 Difference]: Start difference. First operand 133 states and 274 transitions. Second operand 6 states. [2020-10-16 11:18:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:30,751 INFO L93 Difference]: Finished difference Result 112 states and 230 transitions. [2020-10-16 11:18:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:30,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-16 11:18:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:30,753 INFO L225 Difference]: With dead ends: 112 [2020-10-16 11:18:30,753 INFO L226 Difference]: Without dead ends: 103 [2020-10-16 11:18:30,753 INFO L677 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-16 11:18:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-16 11:18:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-16 11:18:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-16 11:18:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 214 transitions. [2020-10-16 11:18:30,757 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 214 transitions. Word has length 19 [2020-10-16 11:18:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:30,757 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 214 transitions. [2020-10-16 11:18:30,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:18:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 214 transitions. [2020-10-16 11:18:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:18:30,758 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:30,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:30,758 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 11:18:30,759 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash -326631246, now seen corresponding path program 1 times [2020-10-16 11:18:30,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:30,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523015957] [2020-10-16 11:18:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:30,928 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-16 11:18:30,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523015957] [2020-10-16 11:18:30,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:30,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:18:30,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208372968] [2020-10-16 11:18:30,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:18:30,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:18:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:18:30,931 INFO L87 Difference]: Start difference. First operand 103 states and 214 transitions. Second operand 8 states. [2020-10-16 11:18:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:31,140 INFO L93 Difference]: Finished difference Result 130 states and 263 transitions. [2020-10-16 11:18:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:18:31,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-16 11:18:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:31,142 INFO L225 Difference]: With dead ends: 130 [2020-10-16 11:18:31,142 INFO L226 Difference]: Without dead ends: 99 [2020-10-16 11:18:31,142 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-10-16 11:18:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-16 11:18:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2020-10-16 11:18:31,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-16 11:18:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 166 transitions. [2020-10-16 11:18:31,146 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 166 transitions. Word has length 22 [2020-10-16 11:18:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:31,146 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 166 transitions. [2020-10-16 11:18:31,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:18:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 166 transitions. [2020-10-16 11:18:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:18:31,147 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:31,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:31,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 11:18:31,148 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash 82721980, now seen corresponding path program 2 times [2020-10-16 11:18:31,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:31,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73469752] [2020-10-16 11:18:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:18:31,550 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-16 11:18:31,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73469752] [2020-10-16 11:18:31,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:18:31,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:18:31,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922404782] [2020-10-16 11:18:31,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:18:31,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:18:31,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:18:31,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:18:31,554 INFO L87 Difference]: Start difference. First operand 87 states and 166 transitions. Second operand 10 states. [2020-10-16 11:18:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:18:31,838 INFO L93 Difference]: Finished difference Result 124 states and 226 transitions. [2020-10-16 11:18:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 11:18:31,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-16 11:18:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:18:31,839 INFO L225 Difference]: With dead ends: 124 [2020-10-16 11:18:31,839 INFO L226 Difference]: Without dead ends: 79 [2020-10-16 11:18:31,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-16 11:18:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-16 11:18:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-10-16 11:18:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-16 11:18:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-16 11:18:31,843 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2020-10-16 11:18:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:18:31,843 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-16 11:18:31,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:18:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-16 11:18:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-16 11:18:31,844 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:18:31,844 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:18:31,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 11:18:31,844 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:18:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:18:31,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1320434386, now seen corresponding path program 3 times [2020-10-16 11:18:31,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:18:31,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321113570] [2020-10-16 11:18:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:18:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:18:31,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:18:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:18:31,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:18:31,966 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:18:31,966 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:18:31,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 11:18:31,986 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-16 11:18:31,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,988 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-16 11:18:31,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,988 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-16 11:18:31,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,989 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-16 11:18:31,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,989 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-16 11:18:31,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,989 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-16 11:18:31,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,990 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-16 11:18:31,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,991 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-16 11:18:31,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,991 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-16 11:18:31,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,991 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-16 11:18:31,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,992 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-16 11:18:31,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,992 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-16 11:18:31,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,992 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-16 11:18:31,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,993 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-16 11:18:31,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,993 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-16 11:18:31,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,994 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-16 11:18:31,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,994 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-16 11:18:31,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,994 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-16 11:18:31,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,995 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-16 11:18:31,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,995 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-16 11:18:31,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,996 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-16 11:18:31,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,996 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-16 11:18:31,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,996 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-16 11:18:31,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,997 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-16 11:18:31,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,997 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-16 11:18:31,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,998 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-16 11:18:31,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,998 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-16 11:18:31,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,998 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-16 11:18:31,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,999 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-16 11:18:31,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,999 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-16 11:18:31,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:31,999 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-16 11:18:31,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:32,000 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-16 11:18:32,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:32,000 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-16 11:18:32,000 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:32,000 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-16 11:18:32,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:32,001 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-16 11:18:32,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:32,001 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-16 11:18:32,001 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:18:32,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:18:32 BasicIcfg [2020-10-16 11:18:32,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:18:32,092 INFO L168 Benchmark]: Toolchain (without parser) took 15247.38 ms. Allocated memory was 141.0 MB in the beginning and 430.4 MB in the end (delta: 289.4 MB). Free memory was 102.9 MB in the beginning and 340.7 MB in the end (delta: -237.8 MB). Peak memory consumption was 51.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,093 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.30 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 159.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.45 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,097 INFO L168 Benchmark]: Boogie Preprocessor took 44.52 ms. Allocated memory is still 205.0 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,098 INFO L168 Benchmark]: RCFGBuilder took 2191.75 ms. Allocated memory was 205.0 MB in the beginning and 246.4 MB in the end (delta: 41.4 MB). Free memory was 154.2 MB in the beginning and 163.6 MB in the end (delta: -9.4 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,100 INFO L168 Benchmark]: TraceAbstraction took 12202.70 ms. Allocated memory was 246.4 MB in the beginning and 430.4 MB in the end (delta: 184.0 MB). Free memory was 161.8 MB in the beginning and 340.7 MB in the end (delta: -178.9 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. [2020-10-16 11:18:32,106 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.30 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 102.5 MB in the beginning and 159.4 MB in the end (delta: -56.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.45 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.1 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.52 ms. Allocated memory is still 205.0 MB. Free memory was 156.1 MB in the beginning and 154.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2191.75 ms. Allocated memory was 205.0 MB in the beginning and 246.4 MB in the end (delta: 41.4 MB). Free memory was 154.2 MB in the beginning and 163.6 MB in the end (delta: -9.4 MB). Peak memory consumption was 99.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12202.70 ms. Allocated memory was 246.4 MB in the beginning and 430.4 MB in the end (delta: 184.0 MB). Free memory was 161.8 MB in the beginning and 340.7 MB in the end (delta: -178.9 MB). Peak memory consumption was 5.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1050 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 122 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.1s, 101 PlacesBefore, 37 PlacesAfterwards, 93 TransitionsBefore, 28 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4614 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; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L710] 0 int z = 0; [L711] 0 _Bool z$flush_delayed; [L712] 0 int z$mem_tmp; [L713] 0 _Bool z$r_buff0_thd0; [L714] 0 _Bool z$r_buff0_thd1; [L715] 0 _Bool z$r_buff0_thd2; [L716] 0 _Bool z$r_buff0_thd3; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$r_buff1_thd3; [L721] 0 _Bool z$read_delayed; [L722] 0 int *z$read_delayed_var; [L723] 0 int z$w_buff0; [L724] 0 _Bool z$w_buff0_used; [L725] 0 int z$w_buff1; [L726] 0 _Bool z$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1970; [L810] FCALL, FORK 0 pthread_create(&t1970, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t1971; [L812] FCALL, FORK 0 pthread_create(&t1971, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 pthread_t t1972; [L732] 1 z$w_buff1 = z$w_buff0 [L733] 1 z$w_buff0 = 2 [L734] 1 z$w_buff1_used = z$w_buff0_used [L735] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L741] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L814] FCALL, FORK 0 pthread_create(&t1972, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L823] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L824] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 z$flush_delayed = weak$$choice2 [L830] 0 z$mem_tmp = z [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L831] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L833] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L834] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L839] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L839] 0 z = z$flush_delayed ? z$mem_tmp : z [L840] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 454 SDtfs, 614 SDslu, 1083 SDs, 0 SdLazy, 652 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 31133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...