/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:51:05,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:51:05,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:51:05,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:51:05,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:51:05,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:51:05,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:51:05,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:51:05,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:51:05,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:51:05,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:51:05,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:51:05,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:51:05,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:51:05,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:51:05,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:51:05,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:51:05,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:51:05,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:51:05,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:51:05,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:51:05,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:51:05,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:51:05,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:51:05,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:51:05,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:51:05,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:51:05,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:51:05,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:51:05,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:51:05,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:51:05,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:51:05,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:51:05,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:51:05,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:51:05,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:51:05,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:51:05,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:51:05,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:51:05,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:51:05,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:51:05,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:51:05,132 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:51:05,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:51:05,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:51:05,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:51:05,134 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:51:05,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:51:05,135 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:51:05,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:51:05,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:51:05,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:51:05,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:51:05,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:51:05,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:51:05,138 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:51:05,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:51:05,138 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:51:05,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:51:05,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:51:05,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:51:05,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:51:05,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:51:05,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:51:05,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:51:05,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:51:05,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:51:05,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:51:05,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:51:05,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:51:05,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:51:05,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:51:05,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:51:05,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:51:05,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:51:05,477 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:51:05,477 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:51:05,478 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2020-10-05 22:51:05,542 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24589746/a072fb05d7524afa9fda7b8a0f18587c/FLAG5bd4d091a [2020-10-05 22:51:06,003 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:51:06,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2020-10-05 22:51:06,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24589746/a072fb05d7524afa9fda7b8a0f18587c/FLAG5bd4d091a [2020-10-05 22:51:06,297 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a24589746/a072fb05d7524afa9fda7b8a0f18587c [2020-10-05 22:51:06,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:51:06,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:51:06,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:51:06,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:51:06,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:51:06,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:51:06" (1/1) ... [2020-10-05 22:51:06,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc3877a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:06, skipping insertion in model container [2020-10-05 22:51:06,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:51:06" (1/1) ... [2020-10-05 22:51:06,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:51:06,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:51:06,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:51:06,964 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:51:07,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:51:07,139 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:51:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07 WrapperNode [2020-10-05 22:51:07,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:51:07,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:51:07,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:51:07,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:51:07,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:51:07,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:51:07,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:51:07,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:51:07,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... [2020-10-05 22:51:07,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:51:07,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:51:07,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:51:07,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:51:07,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:51:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:51:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:51:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:51:07,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:51:07,391 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:51:07,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:51:07,392 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:51:07,392 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:51:07,393 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:51:07,393 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:51:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:51:07,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:51:07,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:51:07,396 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:51:11,148 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:51:11,148 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:51:11,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:51:11 BoogieIcfgContainer [2020-10-05 22:51:11,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:51:11,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:51:11,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:51:11,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:51:11,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:51:06" (1/3) ... [2020-10-05 22:51:11,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1f8a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:51:11, skipping insertion in model container [2020-10-05 22:51:11,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:51:07" (2/3) ... [2020-10-05 22:51:11,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1f8a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:51:11, skipping insertion in model container [2020-10-05 22:51:11,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:51:11" (3/3) ... [2020-10-05 22:51:11,161 INFO L109 eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i [2020-10-05 22:51:11,172 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:51:11,172 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:51:11,182 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:51:11,183 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:51:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,252 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,255 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,255 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,255 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,256 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,257 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,291 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,292 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,293 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,304 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,304 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:51:11,324 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 22:51:11,346 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:51:11,346 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:51:11,346 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:51:11,346 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:51:11,347 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:51:11,347 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:51:11,347 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:51:11,347 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:51:11,366 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 203 flow [2020-10-05 22:51:11,368 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-05 22:51:11,429 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-05 22:51:11,429 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:51:11,435 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 22:51:11,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-05 22:51:11,488 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-05 22:51:11,488 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:51:11,489 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-05 22:51:11,494 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1740 [2020-10-05 22:51:11,500 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:51:11,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:51:11,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:11,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:51:11,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:11,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:11,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:11,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:11,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:11,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:51:11,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:11,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:11,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:11,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:11,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:11,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:11,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:11,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:11,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:11,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:11,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:11,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:11,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:11,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:11,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:11,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:11,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:12,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:12,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:12,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:12,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:12,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:12,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:51:12,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:12,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:12,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:12,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:12,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:12,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:12,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:51:12,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:51:12,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:12,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:12,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:12,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:12,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:12,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:12,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:12,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:12,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:51:12,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:12,981 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:51:13,086 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 22:51:13,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:51:13,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:51:13,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:51:13,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:13,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:13,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:13,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:13,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:13,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:13,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:51:13,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:13,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:51:13,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:51:13,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:13,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:13,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:13,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:13,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:13,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:13,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:13,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:51:13,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,035 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 22:51:14,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:51:14,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:51:14,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:51:14,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:51:14,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:51:14,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:51:14,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:51:14,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-05 22:51:14,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 22:51:14,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-05 22:51:14,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:51:14,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-05 22:51:14,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:51:14,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-05 22:51:14,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-05 22:51:14,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-05 22:51:14,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:51:14,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:51:14,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:51:14,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:14,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:51:14,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:51:15,713 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-05 22:51:15,822 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-05 22:51:15,832 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5417 [2020-10-05 22:51:15,832 INFO L214 etLargeBlockEncoding]: Total number of compositions: 76 [2020-10-05 22:51:15,836 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-05 22:51:15,904 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1166 states. [2020-10-05 22:51:15,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states. [2020-10-05 22:51:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 22:51:15,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:15,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 22:51:15,915 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:15,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1712567520, now seen corresponding path program 1 times [2020-10-05 22:51:15,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:15,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680518890] [2020-10-05 22:51:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:16,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680518890] [2020-10-05 22:51:16,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:16,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:51:16,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534214864] [2020-10-05 22:51:16,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:51:16,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:16,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:51:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:51:16,179 INFO L87 Difference]: Start difference. First operand 1166 states. Second operand 3 states. [2020-10-05 22:51:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:16,332 INFO L93 Difference]: Finished difference Result 974 states and 3122 transitions. [2020-10-05 22:51:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:51:16,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 22:51:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:16,367 INFO L225 Difference]: With dead ends: 974 [2020-10-05 22:51:16,367 INFO L226 Difference]: Without dead ends: 824 [2020-10-05 22:51:16,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:51:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2020-10-05 22:51:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2020-10-05 22:51:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-10-05 22:51:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2607 transitions. [2020-10-05 22:51:16,484 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2607 transitions. Word has length 5 [2020-10-05 22:51:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:16,484 INFO L479 AbstractCegarLoop]: Abstraction has 824 states and 2607 transitions. [2020-10-05 22:51:16,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:51:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2607 transitions. [2020-10-05 22:51:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-05 22:51:16,488 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:16,488 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:16,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:51:16,489 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:16,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:16,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1739866846, now seen corresponding path program 1 times [2020-10-05 22:51:16,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:16,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232824476] [2020-10-05 22:51:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:16,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232824476] [2020-10-05 22:51:16,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:16,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:51:16,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959873400] [2020-10-05 22:51:16,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:51:16,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:51:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:51:16,772 INFO L87 Difference]: Start difference. First operand 824 states and 2607 transitions. Second operand 4 states. [2020-10-05 22:51:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:16,828 INFO L93 Difference]: Finished difference Result 914 states and 2784 transitions. [2020-10-05 22:51:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:51:16,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-05 22:51:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:16,835 INFO L225 Difference]: With dead ends: 914 [2020-10-05 22:51:16,836 INFO L226 Difference]: Without dead ends: 764 [2020-10-05 22:51:16,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:51:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-10-05 22:51:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2020-10-05 22:51:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2020-10-05 22:51:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2389 transitions. [2020-10-05 22:51:16,867 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 2389 transitions. Word has length 10 [2020-10-05 22:51:16,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:16,868 INFO L479 AbstractCegarLoop]: Abstraction has 764 states and 2389 transitions. [2020-10-05 22:51:16,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:51:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 2389 transitions. [2020-10-05 22:51:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:51:16,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:16,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:16,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:51:16,871 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1859395228, now seen corresponding path program 1 times [2020-10-05 22:51:16,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:16,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909209554] [2020-10-05 22:51:16,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:17,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909209554] [2020-10-05 22:51:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:51:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921035656] [2020-10-05 22:51:17,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:51:17,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:51:17,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:51:17,025 INFO L87 Difference]: Start difference. First operand 764 states and 2389 transitions. Second operand 5 states. [2020-10-05 22:51:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:17,107 INFO L93 Difference]: Finished difference Result 1004 states and 3081 transitions. [2020-10-05 22:51:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:51:17,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-05 22:51:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:17,112 INFO L225 Difference]: With dead ends: 1004 [2020-10-05 22:51:17,112 INFO L226 Difference]: Without dead ends: 524 [2020-10-05 22:51:17,112 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:51:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-10-05 22:51:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2020-10-05 22:51:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-10-05 22:51:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1541 transitions. [2020-10-05 22:51:17,129 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1541 transitions. Word has length 11 [2020-10-05 22:51:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:17,129 INFO L479 AbstractCegarLoop]: Abstraction has 524 states and 1541 transitions. [2020-10-05 22:51:17,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:51:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1541 transitions. [2020-10-05 22:51:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:51:17,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:17,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:17,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:51:17,132 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1134451154, now seen corresponding path program 1 times [2020-10-05 22:51:17,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:17,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456589340] [2020-10-05 22:51:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:17,215 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456589340] [2020-10-05 22:51:17,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:17,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:51:17,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053587186] [2020-10-05 22:51:17,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:51:17,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:17,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:51:17,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:51:17,217 INFO L87 Difference]: Start difference. First operand 524 states and 1541 transitions. Second operand 4 states. [2020-10-05 22:51:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:17,263 INFO L93 Difference]: Finished difference Result 524 states and 1493 transitions. [2020-10-05 22:51:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:51:17,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 22:51:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:17,267 INFO L225 Difference]: With dead ends: 524 [2020-10-05 22:51:17,268 INFO L226 Difference]: Without dead ends: 452 [2020-10-05 22:51:17,268 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:51:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-05 22:51:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-05 22:51:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-05 22:51:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1295 transitions. [2020-10-05 22:51:17,282 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1295 transitions. Word has length 13 [2020-10-05 22:51:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:17,282 INFO L479 AbstractCegarLoop]: Abstraction has 452 states and 1295 transitions. [2020-10-05 22:51:17,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:51:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1295 transitions. [2020-10-05 22:51:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:51:17,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:17,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:17,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:51:17,284 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:17,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:17,285 INFO L82 PathProgramCache]: Analyzing trace with hash -397978743, now seen corresponding path program 1 times [2020-10-05 22:51:17,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:17,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348459418] [2020-10-05 22:51:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:17,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348459418] [2020-10-05 22:51:17,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:17,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:51:17,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144226095] [2020-10-05 22:51:17,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:51:17,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:17,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:51:17,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:51:17,553 INFO L87 Difference]: Start difference. First operand 452 states and 1295 transitions. Second operand 9 states. [2020-10-05 22:51:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:17,933 INFO L93 Difference]: Finished difference Result 545 states and 1538 transitions. [2020-10-05 22:51:17,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:51:17,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 22:51:17,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:17,937 INFO L225 Difference]: With dead ends: 545 [2020-10-05 22:51:17,938 INFO L226 Difference]: Without dead ends: 507 [2020-10-05 22:51:17,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:51:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2020-10-05 22:51:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 494. [2020-10-05 22:51:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-10-05 22:51:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1413 transitions. [2020-10-05 22:51:17,954 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1413 transitions. Word has length 16 [2020-10-05 22:51:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:17,955 INFO L479 AbstractCegarLoop]: Abstraction has 494 states and 1413 transitions. [2020-10-05 22:51:17,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:51:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1413 transitions. [2020-10-05 22:51:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:51:17,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:17,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:17,957 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:51:17,957 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 155334715, now seen corresponding path program 2 times [2020-10-05 22:51:17,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:17,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74650285] [2020-10-05 22:51:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:18,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74650285] [2020-10-05 22:51:18,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:18,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:51:18,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22780442] [2020-10-05 22:51:18,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:51:18,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:18,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:51:18,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:51:18,232 INFO L87 Difference]: Start difference. First operand 494 states and 1413 transitions. Second operand 9 states. [2020-10-05 22:51:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:18,742 INFO L93 Difference]: Finished difference Result 966 states and 2705 transitions. [2020-10-05 22:51:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-05 22:51:18,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-05 22:51:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:18,748 INFO L225 Difference]: With dead ends: 966 [2020-10-05 22:51:18,749 INFO L226 Difference]: Without dead ends: 729 [2020-10-05 22:51:18,749 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-05 22:51:18,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2020-10-05 22:51:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 503. [2020-10-05 22:51:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2020-10-05 22:51:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1401 transitions. [2020-10-05 22:51:18,766 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1401 transitions. Word has length 16 [2020-10-05 22:51:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:18,766 INFO L479 AbstractCegarLoop]: Abstraction has 503 states and 1401 transitions. [2020-10-05 22:51:18,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:51:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1401 transitions. [2020-10-05 22:51:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 22:51:18,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:18,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:18,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:51:18,769 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1852453625, now seen corresponding path program 1 times [2020-10-05 22:51:18,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:18,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277992153] [2020-10-05 22:51:18,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:18,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277992153] [2020-10-05 22:51:18,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:18,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:51:18,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207889693] [2020-10-05 22:51:18,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:51:18,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:51:18,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:51:18,885 INFO L87 Difference]: Start difference. First operand 503 states and 1401 transitions. Second operand 4 states. [2020-10-05 22:51:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:18,915 INFO L93 Difference]: Finished difference Result 486 states and 1207 transitions. [2020-10-05 22:51:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:51:18,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-05 22:51:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:18,919 INFO L225 Difference]: With dead ends: 486 [2020-10-05 22:51:18,919 INFO L226 Difference]: Without dead ends: 369 [2020-10-05 22:51:18,919 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:51:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2020-10-05 22:51:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2020-10-05 22:51:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2020-10-05 22:51:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 897 transitions. [2020-10-05 22:51:18,931 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 897 transitions. Word has length 17 [2020-10-05 22:51:18,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:18,932 INFO L479 AbstractCegarLoop]: Abstraction has 369 states and 897 transitions. [2020-10-05 22:51:18,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:51:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 897 transitions. [2020-10-05 22:51:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:51:18,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:18,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:51:18,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:51:18,934 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash -470294463, now seen corresponding path program 1 times [2020-10-05 22:51:18,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:18,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375899799] [2020-10-05 22:51:18,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:19,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375899799] [2020-10-05 22:51:19,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:19,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:51:19,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669909660] [2020-10-05 22:51:19,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:51:19,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:19,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:51:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:51:19,101 INFO L87 Difference]: Start difference. First operand 369 states and 897 transitions. Second operand 5 states. [2020-10-05 22:51:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:19,138 INFO L93 Difference]: Finished difference Result 305 states and 686 transitions. [2020-10-05 22:51:19,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:51:19,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-05 22:51:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:19,141 INFO L225 Difference]: With dead ends: 305 [2020-10-05 22:51:19,141 INFO L226 Difference]: Without dead ends: 245 [2020-10-05 22:51:19,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:51:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-10-05 22:51:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2020-10-05 22:51:19,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-05 22:51:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 533 transitions. [2020-10-05 22:51:19,148 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 533 transitions. Word has length 18 [2020-10-05 22:51:19,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:19,148 INFO L479 AbstractCegarLoop]: Abstraction has 242 states and 533 transitions. [2020-10-05 22:51:19,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:51:19,148 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 533 transitions. [2020-10-05 22:51:19,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 22:51:19,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:19,150 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-10-05 22:51:19,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:51:19,150 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1315352156, now seen corresponding path program 1 times [2020-10-05 22:51:19,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:19,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121359437] [2020-10-05 22:51:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:19,268 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121359437] [2020-10-05 22:51:19,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:19,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:51:19,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537330620] [2020-10-05 22:51:19,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:51:19,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:51:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:51:19,269 INFO L87 Difference]: Start difference. First operand 242 states and 533 transitions. Second operand 6 states. [2020-10-05 22:51:19,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:19,313 INFO L93 Difference]: Finished difference Result 217 states and 481 transitions. [2020-10-05 22:51:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:51:19,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-05 22:51:19,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:19,315 INFO L225 Difference]: With dead ends: 217 [2020-10-05 22:51:19,315 INFO L226 Difference]: Without dead ends: 204 [2020-10-05 22:51:19,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:51:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-05 22:51:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168. [2020-10-05 22:51:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-05 22:51:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 379 transitions. [2020-10-05 22:51:19,320 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 379 transitions. Word has length 20 [2020-10-05 22:51:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:19,321 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 379 transitions. [2020-10-05 22:51:19,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:51:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 379 transitions. [2020-10-05 22:51:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:19,322 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:19,322 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-10-05 22:51:19,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:51:19,322 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:19,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:19,323 INFO L82 PathProgramCache]: Analyzing trace with hash 588865582, now seen corresponding path program 1 times [2020-10-05 22:51:19,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:19,323 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579582137] [2020-10-05 22:51:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:19,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579582137] [2020-10-05 22:51:19,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:19,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:51:19,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233056211] [2020-10-05 22:51:19,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:51:19,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:51:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:51:19,528 INFO L87 Difference]: Start difference. First operand 168 states and 379 transitions. Second operand 7 states. [2020-10-05 22:51:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:19,707 INFO L93 Difference]: Finished difference Result 210 states and 457 transitions. [2020-10-05 22:51:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:51:19,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 22:51:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:19,709 INFO L225 Difference]: With dead ends: 210 [2020-10-05 22:51:19,710 INFO L226 Difference]: Without dead ends: 179 [2020-10-05 22:51:19,710 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:51:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-05 22:51:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 152. [2020-10-05 22:51:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-05 22:51:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 331 transitions. [2020-10-05 22:51:19,715 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 331 transitions. Word has length 23 [2020-10-05 22:51:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:19,716 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 331 transitions. [2020-10-05 22:51:19,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:51:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 331 transitions. [2020-10-05 22:51:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:19,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:19,717 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-10-05 22:51:19,717 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:51:19,717 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 434057758, now seen corresponding path program 2 times [2020-10-05 22:51:19,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:19,718 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208513202] [2020-10-05 22:51:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:20,086 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208513202] [2020-10-05 22:51:20,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:20,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:51:20,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677711097] [2020-10-05 22:51:20,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:51:20,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:51:20,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:51:20,088 INFO L87 Difference]: Start difference. First operand 152 states and 331 transitions. Second operand 10 states. [2020-10-05 22:51:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:20,651 INFO L93 Difference]: Finished difference Result 238 states and 514 transitions. [2020-10-05 22:51:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 22:51:20,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-05 22:51:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:20,654 INFO L225 Difference]: With dead ends: 238 [2020-10-05 22:51:20,654 INFO L226 Difference]: Without dead ends: 170 [2020-10-05 22:51:20,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2020-10-05 22:51:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-10-05 22:51:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 128. [2020-10-05 22:51:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2020-10-05 22:51:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 274 transitions. [2020-10-05 22:51:20,659 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 274 transitions. Word has length 23 [2020-10-05 22:51:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:20,659 INFO L479 AbstractCegarLoop]: Abstraction has 128 states and 274 transitions. [2020-10-05 22:51:20,659 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:51:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 274 transitions. [2020-10-05 22:51:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:20,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:20,660 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-10-05 22:51:20,660 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:51:20,660 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1641547900, now seen corresponding path program 3 times [2020-10-05 22:51:20,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:20,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510118186] [2020-10-05 22:51:20,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:20,989 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510118186] [2020-10-05 22:51:20,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:20,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-05 22:51:20,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195467256] [2020-10-05 22:51:20,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-05 22:51:20,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:20,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-05 22:51:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:51:20,991 INFO L87 Difference]: Start difference. First operand 128 states and 274 transitions. Second operand 10 states. [2020-10-05 22:51:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:21,751 INFO L93 Difference]: Finished difference Result 276 states and 544 transitions. [2020-10-05 22:51:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-05 22:51:21,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-05 22:51:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:21,753 INFO L225 Difference]: With dead ends: 276 [2020-10-05 22:51:21,753 INFO L226 Difference]: Without dead ends: 181 [2020-10-05 22:51:21,754 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2020-10-05 22:51:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-10-05 22:51:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 123. [2020-10-05 22:51:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-10-05 22:51:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 254 transitions. [2020-10-05 22:51:21,758 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 254 transitions. Word has length 23 [2020-10-05 22:51:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:21,759 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 254 transitions. [2020-10-05 22:51:21,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-05 22:51:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 254 transitions. [2020-10-05 22:51:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:21,760 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:21,760 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-10-05 22:51:21,760 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:51:21,760 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:21,761 INFO L82 PathProgramCache]: Analyzing trace with hash -912785608, now seen corresponding path program 4 times [2020-10-05 22:51:21,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:21,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295373084] [2020-10-05 22:51:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:22,288 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295373084] [2020-10-05 22:51:22,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:22,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-05 22:51:22,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989777673] [2020-10-05 22:51:22,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-05 22:51:22,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:22,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-05 22:51:22,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-10-05 22:51:22,290 INFO L87 Difference]: Start difference. First operand 123 states and 254 transitions. Second operand 12 states. [2020-10-05 22:51:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:23,143 INFO L93 Difference]: Finished difference Result 249 states and 506 transitions. [2020-10-05 22:51:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 22:51:23,144 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-05 22:51:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:23,145 INFO L225 Difference]: With dead ends: 249 [2020-10-05 22:51:23,145 INFO L226 Difference]: Without dead ends: 196 [2020-10-05 22:51:23,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2020-10-05 22:51:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-10-05 22:51:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 131. [2020-10-05 22:51:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-10-05 22:51:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 268 transitions. [2020-10-05 22:51:23,150 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 268 transitions. Word has length 23 [2020-10-05 22:51:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:23,150 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 268 transitions. [2020-10-05 22:51:23,151 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-05 22:51:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 268 transitions. [2020-10-05 22:51:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:23,151 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:23,152 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-10-05 22:51:23,152 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:51:23,152 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:23,153 INFO L82 PathProgramCache]: Analyzing trace with hash -163875514, now seen corresponding path program 5 times [2020-10-05 22:51:23,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:23,153 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600152927] [2020-10-05 22:51:23,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:23,342 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600152927] [2020-10-05 22:51:23,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:23,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:51:23,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540675348] [2020-10-05 22:51:23,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:51:23,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:23,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:51:23,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:51:23,344 INFO L87 Difference]: Start difference. First operand 131 states and 268 transitions. Second operand 6 states. [2020-10-05 22:51:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:23,519 INFO L93 Difference]: Finished difference Result 180 states and 356 transitions. [2020-10-05 22:51:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:51:23,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-05 22:51:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:23,521 INFO L225 Difference]: With dead ends: 180 [2020-10-05 22:51:23,522 INFO L226 Difference]: Without dead ends: 139 [2020-10-05 22:51:23,523 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:51:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-10-05 22:51:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-10-05 22:51:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-05 22:51:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 280 transitions. [2020-10-05 22:51:23,530 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 280 transitions. Word has length 23 [2020-10-05 22:51:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:23,531 INFO L479 AbstractCegarLoop]: Abstraction has 139 states and 280 transitions. [2020-10-05 22:51:23,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:51:23,531 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 280 transitions. [2020-10-05 22:51:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:23,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:23,532 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-10-05 22:51:23,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:51:23,535 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:23,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2096994970, now seen corresponding path program 6 times [2020-10-05 22:51:23,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:23,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881822703] [2020-10-05 22:51:23,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:23,746 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881822703] [2020-10-05 22:51:23,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:23,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:51:23,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522835046] [2020-10-05 22:51:23,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:51:23,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:51:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:51:23,748 INFO L87 Difference]: Start difference. First operand 139 states and 280 transitions. Second operand 8 states. [2020-10-05 22:51:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:23,984 INFO L93 Difference]: Finished difference Result 233 states and 471 transitions. [2020-10-05 22:51:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:51:23,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-05 22:51:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:23,987 INFO L225 Difference]: With dead ends: 233 [2020-10-05 22:51:23,987 INFO L226 Difference]: Without dead ends: 180 [2020-10-05 22:51:23,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:51:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-05 22:51:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 140. [2020-10-05 22:51:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-05 22:51:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 296 transitions. [2020-10-05 22:51:23,992 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 296 transitions. Word has length 23 [2020-10-05 22:51:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:23,993 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 296 transitions. [2020-10-05 22:51:23,993 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:51:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 296 transitions. [2020-10-05 22:51:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:23,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:23,994 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-10-05 22:51:23,995 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:51:23,995 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:23,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2146373086, now seen corresponding path program 7 times [2020-10-05 22:51:23,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:23,996 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282360022] [2020-10-05 22:51:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:24,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282360022] [2020-10-05 22:51:24,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:24,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:51:24,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313700337] [2020-10-05 22:51:24,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 22:51:24,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:24,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 22:51:24,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:51:24,499 INFO L87 Difference]: Start difference. First operand 140 states and 296 transitions. Second operand 13 states. [2020-10-05 22:51:25,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:25,154 INFO L93 Difference]: Finished difference Result 198 states and 389 transitions. [2020-10-05 22:51:25,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 22:51:25,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-10-05 22:51:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:25,156 INFO L225 Difference]: With dead ends: 198 [2020-10-05 22:51:25,156 INFO L226 Difference]: Without dead ends: 162 [2020-10-05 22:51:25,157 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-10-05 22:51:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-05 22:51:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2020-10-05 22:51:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-10-05 22:51:25,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 289 transitions. [2020-10-05 22:51:25,161 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 289 transitions. Word has length 23 [2020-10-05 22:51:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:25,161 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 289 transitions. [2020-10-05 22:51:25,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 22:51:25,162 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 289 transitions. [2020-10-05 22:51:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:25,162 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:25,162 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-10-05 22:51:25,163 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 22:51:25,163 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:25,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:25,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1397462992, now seen corresponding path program 8 times [2020-10-05 22:51:25,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:25,164 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154993191] [2020-10-05 22:51:25,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:25,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154993191] [2020-10-05 22:51:25,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:25,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:51:25,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563758355] [2020-10-05 22:51:25,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:51:25,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:25,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:51:25,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:51:25,400 INFO L87 Difference]: Start difference. First operand 140 states and 289 transitions. Second operand 9 states. [2020-10-05 22:51:25,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:25,588 INFO L93 Difference]: Finished difference Result 179 states and 358 transitions. [2020-10-05 22:51:25,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:51:25,588 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 22:51:25,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:25,589 INFO L225 Difference]: With dead ends: 179 [2020-10-05 22:51:25,589 INFO L226 Difference]: Without dead ends: 141 [2020-10-05 22:51:25,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:51:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-05 22:51:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2020-10-05 22:51:25,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-05 22:51:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 270 transitions. [2020-10-05 22:51:25,594 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 270 transitions. Word has length 23 [2020-10-05 22:51:25,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:25,594 INFO L479 AbstractCegarLoop]: Abstraction has 133 states and 270 transitions. [2020-10-05 22:51:25,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:51:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 270 transitions. [2020-10-05 22:51:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:25,595 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:25,595 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-10-05 22:51:25,595 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 22:51:25,595 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:25,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -508760690, now seen corresponding path program 9 times [2020-10-05 22:51:25,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:25,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258797301] [2020-10-05 22:51:25,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:25,804 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258797301] [2020-10-05 22:51:25,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:25,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 22:51:25,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180433492] [2020-10-05 22:51:25,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 22:51:25,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:25,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 22:51:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:51:25,806 INFO L87 Difference]: Start difference. First operand 133 states and 270 transitions. Second operand 9 states. [2020-10-05 22:51:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:26,112 INFO L93 Difference]: Finished difference Result 177 states and 348 transitions. [2020-10-05 22:51:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:51:26,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-05 22:51:26,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:26,114 INFO L225 Difference]: With dead ends: 177 [2020-10-05 22:51:26,114 INFO L226 Difference]: Without dead ends: 126 [2020-10-05 22:51:26,115 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:51:26,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2020-10-05 22:51:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2020-10-05 22:51:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-05 22:51:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 246 transitions. [2020-10-05 22:51:26,118 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 246 transitions. Word has length 23 [2020-10-05 22:51:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:26,118 INFO L479 AbstractCegarLoop]: Abstraction has 121 states and 246 transitions. [2020-10-05 22:51:26,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 22:51:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 246 transitions. [2020-10-05 22:51:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:26,119 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:26,119 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-10-05 22:51:26,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 22:51:26,120 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1688571640, now seen corresponding path program 10 times [2020-10-05 22:51:26,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:26,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812085283] [2020-10-05 22:51:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:26,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:26,708 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812085283] [2020-10-05 22:51:26,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:26,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-05 22:51:26,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24621111] [2020-10-05 22:51:26,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 22:51:26,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 22:51:26,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:51:26,711 INFO L87 Difference]: Start difference. First operand 121 states and 246 transitions. Second operand 13 states. [2020-10-05 22:51:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:27,562 INFO L93 Difference]: Finished difference Result 200 states and 378 transitions. [2020-10-05 22:51:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 22:51:27,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-10-05 22:51:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:27,564 INFO L225 Difference]: With dead ends: 200 [2020-10-05 22:51:27,564 INFO L226 Difference]: Without dead ends: 68 [2020-10-05 22:51:27,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2020-10-05 22:51:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-05 22:51:27,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-10-05 22:51:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-05 22:51:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 123 transitions. [2020-10-05 22:51:27,567 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 123 transitions. Word has length 23 [2020-10-05 22:51:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:27,567 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 123 transitions. [2020-10-05 22:51:27,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 22:51:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 123 transitions. [2020-10-05 22:51:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:27,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:27,568 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-10-05 22:51:27,568 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 22:51:27,568 INFO L427 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:27,568 INFO L82 PathProgramCache]: Analyzing trace with hash -95587146, now seen corresponding path program 11 times [2020-10-05 22:51:27,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:27,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488039750] [2020-10-05 22:51:27,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:51:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:51:27,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488039750] [2020-10-05 22:51:27,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:51:27,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:51:27,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537322848] [2020-10-05 22:51:27,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:51:27,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:51:27,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:51:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:51:27,759 INFO L87 Difference]: Start difference. First operand 68 states and 123 transitions. Second operand 8 states. [2020-10-05 22:51:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:51:28,024 INFO L93 Difference]: Finished difference Result 114 states and 209 transitions. [2020-10-05 22:51:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:51:28,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-05 22:51:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:51:28,025 INFO L225 Difference]: With dead ends: 114 [2020-10-05 22:51:28,025 INFO L226 Difference]: Without dead ends: 64 [2020-10-05 22:51:28,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-05 22:51:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-05 22:51:28,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2020-10-05 22:51:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-05 22:51:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-10-05 22:51:28,027 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23 [2020-10-05 22:51:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:51:28,028 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2020-10-05 22:51:28,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:51:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2020-10-05 22:51:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:51:28,028 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:51:28,029 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-10-05 22:51:28,029 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-05 22:51:28,029 INFO L427 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:51:28,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:51:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash -936756490, now seen corresponding path program 12 times [2020-10-05 22:51:28,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:51:28,030 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965882770] [2020-10-05 22:51:28,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:51:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:51:28,129 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:51:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:51:28,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:51:28,269 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:51:28,269 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:51:28,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-05 22:51:28,309 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,334 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,335 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,336 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,336 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,337 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,337 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,337 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,338 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,339 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,339 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,340 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,340 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,341 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,341 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,341 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,342 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,342 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,342 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,343 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,343 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,344 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,344 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,345 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,347 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,348 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,349 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,350 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,351 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,352 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,352 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,353 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,353 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,354 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,355 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,355 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,356 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,357 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,358 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,358 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,359 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,360 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,360 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:51:28,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:51:28,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:51:28 BasicIcfg [2020-10-05 22:51:28,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:51:28,499 INFO L168 Benchmark]: Toolchain (without parser) took 22187.99 ms. Allocated memory was 138.9 MB in the beginning and 563.6 MB in the end (delta: 424.7 MB). Free memory was 100.3 MB in the beginning and 124.5 MB in the end (delta: -24.1 MB). Peak memory consumption was 400.5 MB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,500 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.95 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.9 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.49 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,503 INFO L168 Benchmark]: Boogie Preprocessor took 93.49 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 146.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,504 INFO L168 Benchmark]: RCFGBuilder took 3832.94 ms. Allocated memory was 202.4 MB in the beginning and 301.5 MB in the end (delta: 99.1 MB). Free memory was 146.0 MB in the beginning and 241.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,507 INFO L168 Benchmark]: TraceAbstraction took 17342.21 ms. Allocated memory was 301.5 MB in the beginning and 563.6 MB in the end (delta: 262.1 MB). Free memory was 237.7 MB in the beginning and 124.5 MB in the end (delta: 113.2 MB). Peak memory consumption was 375.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:51:28,516 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.95 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 99.9 MB in the beginning and 152.9 MB in the end (delta: -53.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.49 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.49 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 146.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3832.94 ms. Allocated memory was 202.4 MB in the beginning and 301.5 MB in the end (delta: 99.1 MB). Free memory was 146.0 MB in the beginning and 241.0 MB in the end (delta: -95.0 MB). Peak memory consumption was 112.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17342.21 ms. Allocated memory was 301.5 MB in the beginning and 563.6 MB in the end (delta: 262.1 MB). Free memory was 237.7 MB in the beginning and 124.5 MB in the end (delta: 113.2 MB). Peak memory consumption was 375.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 102 ProgramPointsBefore, 38 ProgramPointsAfterwards, 94 TransitionsBefore, 29 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 802 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 5417 CheckedPairsTotal, 76 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff1_thd0; [L719] 0 _Bool y$r_buff1_thd1; [L720] 0 _Bool y$r_buff1_thd2; [L721] 0 _Bool y$r_buff1_thd3; [L722] 0 _Bool y$read_delayed; [L723] 0 int *y$read_delayed_var; [L724] 0 int y$w_buff0; [L725] 0 _Bool y$w_buff0_used; [L726] 0 int y$w_buff1; [L727] 0 _Bool y$w_buff1_used; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L843] 0 pthread_t t2333; [L844] FCALL, FORK 0 pthread_create(&t2333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 pthread_t t2334; [L846] FCALL, FORK 0 pthread_create(&t2334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 2 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 pthread_t t2335; [L848] FCALL, FORK 0 pthread_create(&t2335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L821] 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) [L821] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L821] 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) [L821] 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) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L823] 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 [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L825] 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 [L733] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 1 y$flush_delayed = weak$$choice2 [L746] 1 y$mem_tmp = y [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L748] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L751] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 __unbuffered_p0_EAX = y [L755] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L755] 1 y = y$flush_delayed ? y$mem_tmp : y [L756] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L788] 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) [L788] 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) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 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 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 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 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L854] 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) [L854] 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) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 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 [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 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 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 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) [L865] 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) [L866] 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)) [L866] 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)) [L867] 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)) [L867] 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)) [L868] 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)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] 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)) [L868] 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)) [L869] 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)) [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L869] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] 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)) [L869] 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)) [L870] 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)) [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 560 SDtfs, 921 SDslu, 1778 SDs, 0 SdLazy, 1451 SolverSat, 462 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 555 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 84762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...