/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 16:44:10,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 16:44:10,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 16:44:11,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 16:44:11,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 16:44:11,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 16:44:11,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 16:44:11,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 16:44:11,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 16:44:11,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 16:44:11,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 16:44:11,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 16:44:11,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 16:44:11,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 16:44:11,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 16:44:11,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 16:44:11,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 16:44:11,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 16:44:11,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 16:44:11,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 16:44:11,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 16:44:11,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 16:44:11,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 16:44:11,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 16:44:11,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 16:44:11,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 16:44:11,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 16:44:11,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 16:44:11,092 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 16:44:11,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 16:44:11,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 16:44:11,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 16:44:11,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 16:44:11,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 16:44:11,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 16:44:11,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 16:44:11,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 16:44:11,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 16:44:11,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 16:44:11,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 16:44:11,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 16:44:11,113 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 16:44:11,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 16:44:11,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 16:44:11,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 16:44:11,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 16:44:11,172 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 16:44:11,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 16:44:11,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 16:44:11,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 16:44:11,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 16:44:11,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 16:44:11,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 16:44:11,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 16:44:11,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 16:44:11,174 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 16:44:11,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 16:44:11,174 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 16:44:11,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 16:44:11,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 16:44:11,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 16:44:11,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 16:44:11,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 16:44:11,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 16:44:11,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 16:44:11,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 16:44:11,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 16:44:11,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 16:44:11,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 16:44:11,177 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 16:44:11,177 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 16:44:11,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 16:44:11,178 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 16:44:11,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 16:44:11,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 16:44:11,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 16:44:11,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 16:44:11,605 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 16:44:11,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2020-11-09 16:44:11,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2437d1b/1d9f3774d8724910bd7a7d87a4ff6282/FLAGee36986d6 [2020-11-09 16:44:12,494 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 16:44:12,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt.i [2020-11-09 16:44:12,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2437d1b/1d9f3774d8724910bd7a7d87a4ff6282/FLAGee36986d6 [2020-11-09 16:44:12,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2437d1b/1d9f3774d8724910bd7a7d87a4ff6282 [2020-11-09 16:44:12,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 16:44:12,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 16:44:12,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 16:44:12,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 16:44:12,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 16:44:12,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:12" (1/1) ... [2020-11-09 16:44:12,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50333eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:12, skipping insertion in model container [2020-11-09 16:44:12,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:44:12" (1/1) ... [2020-11-09 16:44:12,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 16:44:12,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 16:44:13,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:44:13,493 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 16:44:13,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 16:44:13,812 INFO L208 MainTranslator]: Completed translation [2020-11-09 16:44:13,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13 WrapperNode [2020-11-09 16:44:13,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 16:44:13,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 16:44:13,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 16:44:13,819 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 16:44:13,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:13,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:13,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 16:44:13,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 16:44:13,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 16:44:13,964 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 16:44:13,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:13,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:13,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:13,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:13,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:14,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:14,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (1/1) ... [2020-11-09 16:44:14,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 16:44:14,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 16:44:14,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 16:44:14,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 16:44:14,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (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-11-09 16:44:14,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 16:44:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 16:44:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 16:44:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 16:44:14,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 16:44:14,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 16:44:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 16:44:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 16:44:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 16:44:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 16:44:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 16:44:14,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 16:44:14,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 16:44:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 16:44:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 16:44:14,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 16:44:14,126 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 16:44:16,700 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 16:44:16,700 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 16:44:16,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:16 BoogieIcfgContainer [2020-11-09 16:44:16,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 16:44:16,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 16:44:16,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 16:44:16,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 16:44:16,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:44:12" (1/3) ... [2020-11-09 16:44:16,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715fbb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:16, skipping insertion in model container [2020-11-09 16:44:16,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:44:13" (2/3) ... [2020-11-09 16:44:16,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715fbb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:44:16, skipping insertion in model container [2020-11-09 16:44:16,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:44:16" (3/3) ... [2020-11-09 16:44:16,713 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_power.opt.i [2020-11-09 16:44:16,738 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 16:44:16,738 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 16:44:16,743 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 16:44:16,745 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 16:44:16,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,786 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,786 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,786 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,787 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,787 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,787 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,788 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,789 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,789 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,790 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,790 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,791 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,795 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,795 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,798 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,800 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,801 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,805 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,805 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,806 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,806 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,806 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,807 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,808 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,809 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,810 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,816 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,819 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,821 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,825 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,826 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 16:44:16,828 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 16:44:16,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 16:44:16,870 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 16:44:16,870 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 16:44:16,870 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 16:44:16,870 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 16:44:16,870 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 16:44:16,871 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 16:44:16,871 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 16:44:16,871 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 16:44:16,886 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 16:44:16,887 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-09 16:44:16,890 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-09 16:44:16,893 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-09 16:44:16,986 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-09 16:44:16,988 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 16:44:16,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 16:44:17,004 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-11-09 16:44:17,511 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 16:44:17,639 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 16:44:17,820 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 16:44:19,810 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 16:44:19,951 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 16:44:20,568 WARN L194 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-11-09 16:44:20,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 16:44:20,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:21,104 WARN L194 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 16:44:22,301 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-09 16:44:23,716 WARN L194 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-11-09 16:44:23,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-09 16:44:23,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:23,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 16:44:23,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:25,292 WARN L194 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 150 DAG size of output: 130 [2020-11-09 16:44:27,843 WARN L194 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2020-11-09 16:44:27,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 16:44:27,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:44:27,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:27,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:44:27,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:27,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:44:27,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:44:27,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:44:27,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:27,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:27,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:27,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:27,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:27,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:32,493 WARN L194 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 367 DAG size of output: 269 [2020-11-09 16:44:33,956 WARN L194 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2020-11-09 16:44:34,409 WARN L194 SmtUtils]: Spent 449.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-09 16:44:39,343 WARN L194 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 269 DAG size of output: 258 [2020-11-09 16:44:40,895 WARN L194 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 254 [2020-11-09 16:44:43,134 WARN L194 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 233 DAG size of output: 192 [2020-11-09 16:44:43,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-09 16:44:43,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:43,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 16:44:43,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:44,567 WARN L194 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 150 DAG size of output: 110 [2020-11-09 16:44:47,487 WARN L194 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 317 DAG size of output: 273 [2020-11-09 16:44:47,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 16:44:47,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 16:44:47,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:47,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:47,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:47,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 16:44:47,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:47,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,530 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-11-09 16:44:47,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:44:47,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:47,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:47,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:47,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:47,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 16:44:47,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 16:44:47,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 16:44:47,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:47,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 16:44:47,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 16:44:52,079 WARN L194 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 373 DAG size of output: 250 [2020-11-09 16:44:52,481 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 16:44:53,424 WARN L194 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 16:44:53,901 WARN L194 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 16:44:56,506 WARN L194 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 233 DAG size of output: 232 [2020-11-09 16:44:57,846 WARN L194 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 232 [2020-11-09 16:44:58,728 WARN L194 SmtUtils]: Spent 868.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-11-09 16:44:59,563 WARN L194 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-11-09 16:45:04,763 WARN L194 SmtUtils]: Spent 5.20 s on a formula simplification. DAG size of input: 260 DAG size of output: 259 [2020-11-09 16:45:07,609 WARN L194 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 257 [2020-11-09 16:45:07,758 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-09 16:45:07,898 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-09 16:45:08,045 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-09 16:45:08,181 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-09 16:45:08,331 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:45:08,477 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:45:08,634 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:45:08,789 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 16:45:09,702 WARN L194 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-09 16:45:10,124 WARN L194 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-09 16:45:10,983 WARN L194 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-09 16:45:11,372 WARN L194 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-09 16:45:11,411 INFO L131 LiptonReduction]: Checked pairs total: 8003 [2020-11-09 16:45:11,411 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-09 16:45:11,419 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-11-09 16:45:11,787 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-09 16:45:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-09 16:45:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 16:45:11,797 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:11,798 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:11,799 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -862025444, now seen corresponding path program 1 times [2020-11-09 16:45:11,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:11,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019107554] [2020-11-09 16:45:11,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:12,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019107554] [2020-11-09 16:45:12,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:12,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:12,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038277343] [2020-11-09 16:45:12,244 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:12,247 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:12,261 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 16:45:12,262 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:12,267 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:12,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:12,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:12,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:12,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:12,286 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-09 16:45:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:12,458 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-09 16:45:12,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:12,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 16:45:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:12,514 INFO L225 Difference]: With dead ends: 3250 [2020-11-09 16:45:12,514 INFO L226 Difference]: Without dead ends: 2650 [2020-11-09 16:45:12,515 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-11-09 16:45:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-09 16:45:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-11-09 16:45:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-11-09 16:45:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-11-09 16:45:12,758 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-11-09 16:45:12,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:12,759 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-11-09 16:45:12,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:12,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-11-09 16:45:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 16:45:12,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:12,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:12,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 16:45:12,766 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:12,770 INFO L82 PathProgramCache]: Analyzing trace with hash -556615316, now seen corresponding path program 1 times [2020-11-09 16:45:12,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:12,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721881912] [2020-11-09 16:45:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:12,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721881912] [2020-11-09 16:45:12,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:12,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:12,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1005677341] [2020-11-09 16:45:12,961 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:12,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:12,966 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 16:45:12,966 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:12,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:12,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:12,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:12,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:12,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:12,969 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-11-09 16:45:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:13,107 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-11-09 16:45:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:13,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 16:45:13,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:13,142 INFO L225 Difference]: With dead ends: 2610 [2020-11-09 16:45:13,142 INFO L226 Difference]: Without dead ends: 2610 [2020-11-09 16:45:13,143 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-11-09 16:45:13,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-11-09 16:45:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-11-09 16:45:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-11-09 16:45:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-11-09 16:45:13,294 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-11-09 16:45:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:13,294 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-11-09 16:45:13,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-11-09 16:45:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 16:45:13,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:13,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:13,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 16:45:13,303 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:13,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1701594841, now seen corresponding path program 1 times [2020-11-09 16:45:13,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:13,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049216995] [2020-11-09 16:45:13,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:13,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049216995] [2020-11-09 16:45:13,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:13,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 16:45:13,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [973108296] [2020-11-09 16:45:13,450 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:13,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:13,456 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 18 transitions. [2020-11-09 16:45:13,456 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:13,573 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:13,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 16:45:13,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:13,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 16:45:13,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 16:45:13,575 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states. [2020-11-09 16:45:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:13,620 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-11-09 16:45:13,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 16:45:13,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 16:45:13,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:13,652 INFO L225 Difference]: With dead ends: 2450 [2020-11-09 16:45:13,653 INFO L226 Difference]: Without dead ends: 2450 [2020-11-09 16:45:13,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-09 16:45:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-11-09 16:45:13,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-11-09 16:45:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-11-09 16:45:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-11-09 16:45:13,771 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 12 [2020-11-09 16:45:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:13,771 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-11-09 16:45:13,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 16:45:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-11-09 16:45:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 16:45:13,774 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:13,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:13,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 16:45:13,775 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1963552941, now seen corresponding path program 1 times [2020-11-09 16:45:13,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:13,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326554406] [2020-11-09 16:45:13,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:14,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326554406] [2020-11-09 16:45:14,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:14,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 16:45:14,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [636103566] [2020-11-09 16:45:14,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:14,010 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:14,015 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-11-09 16:45:14,015 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:14,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:14,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:14,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:14,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:14,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,214 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:14,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:45:14,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:45:14,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:45:14,216 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 4 states. [2020-11-09 16:45:14,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:14,380 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-11-09 16:45:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:14,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 16:45:14,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:14,408 INFO L225 Difference]: With dead ends: 2418 [2020-11-09 16:45:14,409 INFO L226 Difference]: Without dead ends: 2418 [2020-11-09 16:45:14,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:45:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-11-09 16:45:14,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-11-09 16:45:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-11-09 16:45:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-11-09 16:45:14,523 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 13 [2020-11-09 16:45:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:14,523 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-11-09 16:45:14,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:45:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-11-09 16:45:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 16:45:14,527 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:14,527 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:14,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 16:45:14,528 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1149857192, now seen corresponding path program 1 times [2020-11-09 16:45:14,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:14,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167808584] [2020-11-09 16:45:14,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:14,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167808584] [2020-11-09 16:45:14,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:14,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:14,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1791415194] [2020-11-09 16:45:14,814 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:14,816 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:14,823 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 38 transitions. [2020-11-09 16:45:14,823 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:14,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:45:14,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:45:14,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:45:14,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:45:14,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 16:45:14,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:14,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 16:45:14,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:15,315 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2020-11-09 16:45:15,368 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [38915#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 38916#(and (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= ~y$r_buff0_thd0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))))] [2020-11-09 16:45:15,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:45:15,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:15,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:45:15,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:45:15,371 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 7 states. [2020-11-09 16:45:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:15,798 INFO L93 Difference]: Finished difference Result 3058 states and 11694 transitions. [2020-11-09 16:45:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 16:45:15,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-09 16:45:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:15,857 INFO L225 Difference]: With dead ends: 3058 [2020-11-09 16:45:15,857 INFO L226 Difference]: Without dead ends: 3058 [2020-11-09 16:45:15,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:45:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-11-09 16:45:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2482. [2020-11-09 16:45:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-11-09 16:45:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9438 transitions. [2020-11-09 16:45:16,012 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9438 transitions. Word has length 14 [2020-11-09 16:45:16,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:16,012 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9438 transitions. [2020-11-09 16:45:16,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:45:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9438 transitions. [2020-11-09 16:45:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 16:45:16,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:16,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:16,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 16:45:16,018 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:16,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1925737492, now seen corresponding path program 1 times [2020-11-09 16:45:16,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:16,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068173516] [2020-11-09 16:45:16,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:16,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068173516] [2020-11-09 16:45:16,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:16,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:16,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179779582] [2020-11-09 16:45:16,341 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:16,345 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:16,353 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 63 transitions. [2020-11-09 16:45:16,353 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:16,357 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:16,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:16,358 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:16,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:16,563 WARN L194 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 11 [2020-11-09 16:45:16,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:16,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:16,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:16,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:16,853 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [46948#(and (= ~y$w_buff0~0 0) (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0)) (= ~y$w_buff1~0 ~y$w_buff0~0)), 46949#(and (= ~y$w_buff0~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0))] [2020-11-09 16:45:16,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:45:16,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:16,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:45:16,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:45:16,855 INFO L87 Difference]: Start difference. First operand 2482 states and 9438 transitions. Second operand 7 states. [2020-11-09 16:45:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:17,126 INFO L93 Difference]: Finished difference Result 2474 states and 9392 transitions. [2020-11-09 16:45:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:17,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 16:45:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:17,147 INFO L225 Difference]: With dead ends: 2474 [2020-11-09 16:45:17,147 INFO L226 Difference]: Without dead ends: 2474 [2020-11-09 16:45:17,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:45:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2020-11-09 16:45:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2434. [2020-11-09 16:45:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-11-09 16:45:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 9238 transitions. [2020-11-09 16:45:17,299 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 9238 transitions. Word has length 15 [2020-11-09 16:45:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:17,299 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 9238 transitions. [2020-11-09 16:45:17,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:45:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 9238 transitions. [2020-11-09 16:45:17,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:45:17,305 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:17,305 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:17,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 16:45:17,306 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:17,306 INFO L82 PathProgramCache]: Analyzing trace with hash -180435593, now seen corresponding path program 1 times [2020-11-09 16:45:17,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:17,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140073629] [2020-11-09 16:45:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:17,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:17,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140073629] [2020-11-09 16:45:17,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:17,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:45:17,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276067144] [2020-11-09 16:45:17,670 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:17,673 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:17,685 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 130 transitions. [2020-11-09 16:45:17,685 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:17,704 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:45:17,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:17,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:45:17,716 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:17,717 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:45:17,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:17,885 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:45:17,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:17,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 16:45:17,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:17,893 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-11-09 16:45:17,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:18,910 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [54304#(and (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= ~y$r_buff0_thd0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 54300#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (not (= 2 ~y~0)))), 54301#(and (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0)), 54302#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0))), 54303#(and (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= ~y$r_buff0_thd0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (not (= 2 ~y~0))))] [2020-11-09 16:45:18,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 16:45:18,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 16:45:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-09 16:45:18,912 INFO L87 Difference]: Start difference. First operand 2434 states and 9238 transitions. Second operand 11 states. [2020-11-09 16:45:19,042 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 11 [2020-11-09 16:45:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:19,674 INFO L93 Difference]: Finished difference Result 3274 states and 12376 transitions. [2020-11-09 16:45:19,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:45:19,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 16:45:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:19,700 INFO L225 Difference]: With dead ends: 3274 [2020-11-09 16:45:19,701 INFO L226 Difference]: Without dead ends: 3274 [2020-11-09 16:45:19,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-09 16:45:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2020-11-09 16:45:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2714. [2020-11-09 16:45:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2020-11-09 16:45:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 10292 transitions. [2020-11-09 16:45:19,817 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 10292 transitions. Word has length 16 [2020-11-09 16:45:19,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:19,818 INFO L481 AbstractCegarLoop]: Abstraction has 2714 states and 10292 transitions. [2020-11-09 16:45:19,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 16:45:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 10292 transitions. [2020-11-09 16:45:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:45:19,822 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:19,823 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:19,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 16:45:19,823 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:19,823 INFO L82 PathProgramCache]: Analyzing trace with hash 431441233, now seen corresponding path program 2 times [2020-11-09 16:45:19,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:19,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126607528] [2020-11-09 16:45:19,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:20,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126607528] [2020-11-09 16:45:20,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:20,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 16:45:20,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [709183129] [2020-11-09 16:45:20,206 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:20,209 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:20,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 68 transitions. [2020-11-09 16:45:20,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:20,316 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:20,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:20,316 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:20,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:20,677 WARN L194 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2020-11-09 16:45:20,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 16:45:20,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:20,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:20,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:21,032 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [63021#(and (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0))), 63022#(and (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$w_buff1_used~0 256) 0))) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (or (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (or (= ~y~0 1) (= ~y~0 ~y$w_buff0~0) (not (= (mod ~y$r_buff1_thd0~0 256) 0)))), 63023#(and (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (or (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= (mod ~y$r_buff1_thd0~0 256) 0)))] [2020-11-09 16:45:21,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 16:45:21,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 16:45:21,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:45:21,034 INFO L87 Difference]: Start difference. First operand 2714 states and 10292 transitions. Second operand 9 states. [2020-11-09 16:45:21,218 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-11-09 16:45:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:21,762 INFO L93 Difference]: Finished difference Result 3026 states and 11474 transitions. [2020-11-09 16:45:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:45:21,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 16:45:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:21,781 INFO L225 Difference]: With dead ends: 3026 [2020-11-09 16:45:21,782 INFO L226 Difference]: Without dead ends: 3026 [2020-11-09 16:45:21,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2020-11-09 16:45:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2020-11-09 16:45:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2850. [2020-11-09 16:45:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2020-11-09 16:45:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 10798 transitions. [2020-11-09 16:45:21,896 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 10798 transitions. Word has length 16 [2020-11-09 16:45:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:21,897 INFO L481 AbstractCegarLoop]: Abstraction has 2850 states and 10798 transitions. [2020-11-09 16:45:21,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 16:45:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 10798 transitions. [2020-11-09 16:45:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 16:45:21,902 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:21,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:21,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 16:45:21,902 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash 869336839, now seen corresponding path program 1 times [2020-11-09 16:45:21,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:21,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928964761] [2020-11-09 16:45:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:22,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928964761] [2020-11-09 16:45:22,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:22,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:22,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840460650] [2020-11-09 16:45:22,039 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:22,042 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:22,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2020-11-09 16:45:22,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:22,103 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:22,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,182 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,295 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,295 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,296 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,330 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:22,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,331 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,332 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,440 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,489 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,491 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,546 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:22,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,549 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:22,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:22,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 16:45:22,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [71760#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 16:45:22,662 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 16:45:22,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 16:45:22,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 16:45:22,663 INFO L87 Difference]: Start difference. First operand 2850 states and 10798 transitions. Second operand 5 states. [2020-11-09 16:45:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:22,823 INFO L93 Difference]: Finished difference Result 2167 states and 7406 transitions. [2020-11-09 16:45:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:45:22,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 16:45:22,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:22,831 INFO L225 Difference]: With dead ends: 2167 [2020-11-09 16:45:22,831 INFO L226 Difference]: Without dead ends: 1407 [2020-11-09 16:45:22,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:45:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-11-09 16:45:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1407. [2020-11-09 16:45:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2020-11-09 16:45:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 4360 transitions. [2020-11-09 16:45:22,881 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 4360 transitions. Word has length 16 [2020-11-09 16:45:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:22,881 INFO L481 AbstractCegarLoop]: Abstraction has 1407 states and 4360 transitions. [2020-11-09 16:45:22,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 16:45:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 4360 transitions. [2020-11-09 16:45:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 16:45:22,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:22,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:22,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 16:45:22,887 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:22,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:22,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2018525097, now seen corresponding path program 1 times [2020-11-09 16:45:22,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:22,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480221561] [2020-11-09 16:45:22,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:23,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480221561] [2020-11-09 16:45:23,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:23,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 16:45:23,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [942549021] [2020-11-09 16:45:23,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:23,049 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:23,062 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 59 transitions. [2020-11-09 16:45:23,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:23,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,101 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,160 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:23,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,161 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,256 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,360 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,361 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,362 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,459 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [76752#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:45:23,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 16:45:23,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 16:45:23,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 16:45:23,460 INFO L87 Difference]: Start difference. First operand 1407 states and 4360 transitions. Second operand 7 states. [2020-11-09 16:45:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:23,626 INFO L93 Difference]: Finished difference Result 1244 states and 3834 transitions. [2020-11-09 16:45:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 16:45:23,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-09 16:45:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:23,634 INFO L225 Difference]: With dead ends: 1244 [2020-11-09 16:45:23,635 INFO L226 Difference]: Without dead ends: 1108 [2020-11-09 16:45:23,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:45:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2020-11-09 16:45:23,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 916. [2020-11-09 16:45:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2020-11-09 16:45:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2839 transitions. [2020-11-09 16:45:23,673 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2839 transitions. Word has length 20 [2020-11-09 16:45:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:23,674 INFO L481 AbstractCegarLoop]: Abstraction has 916 states and 2839 transitions. [2020-11-09 16:45:23,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 16:45:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2839 transitions. [2020-11-09 16:45:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 16:45:23,678 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:23,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:23,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 16:45:23,678 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash -713815401, now seen corresponding path program 1 times [2020-11-09 16:45:23,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:23,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118671060] [2020-11-09 16:45:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:23,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118671060] [2020-11-09 16:45:23,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:23,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:45:23,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [821941803] [2020-11-09 16:45:23,841 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:23,846 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:23,868 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-11-09 16:45:23,868 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:23,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:23,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,913 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,970 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:23,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:23,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:23,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:23,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:24,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:24,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,064 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,118 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:24,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,165 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:24,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,259 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:24,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,260 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,261 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,318 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,366 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,366 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,367 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,409 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,479 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,541 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [79838#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 16:45:24,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 16:45:24,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:24,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 16:45:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 16:45:24,542 INFO L87 Difference]: Start difference. First operand 916 states and 2839 transitions. Second operand 8 states. [2020-11-09 16:45:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:24,730 INFO L93 Difference]: Finished difference Result 887 states and 2779 transitions. [2020-11-09 16:45:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:45:24,733 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-11-09 16:45:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:24,737 INFO L225 Difference]: With dead ends: 887 [2020-11-09 16:45:24,737 INFO L226 Difference]: Without dead ends: 869 [2020-11-09 16:45:24,737 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-09 16:45:24,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2020-11-09 16:45:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 853. [2020-11-09 16:45:24,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-11-09 16:45:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2701 transitions. [2020-11-09 16:45:24,768 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2701 transitions. Word has length 23 [2020-11-09 16:45:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:24,768 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 2701 transitions. [2020-11-09 16:45:24,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 16:45:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2701 transitions. [2020-11-09 16:45:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:45:24,772 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:24,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:24,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 16:45:24,772 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:24,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:24,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1726558306, now seen corresponding path program 1 times [2020-11-09 16:45:24,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:24,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960231350] [2020-11-09 16:45:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:24,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960231350] [2020-11-09 16:45:24,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:24,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 16:45:24,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799611830] [2020-11-09 16:45:24,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:24,854 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:24,967 INFO L252 McrAutomatonBuilder]: Finished intersection with 131 states and 264 transitions. [2020-11-09 16:45:24,967 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:24,984 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:24,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,985 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:24,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:24,986 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:24,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,076 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,124 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,125 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,126 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,225 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,225 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,318 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,363 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,406 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,519 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,601 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,707 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,707 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,767 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,768 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,825 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,826 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,889 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:25,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,891 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,953 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,954 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:25,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:25,955 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:25,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:26,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,057 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,059 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:26,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:26,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,137 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:26,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,138 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,139 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:26,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,184 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,186 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,186 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:26,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 16:45:26,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 16:45:26,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:26,320 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 16:45:26,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 16:45:26,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:26,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 16:45:26,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 16:45:26,321 INFO L87 Difference]: Start difference. First operand 853 states and 2701 transitions. Second operand 4 states. [2020-11-09 16:45:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:26,390 INFO L93 Difference]: Finished difference Result 1191 states and 3675 transitions. [2020-11-09 16:45:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 16:45:26,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-09 16:45:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:26,395 INFO L225 Difference]: With dead ends: 1191 [2020-11-09 16:45:26,396 INFO L226 Difference]: Without dead ends: 517 [2020-11-09 16:45:26,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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-11-09 16:45:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-11-09 16:45:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-11-09 16:45:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-11-09 16:45:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-11-09 16:45:26,417 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 27 [2020-11-09 16:45:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:26,417 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-11-09 16:45:26,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 16:45:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-11-09 16:45:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:45:26,420 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:26,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:26,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 16:45:26,420 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:26,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash -2053313744, now seen corresponding path program 2 times [2020-11-09 16:45:26,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:26,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707551219] [2020-11-09 16:45:26,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 16:45:26,757 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2020-11-09 16:45:26,898 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2020-11-09 16:45:27,147 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 24 [2020-11-09 16:45:27,367 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 25 [2020-11-09 16:45:27,583 WARN L194 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2020-11-09 16:45:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 16:45:27,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707551219] [2020-11-09 16:45:27,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 16:45:27,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 16:45:27,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1665983662] [2020-11-09 16:45:27,712 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 16:45:27,716 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 16:45:27,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 122 transitions. [2020-11-09 16:45:27,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 16:45:27,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:45:27,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:27,774 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:45:27,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:27,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:27,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:27,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 2, 1] term [2020-11-09 16:45:27,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:27,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:45:27,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:28,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:45:28,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:28,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:45:28,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:28,489 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:28,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:28,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 2, 1] term [2020-11-09 16:45:28,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:28,491 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:45:28,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,369 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:29,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:29,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:29,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:29,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:29,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:29,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:29,601 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:29,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:29,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:29,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:29,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:29,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:29,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:29,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:29,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:29,998 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:29,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,246 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:30,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:30,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:30,248 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:30,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:30,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:30,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:30,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:30,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:30,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:30,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:30,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:30,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,909 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:30,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:30,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:30,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:30,912 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:30,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:32,001 WARN L194 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 34 [2020-11-09 16:45:32,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 16:45:32,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:32,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 16:45:32,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:32,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:32,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:32,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 2, 1] term [2020-11-09 16:45:32,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:32,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 16:45:32,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:33,415 WARN L194 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 37 [2020-11-09 16:45:33,590 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-09 16:45:33,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:33,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:33,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:33,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:33,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:33,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:33,819 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:33,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:33,821 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:33,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:33,822 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:33,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:34,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,003 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:34,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:34,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:34,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:34,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:34,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:34,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:34,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:34,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:34,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:34,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:34,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:34,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:34,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:34,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:34,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:34,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:35,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 16:45:35,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:35,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 9, 3, 3, 2, 2, 1] term [2020-11-09 16:45:35,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 16:45:35,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 9, 3, 2, 2, 1] term [2020-11-09 16:45:35,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 16:45:35,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [84675#(and (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (or (= ~y~0 1) (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 84674#(and (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (<= 0 ~y$w_buff0_used~0)) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$w_buff1~0 0) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (<= ~y$w_buff0_used~0 0)) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)) (<= 0 ~y$r_buff0_thd0~0)), 84677#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256)))) (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1))) (or (= ~y$w_buff0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 84676#(and (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$r_buff0_thd2~0 256) 0))) (or (= (mod ~y$w_buff0_used~0 256) 0) (= ~y$w_buff0~0 0) (= ~y$w_buff0~0 1)) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)))] [2020-11-09 16:45:35,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 16:45:35,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 16:45:35,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 16:45:35,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-09 16:45:35,445 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 12 states. [2020-11-09 16:45:35,619 WARN L194 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2020-11-09 16:45:35,761 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2020-11-09 16:45:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 16:45:36,132 INFO L93 Difference]: Finished difference Result 663 states and 1855 transitions. [2020-11-09 16:45:36,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 16:45:36,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-11-09 16:45:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 16:45:36,136 INFO L225 Difference]: With dead ends: 663 [2020-11-09 16:45:36,136 INFO L226 Difference]: Without dead ends: 469 [2020-11-09 16:45:36,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-11-09 16:45:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2020-11-09 16:45:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 421. [2020-11-09 16:45:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-09 16:45:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1169 transitions. [2020-11-09 16:45:36,149 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1169 transitions. Word has length 27 [2020-11-09 16:45:36,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 16:45:36,149 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1169 transitions. [2020-11-09 16:45:36,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 16:45:36,149 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1169 transitions. [2020-11-09 16:45:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 16:45:36,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 16:45:36,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 16:45:36,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 16:45:36,151 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 16:45:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 16:45:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 608357654, now seen corresponding path program 3 times [2020-11-09 16:45:36,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 16:45:36,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302415888] [2020-11-09 16:45:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 16:45:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:45:36,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:45:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 16:45:36,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 16:45:36,314 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 16:45:36,315 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 16:45:36,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 16:45:36,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:45:36 BasicIcfg [2020-11-09 16:45:36,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 16:45:36,459 INFO L168 Benchmark]: Toolchain (without parser) took 83720.94 ms. Allocated memory was 155.2 MB in the beginning and 489.7 MB in the end (delta: 334.5 MB). Free memory was 129.3 MB in the beginning and 238.6 MB in the end (delta: -109.3 MB). Peak memory consumption was 226.3 MB. Max. memory is 8.0 GB. [2020-11-09 16:45:36,459 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 155.2 MB. Free memory is still 129.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 16:45:36,460 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1067.28 ms. Allocated memory is still 155.2 MB. Free memory was 128.7 MB in the beginning and 124.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2020-11-09 16:45:36,461 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.65 ms. Allocated memory is still 155.2 MB. Free memory was 124.9 MB in the beginning and 122.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:45:36,461 INFO L168 Benchmark]: Boogie Preprocessor took 52.27 ms. Allocated memory is still 155.2 MB. Free memory was 122.0 MB in the beginning and 119.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 16:45:36,462 INFO L168 Benchmark]: RCFGBuilder took 2691.19 ms. Allocated memory was 155.2 MB in the beginning and 195.0 MB in the end (delta: 39.8 MB). Free memory was 119.3 MB in the beginning and 96.0 MB in the end (delta: 23.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 8.0 GB. [2020-11-09 16:45:36,463 INFO L168 Benchmark]: TraceAbstraction took 79753.29 ms. Allocated memory was 195.0 MB in the beginning and 489.7 MB in the end (delta: 294.6 MB). Free memory was 95.6 MB in the beginning and 238.6 MB in the end (delta: -143.0 MB). Peak memory consumption was 151.7 MB. Max. memory is 8.0 GB. [2020-11-09 16:45:36,466 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 155.2 MB. Free memory is still 129.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1067.28 ms. Allocated memory is still 155.2 MB. Free memory was 128.7 MB in the beginning and 124.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 138.65 ms. Allocated memory is still 155.2 MB. Free memory was 124.9 MB in the beginning and 122.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 52.27 ms. Allocated memory is still 155.2 MB. Free memory was 122.0 MB in the beginning and 119.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2691.19 ms. Allocated memory was 155.2 MB in the beginning and 195.0 MB in the end (delta: 39.8 MB). Free memory was 119.3 MB in the beginning and 96.0 MB in the end (delta: 23.3 MB). Peak memory consumption was 77.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 79753.29 ms. Allocated memory was 195.0 MB in the beginning and 489.7 MB in the end (delta: 294.6 MB). Free memory was 95.6 MB in the beginning and 238.6 MB in the end (delta: -143.0 MB). Peak memory consumption was 151.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1568 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 54.5s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 8003 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] 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) [L859] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 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 [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix029_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 79.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 54.9s, HoareTripleCheckerStatistics: 435 SDtfs, 896 SDslu, 1045 SDs, 0 SdLazy, 424 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 233 SyntacticMatches, 42 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 1608 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 47404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...