/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:46:34,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:46:34,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:46:34,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:46:34,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:46:34,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:46:34,777 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:46:34,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:46:34,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:46:34,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:46:34,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:46:34,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:46:34,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:46:34,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:46:34,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:46:34,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:46:34,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:46:34,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:46:34,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:46:34,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:46:34,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:46:34,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:46:34,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:46:34,796 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:46:34,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:46:34,799 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:46:34,799 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:46:34,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:46:34,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:46:34,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:46:34,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:46:34,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:46:34,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:46:34,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:46:34,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:46:34,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:46:34,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:46:34,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:46:34,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:46:34,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:46:34,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:46:34,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:46:34,831 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:46:34,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:46:34,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:46:34,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:46:34,833 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:46:34,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:46:34,834 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:46:34,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:46:34,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:46:34,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:46:34,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:46:34,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:46:34,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:46:34,835 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:46:34,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:46:34,836 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:46:34,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:46:34,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:46:34,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:46:34,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:46:34,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:46:34,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:46:34,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:46:34,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:46:34,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:46:34,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:46:34,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:46:34,838 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:46:34,838 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:46:34,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:46:34,839 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:46:35,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:46:35,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:46:35,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:46:35,138 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:46:35,138 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:46:35,139 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2020-10-16 13:46:35,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/07632dc48/62c548a21cd44df8ae8ae6ad4932affa/FLAGf22e51e39 [2020-10-16 13:46:35,818 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:46:35,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2020-10-16 13:46:35,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/07632dc48/62c548a21cd44df8ae8ae6ad4932affa/FLAGf22e51e39 [2020-10-16 13:46:36,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/07632dc48/62c548a21cd44df8ae8ae6ad4932affa [2020-10-16 13:46:36,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:46:36,072 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:46:36,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:36,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:46:36,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:46:36,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6eb65d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36, skipping insertion in model container [2020-10-16 13:46:36,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:46:36,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:46:36,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:36,666 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:46:36,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:46:36,843 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:46:36,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36 WrapperNode [2020-10-16 13:46:36,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:46:36,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:36,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:46:36,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:46:36,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:46:36,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:46:36,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:46:36,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:46:36,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (1/1) ... [2020-10-16 13:46:36,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:46:36,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:46:36,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:46:36,964 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:46:36,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (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 13:46:37,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:46:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:46:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:46:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:46:37,035 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:46:37,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:46:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:46:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:46:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:46:37,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:46:37,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:46:37,039 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 13:46:38,925 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:46:38,925 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:46:38,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:38 BoogieIcfgContainer [2020-10-16 13:46:38,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:46:38,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:46:38,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:46:38,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:46:38,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:46:36" (1/3) ... [2020-10-16 13:46:38,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1486d0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:38, skipping insertion in model container [2020-10-16 13:46:38,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:46:36" (2/3) ... [2020-10-16 13:46:38,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1486d0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:46:38, skipping insertion in model container [2020-10-16 13:46:38,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:46:38" (3/3) ... [2020-10-16 13:46:38,937 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2020-10-16 13:46:38,948 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:46:38,949 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:46:38,956 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:46:38,957 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:46:38,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,984 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,985 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,985 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,986 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,986 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,989 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,989 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,990 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,997 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,998 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:38,998 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,000 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,001 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:46:39,004 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:46:39,017 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 13:46:39,038 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:46:39,038 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:46:39,038 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:46:39,038 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:46:39,038 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:46:39,039 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:46:39,039 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:46:39,039 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:46:39,051 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:46:39,052 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-16 13:46:39,055 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-16 13:46:39,056 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 13:46:39,093 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 13:46:39,093 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:46:39,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 13:46:39,100 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 13:46:39,780 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:46:39,911 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 13:46:41,059 WARN L193 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 13:46:41,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:46:41,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:46:41,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 13:46:41,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:46:41,776 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 13:46:42,733 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:46:43,067 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:46:43,693 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2020-10-16 13:46:44,038 WARN L193 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-10-16 13:46:44,619 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-16 13:46:44,887 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-16 13:46:45,286 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 13:46:45,615 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 13:46:45,979 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 13:46:46,085 INFO L132 LiptonReduction]: Checked pairs total: 2235 [2020-10-16 13:46:46,086 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 13:46:46,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-16 13:46:46,110 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-16 13:46:46,113 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-16 13:46:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-16 13:46:46,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:46,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-16 13:46:46,120 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 895506, now seen corresponding path program 1 times [2020-10-16 13:46:46,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:46,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062176181] [2020-10-16 13:46:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:46,343 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 13:46:46,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062176181] [2020-10-16 13:46:46,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:46,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:46:46,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1411456730] [2020-10-16 13:46:46,347 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:46,349 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:46,361 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-16 13:46:46,362 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:46,366 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:46,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:46:46,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:46,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:46:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:46:46,384 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-16 13:46:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:46,447 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-16 13:46:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:46,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-16 13:46:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:46,461 INFO L225 Difference]: With dead ends: 137 [2020-10-16 13:46:46,461 INFO L226 Difference]: Without dead ends: 112 [2020-10-16 13:46:46,463 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 13:46:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-16 13:46:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-16 13:46:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-16 13:46:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-16 13:46:46,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-16 13:46:46,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:46,515 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-16 13:46:46,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:46:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-16 13:46:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:46:46,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:46,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:46,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:46:46,517 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1857466431, now seen corresponding path program 1 times [2020-10-16 13:46:46,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:46,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150778471] [2020-10-16 13:46:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:46,623 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 13:46:46,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150778471] [2020-10-16 13:46:46,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:46,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:46:46,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [924350948] [2020-10-16 13:46:46,625 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:46,627 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:46,631 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:46:46,631 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:46,632 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:46,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:46:46,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:46,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:46:46,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:46:46,636 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-16 13:46:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:46,668 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-16 13:46:46,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:46,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:46:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:46,672 INFO L225 Difference]: With dead ends: 111 [2020-10-16 13:46:46,672 INFO L226 Difference]: Without dead ends: 111 [2020-10-16 13:46:46,673 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 13:46:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-16 13:46:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-16 13:46:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-16 13:46:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-16 13:46:46,690 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-16 13:46:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:46,690 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-16 13:46:46,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:46:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-16 13:46:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:46:46,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:46,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:46,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:46:46,692 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:46,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1750629419, now seen corresponding path program 1 times [2020-10-16 13:46:46,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:46,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809542598] [2020-10-16 13:46:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:46,790 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 13:46:46,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809542598] [2020-10-16 13:46:46,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:46,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:46:46,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350170946] [2020-10-16 13:46:46,792 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:46,793 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:46,795 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2020-10-16 13:46:46,795 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:46,843 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:46,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:46:46,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:46:46,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:46,845 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 4 states. [2020-10-16 13:46:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:46,880 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-16 13:46:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:46,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-16 13:46:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:46,882 INFO L225 Difference]: With dead ends: 110 [2020-10-16 13:46:46,883 INFO L226 Difference]: Without dead ends: 110 [2020-10-16 13:46:46,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-16 13:46:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-16 13:46:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-16 13:46:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-16 13:46:46,894 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 8 [2020-10-16 13:46:46,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:46,894 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-16 13:46:46,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:46:46,894 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-16 13:46:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 13:46:46,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:46,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:46,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:46:46,896 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1746918336, now seen corresponding path program 1 times [2020-10-16 13:46:46,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:46,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173794000] [2020-10-16 13:46:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:46,986 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 13:46:46,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173794000] [2020-10-16 13:46:46,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:46,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:46:46,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697604406] [2020-10-16 13:46:46,988 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:46,994 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:46,995 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-16 13:46:46,996 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:47,011 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:47,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:46:47,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:47,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:46:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:47,013 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-16 13:46:47,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:47,046 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-16 13:46:47,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:46:47,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-16 13:46:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:47,048 INFO L225 Difference]: With dead ends: 109 [2020-10-16 13:46:47,049 INFO L226 Difference]: Without dead ends: 109 [2020-10-16 13:46:47,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:46:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-16 13:46:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-16 13:46:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-16 13:46:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-16 13:46:47,058 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-16 13:46:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:47,058 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-16 13:46:47,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:46:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-16 13:46:47,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:47,060 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:47,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:47,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:46:47,060 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1273980600, now seen corresponding path program 1 times [2020-10-16 13:46:47,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:47,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756891234] [2020-10-16 13:46:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:47,165 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 13:46:47,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756891234] [2020-10-16 13:46:47,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:47,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:47,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1170496956] [2020-10-16 13:46:47,167 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:47,168 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:47,170 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 23 transitions. [2020-10-16 13:46:47,170 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:47,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:47,192 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:47,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:47,214 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-16 13:46:47,272 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:47,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:47,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:47,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:47,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:47,273 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-16 13:46:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:47,347 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-16 13:46:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:46:47,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 13:46:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:47,350 INFO L225 Difference]: With dead ends: 154 [2020-10-16 13:46:47,350 INFO L226 Difference]: Without dead ends: 118 [2020-10-16 13:46:47,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:46:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-16 13:46:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-16 13:46:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-16 13:46:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-16 13:46:47,359 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-16 13:46:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:47,359 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-16 13:46:47,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-16 13:46:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:47,360 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:47,360 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:47,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:46:47,361 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1565096682, now seen corresponding path program 1 times [2020-10-16 13:46:47,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:47,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203107634] [2020-10-16 13:46:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:47,452 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 13:46:47,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203107634] [2020-10-16 13:46:47,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:47,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:47,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1047454744] [2020-10-16 13:46:47,454 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:47,455 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:47,457 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-16 13:46:47,458 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:47,525 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:47,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:47,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:47,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:47,527 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-16 13:46:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:47,563 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-16 13:46:47,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:46:47,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 13:46:47,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:47,565 INFO L225 Difference]: With dead ends: 104 [2020-10-16 13:46:47,565 INFO L226 Difference]: Without dead ends: 104 [2020-10-16 13:46:47,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-16 13:46:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-16 13:46:47,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-16 13:46:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-16 13:46:47,573 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-16 13:46:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:47,573 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-16 13:46:47,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-16 13:46:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:46:47,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:47,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:47,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:46:47,575 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:47,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046662, now seen corresponding path program 1 times [2020-10-16 13:46:47,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:47,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466177573] [2020-10-16 13:46:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:47,691 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 13:46:47,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466177573] [2020-10-16 13:46:47,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:47,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:47,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [389869990] [2020-10-16 13:46:47,693 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:47,694 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:47,695 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 13 transitions. [2020-10-16 13:46:47,696 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:47,703 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:46:47,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:47,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:47,704 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 5 states. [2020-10-16 13:46:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:47,752 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-16 13:46:47,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:46:47,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-16 13:46:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:47,756 INFO L225 Difference]: With dead ends: 102 [2020-10-16 13:46:47,756 INFO L226 Difference]: Without dead ends: 102 [2020-10-16 13:46:47,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:47,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-16 13:46:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-16 13:46:47,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-16 13:46:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-16 13:46:47,765 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-16 13:46:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:47,766 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-16 13:46:47,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-16 13:46:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:46:47,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:47,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:47,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:46:47,768 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1273416656, now seen corresponding path program 1 times [2020-10-16 13:46:47,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:47,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207900753] [2020-10-16 13:46:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:47,864 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 13:46:47,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207900753] [2020-10-16 13:46:47,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:47,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:46:47,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725049952] [2020-10-16 13:46:47,867 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:47,868 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:47,871 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 30 transitions. [2020-10-16 13:46:47,871 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:47,968 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2780#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-10-16 13:46:47,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:46:47,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:47,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:46:47,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:47,970 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 7 states. [2020-10-16 13:46:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:48,045 INFO L93 Difference]: Finished difference Result 107 states and 222 transitions. [2020-10-16 13:46:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:46:48,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-10-16 13:46:48,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:48,048 INFO L225 Difference]: With dead ends: 107 [2020-10-16 13:46:48,048 INFO L226 Difference]: Without dead ends: 107 [2020-10-16 13:46:48,049 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-16 13:46:48,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2020-10-16 13:46:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-16 13:46:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-16 13:46:48,055 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-16 13:46:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:48,055 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-16 13:46:48,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:46:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-16 13:46:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:46:48,057 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:48,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:48,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:46:48,057 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:48,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1066818889, now seen corresponding path program 1 times [2020-10-16 13:46:48,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:48,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811069109] [2020-10-16 13:46:48,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:48,176 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 13:46:48,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811069109] [2020-10-16 13:46:48,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:48,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:46:48,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2089728638] [2020-10-16 13:46:48,178 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:48,180 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:48,184 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 46 transitions. [2020-10-16 13:46:48,185 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:48,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,310 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3102#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-16 13:46:48,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:46:48,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:46:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:46:48,311 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 5 states. [2020-10-16 13:46:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:48,364 INFO L93 Difference]: Finished difference Result 69 states and 127 transitions. [2020-10-16 13:46:48,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 13:46:48,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 13:46:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:48,366 INFO L225 Difference]: With dead ends: 69 [2020-10-16 13:46:48,366 INFO L226 Difference]: Without dead ends: 34 [2020-10-16 13:46:48,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-16 13:46:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-16 13:46:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-16 13:46:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-16 13:46:48,369 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 11 [2020-10-16 13:46:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:48,369 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-16 13:46:48,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:46:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-16 13:46:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:46:48,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:48,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:48,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:46:48,371 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1949389069, now seen corresponding path program 1 times [2020-10-16 13:46:48,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:48,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689505804] [2020-10-16 13:46:48,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:46:48,600 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 13:46:48,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689505804] [2020-10-16 13:46:48,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:46:48,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:46:48,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519828] [2020-10-16 13:46:48,602 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:46:48,604 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:46:48,610 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 42 transitions. [2020-10-16 13:46:48,610 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:46:48,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-16 13:46:48,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,626 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-16 13:46:48,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:46:48,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:48,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,654 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:48,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:46:48,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:48,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:48,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:46:48,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:48,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:48,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:46:48,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:48,943 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-16 13:46:48,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,111 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,118 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,137 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:49,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,149 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:49,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-16 13:46:49,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:49,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,175 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:46:49,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,202 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,207 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-16 13:46:49,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,213 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,221 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,235 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,253 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,263 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,279 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,288 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-16 13:46:49,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,296 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:46:49,340 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:49,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,354 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:49,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:49,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:49,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:49,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:46:49,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-16 13:46:49,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:46:49,533 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3246#(and (not (= 2 ~y$w_buff0~0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-10-16 13:46:49,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:46:49,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:46:49,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:46:49,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:46:49,535 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 7 states. [2020-10-16 13:46:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:46:49,683 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-10-16 13:46:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:46:49,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-16 13:46:49,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:46:49,686 INFO L225 Difference]: With dead ends: 40 [2020-10-16 13:46:49,686 INFO L226 Difference]: Without dead ends: 24 [2020-10-16 13:46:49,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:46:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-16 13:46:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-16 13:46:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-16 13:46:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-16 13:46:49,693 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-10-16 13:46:49,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:46:49,697 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-16 13:46:49,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:46:49,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-16 13:46:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 13:46:49,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:46:49,699 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:46:49,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:46:49,699 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:46:49,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:46:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash -152137539, now seen corresponding path program 2 times [2020-10-16 13:46:49,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:46:49,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32446963] [2020-10-16 13:46:49,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:46:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:46:49,811 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:46:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:46:49,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:46:49,944 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:46:49,945 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:46:49,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:46:49,947 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:46:49,960 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L786-->L793: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In-494913030 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In-494913030 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-494913030 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-494913030 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-494913030 0)) (= ~y$r_buff1_thd0~0_In-494913030 ~y$r_buff1_thd0~0_Out-494913030) (or (and (= ~y$w_buff1_used~0_Out-494913030 ~y$w_buff1_used~0_In-494913030) .cse0) (and .cse1 (= ~y$w_buff1_used~0_Out-494913030 0) .cse2)) (or (and .cse3 .cse4 (= ~y$w_buff0~0_In-494913030 ~y~0_Out-494913030)) (and (or (and (= ~y~0_In-494913030 ~y~0_Out-494913030) .cse0) (and .cse1 (= ~y$w_buff1~0_In-494913030 ~y~0_Out-494913030) .cse2)) .cse5)) (= ~y$r_buff0_thd0~0_In-494913030 ~y$r_buff0_thd0~0_Out-494913030) (or (and (= ~y$w_buff0_used~0_Out-494913030 ~y$w_buff0_used~0_In-494913030) .cse5) (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out-494913030 0))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-494913030 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-494913030|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-494913030|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-494913030, ~y$w_buff1~0=~y$w_buff1~0_In-494913030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-494913030, ~y$w_buff0~0=~y$w_buff0~0_In-494913030, ~y~0=~y~0_In-494913030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-494913030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-494913030} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-494913030, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-494913030|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-494913030|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-494913030|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-494913030|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-494913030|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-494913030|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-494913030|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-494913030, ~y$w_buff1~0=~y$w_buff1~0_In-494913030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-494913030, ~y$w_buff0~0=~y$w_buff0~0_In-494913030, ~y~0=~y~0_Out-494913030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-494913030, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-494913030} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 13:46:49,967 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 13:46:49,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,974 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 13:46:49,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,975 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 13:46:49,975 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,975 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 13:46:49,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,976 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 13:46:49,976 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,977 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 13:46:49,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,977 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 13:46:49,977 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,978 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 13:46:49,978 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,978 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 13:46:49,979 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,980 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 13:46:49,980 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,981 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 13:46:49,981 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,981 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 13:46:49,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,982 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 13:46:49,982 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,985 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 13:46:49,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,986 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,987 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 13:46:49,987 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:49,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 13:46:49,999 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:46:50,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:46:50 BasicIcfg [2020-10-16 13:46:50,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:46:50,108 INFO L168 Benchmark]: Toolchain (without parser) took 14036.30 ms. Allocated memory was 138.4 MB in the beginning and 384.8 MB in the end (delta: 246.4 MB). Free memory was 99.8 MB in the beginning and 313.6 MB in the end (delta: -213.8 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:50,109 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.5 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-16 13:46:50,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.46 ms. Allocated memory was 138.4 MB in the beginning and 225.4 MB in the end (delta: 87.0 MB). Free memory was 99.4 MB in the beginning and 189.0 MB in the end (delta: -89.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:50,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.44 ms. Allocated memory is still 225.4 MB. Free memory was 189.0 MB in the beginning and 186.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:50,113 INFO L168 Benchmark]: Boogie Preprocessor took 36.51 ms. Allocated memory is still 225.4 MB. Free memory was 186.4 MB in the beginning and 183.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:50,115 INFO L168 Benchmark]: RCFGBuilder took 1963.93 ms. Allocated memory was 225.4 MB in the beginning and 253.2 MB in the end (delta: 27.8 MB). Free memory was 183.8 MB in the beginning and 119.8 MB in the end (delta: 63.9 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2020-10-16 13:46:50,117 INFO L168 Benchmark]: TraceAbstraction took 11176.24 ms. Allocated memory was 253.2 MB in the beginning and 384.8 MB in the end (delta: 131.6 MB). Free memory was 119.8 MB in the beginning and 313.6 MB in the end (delta: -193.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 13:46:50,129 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.0 MB in the beginning and 119.5 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.46 ms. Allocated memory was 138.4 MB in the beginning and 225.4 MB in the end (delta: 87.0 MB). Free memory was 99.4 MB in the beginning and 189.0 MB in the end (delta: -89.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.44 ms. Allocated memory is still 225.4 MB. Free memory was 189.0 MB in the beginning and 186.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.51 ms. Allocated memory is still 225.4 MB. Free memory was 186.4 MB in the beginning and 183.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1963.93 ms. Allocated memory was 225.4 MB in the beginning and 253.2 MB in the end (delta: 27.8 MB). Free memory was 183.8 MB in the beginning and 119.8 MB in the end (delta: 63.9 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11176.24 ms. Allocated memory was 253.2 MB in the beginning and 384.8 MB in the end (delta: 131.6 MB). Free memory was 119.8 MB in the beginning and 313.6 MB in the end (delta: -193.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 479 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 32 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.0s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2235 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L703] 0 int y = 0; [L704] 0 _Bool y$flush_delayed; [L705] 0 int y$mem_tmp; [L706] 0 _Bool y$r_buff0_thd0; [L707] 0 _Bool y$r_buff0_thd1; [L708] 0 _Bool y$r_buff0_thd2; [L709] 0 _Bool y$r_buff1_thd0; [L710] 0 _Bool y$r_buff1_thd1; [L711] 0 _Bool y$r_buff1_thd2; [L712] 0 _Bool y$read_delayed; [L713] 0 int *y$read_delayed_var; [L714] 0 int y$w_buff0; [L715] 0 _Bool y$w_buff0_used; [L716] 0 int y$w_buff1; [L717] 0 _Bool y$w_buff1_used; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2481; [L780] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 1 y$w_buff1 = y$w_buff0 [L724] 1 y$w_buff0 = 2 [L725] 1 y$w_buff1_used = y$w_buff0_used [L726] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L728] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 pthread_t t2482; [L782] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 y$flush_delayed = weak$$choice2 [L798] 0 y$mem_tmp = y [L799] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L800] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L807] 0 y = y$flush_delayed ? y$mem_tmp : y [L808] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 132 SDtfs, 91 SDslu, 164 SDs, 0 SdLazy, 168 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 7355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...