/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 21:52:16,732 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 21:52:16,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 21:52:16,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 21:52:16,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 21:52:16,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 21:52:16,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 21:52:16,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 21:52:16,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 21:52:16,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 21:52:16,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 21:52:16,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 21:52:16,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 21:52:16,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 21:52:16,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 21:52:16,816 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 21:52:16,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 21:52:16,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 21:52:16,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 21:52:16,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 21:52:16,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 21:52:16,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 21:52:16,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 21:52:16,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 21:52:16,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 21:52:16,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 21:52:16,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 21:52:16,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 21:52:16,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 21:52:16,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 21:52:16,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 21:52:16,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 21:52:16,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 21:52:16,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 21:52:16,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 21:52:16,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 21:52:16,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 21:52:16,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 21:52:16,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 21:52:16,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 21:52:16,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 21:52:16,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 21:52:16,901 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 21:52:16,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 21:52:16,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 21:52:16,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 21:52:16,903 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 21:52:16,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 21:52:16,904 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 21:52:16,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 21:52:16,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 21:52:16,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 21:52:16,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 21:52:16,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 21:52:16,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 21:52:16,906 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 21:52:16,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 21:52:16,907 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 21:52:16,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 21:52:16,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 21:52:16,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 21:52:16,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 21:52:16,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 21:52:16,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:52:16,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 21:52:16,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 21:52:16,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 21:52:16,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 21:52:16,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 21:52:16,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 21:52:16,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 21:52:17,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 21:52:17,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 21:52:17,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 21:52:17,222 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 21:52:17,222 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 21:52:17,223 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2020-10-15 21:52:17,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce6b31f3/46e08524845541c4a7138cbfd6affd39/FLAG26775a6f9 [2020-10-15 21:52:17,788 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 21:52:17,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2020-10-15 21:52:17,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce6b31f3/46e08524845541c4a7138cbfd6affd39/FLAG26775a6f9 [2020-10-15 21:52:18,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce6b31f3/46e08524845541c4a7138cbfd6affd39 [2020-10-15 21:52:18,137 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 21:52:18,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 21:52:18,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 21:52:18,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 21:52:18,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 21:52:18,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:18,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e3f8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18, skipping insertion in model container [2020-10-15 21:52:18,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:18,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 21:52:18,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 21:52:18,813 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:52:18,825 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 21:52:18,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:52:18,955 INFO L208 MainTranslator]: Completed translation [2020-10-15 21:52:18,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18 WrapperNode [2020-10-15 21:52:18,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 21:52:18,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 21:52:18,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 21:52:18,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 21:52:18,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:18,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 21:52:19,017 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 21:52:19,017 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 21:52:19,017 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 21:52:19,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... [2020-10-15 21:52:19,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 21:52:19,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 21:52:19,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 21:52:19,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 21:52:19,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:52:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 21:52:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 21:52:19,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 21:52:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 21:52:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 21:52:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 21:52:19,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 21:52:19,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 21:52:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 21:52:19,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 21:52:19,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 21:52:19,124 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 21:52:21,109 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 21:52:21,110 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 21:52:21,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:52:21 BoogieIcfgContainer [2020-10-15 21:52:21,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 21:52:21,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 21:52:21,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 21:52:21,116 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 21:52:21,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:52:18" (1/3) ... [2020-10-15 21:52:21,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186dd34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:52:21, skipping insertion in model container [2020-10-15 21:52:21,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:52:18" (2/3) ... [2020-10-15 21:52:21,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186dd34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:52:21, skipping insertion in model container [2020-10-15 21:52:21,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:52:21" (3/3) ... [2020-10-15 21:52:21,120 INFO L111 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2020-10-15 21:52:21,131 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 21:52:21,131 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 21:52:21,139 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 21:52:21,139 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 21:52:21,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,173 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,187 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,188 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,188 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,189 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,189 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,198 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:52:21,218 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-15 21:52:21,239 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 21:52:21,240 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 21:52:21,240 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 21:52:21,240 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 21:52:21,240 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 21:52:21,240 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 21:52:21,240 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 21:52:21,240 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 21:52:21,254 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 21:52:21,256 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 164 flow [2020-10-15 21:52:21,259 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 164 flow [2020-10-15 21:52:21,261 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 164 flow [2020-10-15 21:52:21,302 INFO L129 PetriNetUnfolder]: 2/75 cut-off events. [2020-10-15 21:52:21,302 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 21:52:21,307 INFO L80 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 75 events. 2/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-15 21:52:21,309 INFO L117 LiptonReduction]: Number of co-enabled transitions 960 [2020-10-15 21:52:21,598 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-10-15 21:52:21,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:21,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:52:21,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:52:21,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:21,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:21,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:21,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:21,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:21,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:21,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:21,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:21,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:21,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:52:21,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:21,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:21,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:21,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:21,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:22,314 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 21:52:22,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:22,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:22,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:22,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:22,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:22,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:22,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:52:22,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:22,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:22,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:22,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:22,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:22,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:22,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:52:22,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:52:22,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:22,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:22,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:22,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:22,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:22,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,072 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 21:52:23,174 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 21:52:23,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:52:23,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:23,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:23,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:23,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:52:23,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:52:23,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:52:23,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:23,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:52:23,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:52:23,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:23,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:23,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:23,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:52:23,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:52:23,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:52:23,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:23,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:23,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:23,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:24,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:24,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:24,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:24,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:24,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:24,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:24,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:24,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:24,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:52:24,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:52:24,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:52:24,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:24,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:52:24,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:52:24,724 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2020-10-15 21:52:24,834 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-15 21:52:24,842 INFO L132 LiptonReduction]: Checked pairs total: 2674 [2020-10-15 21:52:24,842 INFO L134 LiptonReduction]: Total number of compositions: 65 [2020-10-15 21:52:24,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-15 21:52:24,870 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 230 states. [2020-10-15 21:52:24,873 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-10-15 21:52:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 21:52:24,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:24,880 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 21:52:24,880 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:24,886 INFO L82 PathProgramCache]: Analyzing trace with hash 901496, now seen corresponding path program 1 times [2020-10-15 21:52:24,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:24,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629737707] [2020-10-15 21:52:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:52:25,102 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-15 21:52:25,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629737707] [2020-10-15 21:52:25,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:52:25,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:52:25,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091271049] [2020-10-15 21:52:25,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:52:25,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:52:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:52:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:52:25,128 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 3 states. [2020-10-15 21:52:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:52:25,198 INFO L93 Difference]: Finished difference Result 192 states and 464 transitions. [2020-10-15 21:52:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:52:25,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 21:52:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:52:25,214 INFO L225 Difference]: With dead ends: 192 [2020-10-15 21:52:25,214 INFO L226 Difference]: Without dead ends: 162 [2020-10-15 21:52:25,216 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-15 21:52:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-15 21:52:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-15 21:52:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-15 21:52:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2020-10-15 21:52:25,279 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 3 [2020-10-15 21:52:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:52:25,279 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2020-10-15 21:52:25,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:52:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2020-10-15 21:52:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-15 21:52:25,281 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:25,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:52:25,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 21:52:25,281 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1964444595, now seen corresponding path program 1 times [2020-10-15 21:52:25,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:25,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017685614] [2020-10-15 21:52:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:52:25,445 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-15 21:52:25,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017685614] [2020-10-15 21:52:25,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:52:25,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 21:52:25,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552776577] [2020-10-15 21:52:25,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:52:25,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:52:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:52:25,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:52:25,449 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states. [2020-10-15 21:52:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:52:25,477 INFO L93 Difference]: Finished difference Result 172 states and 388 transitions. [2020-10-15 21:52:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:52:25,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-15 21:52:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:52:25,480 INFO L225 Difference]: With dead ends: 172 [2020-10-15 21:52:25,480 INFO L226 Difference]: Without dead ends: 142 [2020-10-15 21:52:25,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:52:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-15 21:52:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-15 21:52:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-15 21:52:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2020-10-15 21:52:25,494 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 8 [2020-10-15 21:52:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:52:25,494 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2020-10-15 21:52:25,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:52:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2020-10-15 21:52:25,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 21:52:25,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:25,496 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:52:25,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 21:52:25,496 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1954172630, now seen corresponding path program 1 times [2020-10-15 21:52:25,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:25,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821425162] [2020-10-15 21:52:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:52:25,599 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-15 21:52:25,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821425162] [2020-10-15 21:52:25,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:52:25,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:52:25,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981861034] [2020-10-15 21:52:25,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:52:25,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:52:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:52:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:52:25,602 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 4 states. [2020-10-15 21:52:25,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:52:25,637 INFO L93 Difference]: Finished difference Result 108 states and 206 transitions. [2020-10-15 21:52:25,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:52:25,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-15 21:52:25,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:52:25,639 INFO L225 Difference]: With dead ends: 108 [2020-10-15 21:52:25,639 INFO L226 Difference]: Without dead ends: 78 [2020-10-15 21:52:25,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:52:25,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-15 21:52:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-15 21:52:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-15 21:52:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 137 transitions. [2020-10-15 21:52:25,646 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 137 transitions. Word has length 10 [2020-10-15 21:52:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:52:25,647 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 137 transitions. [2020-10-15 21:52:25,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:52:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2020-10-15 21:52:25,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 21:52:25,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:25,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:52:25,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 21:52:25,649 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:25,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:25,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1222210668, now seen corresponding path program 1 times [2020-10-15 21:52:25,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:25,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90279270] [2020-10-15 21:52:25,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:52:25,786 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-15 21:52:25,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90279270] [2020-10-15 21:52:25,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:52:25,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:52:25,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112548299] [2020-10-15 21:52:25,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:52:25,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:52:25,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:52:25,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:52:25,789 INFO L87 Difference]: Start difference. First operand 78 states and 137 transitions. Second operand 5 states. [2020-10-15 21:52:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:52:25,824 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2020-10-15 21:52:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:52:25,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 21:52:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:52:25,825 INFO L225 Difference]: With dead ends: 56 [2020-10-15 21:52:25,825 INFO L226 Difference]: Without dead ends: 46 [2020-10-15 21:52:25,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:52:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-15 21:52:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-15 21:52:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-15 21:52:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-10-15 21:52:25,830 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 13 [2020-10-15 21:52:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:52:25,830 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2020-10-15 21:52:25,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:52:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2020-10-15 21:52:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:52:25,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:25,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:52:25,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 21:52:25,831 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:25,832 INFO L82 PathProgramCache]: Analyzing trace with hash 50213709, now seen corresponding path program 1 times [2020-10-15 21:52:25,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:25,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33778726] [2020-10-15 21:52:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:52:26,033 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-15 21:52:26,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33778726] [2020-10-15 21:52:26,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:52:26,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:52:26,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346746984] [2020-10-15 21:52:26,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:52:26,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:52:26,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:52:26,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:52:26,036 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 4 states. [2020-10-15 21:52:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:52:26,070 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2020-10-15 21:52:26,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:52:26,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 21:52:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:52:26,071 INFO L225 Difference]: With dead ends: 64 [2020-10-15 21:52:26,071 INFO L226 Difference]: Without dead ends: 36 [2020-10-15 21:52:26,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:52:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-15 21:52:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-15 21:52:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-15 21:52:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-10-15 21:52:26,076 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17 [2020-10-15 21:52:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:52:26,076 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-10-15 21:52:26,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:52:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-10-15 21:52:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:52:26,079 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:26,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:52:26,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 21:52:26,080 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:26,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash -890445537, now seen corresponding path program 2 times [2020-10-15 21:52:26,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:26,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333726729] [2020-10-15 21:52:26,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:52:26,307 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-15 21:52:26,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333726729] [2020-10-15 21:52:26,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:52:26,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:52:26,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150119024] [2020-10-15 21:52:26,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:52:26,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:52:26,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:52:26,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:52:26,310 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 7 states. [2020-10-15 21:52:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:52:26,439 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2020-10-15 21:52:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 21:52:26,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 21:52:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:52:26,440 INFO L225 Difference]: With dead ends: 45 [2020-10-15 21:52:26,440 INFO L226 Difference]: Without dead ends: 26 [2020-10-15 21:52:26,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-15 21:52:26,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-15 21:52:26,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-15 21:52:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-15 21:52:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-10-15 21:52:26,443 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2020-10-15 21:52:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:52:26,443 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-15 21:52:26,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:52:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-10-15 21:52:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:52:26,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:52:26,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:52:26,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 21:52:26,445 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:52:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:52:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1952809263, now seen corresponding path program 3 times [2020-10-15 21:52:26,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:52:26,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670700599] [2020-10-15 21:52:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:52:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:52:26,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:52:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:52:26,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:52:26,565 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 21:52:26,565 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 21:52:26,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 21:52:26,584 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-15 21:52:26,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,590 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-15 21:52:26,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,591 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-15 21:52:26,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,591 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-15 21:52:26,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,592 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-15 21:52:26,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,593 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-15 21:52:26,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,593 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-15 21:52:26,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,594 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-15 21:52:26,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,594 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-15 21:52:26,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,594 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-15 21:52:26,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,595 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-15 21:52:26,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,595 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-15 21:52:26,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,596 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-15 21:52:26,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,597 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-15 21:52:26,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,597 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-15 21:52:26,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,597 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-15 21:52:26,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,598 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-15 21:52:26,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,598 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-15 21:52:26,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,604 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-15 21:52:26,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,605 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-15 21:52:26,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,605 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-15 21:52:26,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,605 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-15 21:52:26,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,607 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-15 21:52:26,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,608 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-15 21:52:26,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,608 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-15 21:52:26,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,609 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-15 21:52:26,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,609 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-15 21:52:26,609 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:52:26,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:52:26 BasicIcfg [2020-10-15 21:52:26,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 21:52:26,698 INFO L168 Benchmark]: Toolchain (without parser) took 8559.83 ms. Allocated memory was 252.2 MB in the beginning and 483.9 MB in the end (delta: 231.7 MB). Free memory was 206.5 MB in the beginning and 330.0 MB in the end (delta: -123.5 MB). Peak memory consumption was 108.2 MB. Max. memory is 14.2 GB. [2020-10-15 21:52:26,699 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 21:52:26,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.47 ms. Allocated memory was 252.2 MB in the beginning and 320.9 MB in the end (delta: 68.7 MB). Free memory was 206.5 MB in the beginning and 269.2 MB in the end (delta: -62.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. [2020-10-15 21:52:26,701 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.54 ms. Allocated memory is still 320.9 MB. Free memory was 269.2 MB in the beginning and 266.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:52:26,701 INFO L168 Benchmark]: Boogie Preprocessor took 42.19 ms. Allocated memory is still 320.9 MB. Free memory was 266.7 MB in the beginning and 264.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:52:26,702 INFO L168 Benchmark]: RCFGBuilder took 2052.93 ms. Allocated memory was 320.9 MB in the beginning and 359.1 MB in the end (delta: 38.3 MB). Free memory was 264.2 MB in the beginning and 212.8 MB in the end (delta: 51.4 MB). Peak memory consumption was 97.1 MB. Max. memory is 14.2 GB. [2020-10-15 21:52:26,706 INFO L168 Benchmark]: TraceAbstraction took 5583.25 ms. Allocated memory was 359.1 MB in the beginning and 483.9 MB in the end (delta: 124.8 MB). Free memory was 212.8 MB in the beginning and 330.0 MB in the end (delta: -117.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 14.2 GB. [2020-10-15 21:52:26,715 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 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 816.47 ms. Allocated memory was 252.2 MB in the beginning and 320.9 MB in the end (delta: 68.7 MB). Free memory was 206.5 MB in the beginning and 269.2 MB in the end (delta: -62.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 59.54 ms. Allocated memory is still 320.9 MB. Free memory was 269.2 MB in the beginning and 266.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 42.19 ms. Allocated memory is still 320.9 MB. Free memory was 266.7 MB in the beginning and 264.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2052.93 ms. Allocated memory was 320.9 MB in the beginning and 359.1 MB in the end (delta: 38.3 MB). Free memory was 264.2 MB in the beginning and 212.8 MB in the end (delta: 51.4 MB). Peak memory consumption was 97.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5583.25 ms. Allocated memory was 359.1 MB in the beginning and 483.9 MB in the end (delta: 124.8 MB). Free memory was 212.8 MB in the beginning and 330.0 MB in the end (delta: -117.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 588 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.5s, 82 PlacesBefore, 28 PlacesAfterwards, 77 TransitionsBefore, 22 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 2674 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; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L707] 0 int y = 0; [L708] 0 _Bool y$flush_delayed; [L709] 0 int y$mem_tmp; [L710] 0 _Bool y$r_buff0_thd0; [L711] 0 _Bool y$r_buff0_thd1; [L712] 0 _Bool y$r_buff0_thd2; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$read_delayed; [L717] 0 int *y$read_delayed_var; [L718] 0 int y$w_buff0; [L719] 0 _Bool y$w_buff0_used; [L720] 0 int y$w_buff1; [L721] 0 _Bool y$w_buff1_used; [L722] 0 _Bool weak$$choice0; [L723] 0 _Bool weak$$choice2; [L799] 0 pthread_t t595; [L800] FCALL, FORK 0 pthread_create(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L727] 1 y$w_buff1 = y$w_buff0 [L728] 1 y$w_buff0 = 1 [L729] 1 y$w_buff1_used = y$w_buff0_used [L730] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 pthread_t t596; [L802] FCALL, FORK 0 pthread_create(&t596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y [L773] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 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) [L741] 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) [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] 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 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 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 [L777] 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) [L777] 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) [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 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 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L781] 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 [L748] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L750] 1 return 0; [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=255, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.3s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 122 SDtfs, 107 SDslu, 200 SDs, 0 SdLazy, 95 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 3528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...