/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/mix014_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:49:53,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:49:53,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:49:53,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:49:53,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:49:53,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:49:53,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:49:53,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:49:53,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:49:53,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:49:53,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:49:53,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:49:53,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:49:53,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:49:53,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:49:53,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:49:53,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:49:53,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:49:53,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:49:53,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:49:53,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:49:53,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:49:53,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:49:53,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:49:53,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:49:53,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:49:53,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:49:53,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:49:53,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:49:53,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:49:53,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:49:53,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:49:53,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:49:53,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:49:53,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:49:53,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:49:53,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:49:53,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:49:53,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:49:53,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:49:53,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:49:53,221 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-21 21:49:53,248 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:49:53,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:49:53,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:49:53,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:49:53,251 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:49:53,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:49:53,251 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:49:53,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:49:53,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:49:53,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:49:53,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:49:53,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:49:53,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:49:53,252 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:49:53,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:49:53,253 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:49:53,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:49:53,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:49:53,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:49:53,253 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:49:53,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:49:53,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:49:53,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:49:53,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:49:53,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:49:53,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:49:53,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:49:53,255 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:49:53,255 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:49:53,255 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:49:53,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:49:53,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:49:53,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:49:53,608 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:49:53,609 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:49:53,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_rmo.opt.i [2020-10-21 21:49:53,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f82a3d6/6f534f26374b48fcad252c9ac63927ba/FLAG389afb9bc [2020-10-21 21:49:54,240 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:49:54,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_rmo.opt.i [2020-10-21 21:49:54,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f82a3d6/6f534f26374b48fcad252c9ac63927ba/FLAG389afb9bc [2020-10-21 21:49:54,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f82a3d6/6f534f26374b48fcad252c9ac63927ba [2020-10-21 21:49:54,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:49:54,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:49:54,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:49:54,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:49:54,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:49:54,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:49:54" (1/1) ... [2020-10-21 21:49:54,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271f1582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:54, skipping insertion in model container [2020-10-21 21:49:54,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:49:54" (1/1) ... [2020-10-21 21:49:54,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:49:54,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:49:55,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:49:55,143 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:49:55,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:49:55,332 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:49:55,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55 WrapperNode [2020-10-21 21:49:55,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:49:55,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:49:55,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:49:55,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:49:55,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:49:55,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:49:55,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:49:55,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:49:55,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (1/1) ... [2020-10-21 21:49:55,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:49:55,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:49:55,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:49:55,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:49:55,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (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-21 21:49:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:49:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:49:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:49:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:49:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:49:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:49:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:49:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:49:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 21:49:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 21:49:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 21:49:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 21:49:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:49:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:49:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:49:55,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:49:55,536 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:49:57,990 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:49:57,990 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:49:57,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:49:57 BoogieIcfgContainer [2020-10-21 21:49:57,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:49:57,995 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:49:57,995 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:49:57,998 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:49:57,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:49:54" (1/3) ... [2020-10-21 21:49:58,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8fb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:49:58, skipping insertion in model container [2020-10-21 21:49:58,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:49:55" (2/3) ... [2020-10-21 21:49:58,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d8fb2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:49:58, skipping insertion in model container [2020-10-21 21:49:58,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:49:57" (3/3) ... [2020-10-21 21:49:58,003 INFO L111 eAbstractionObserver]: Analyzing ICFG mix014_rmo.opt.i [2020-10-21 21:49:58,015 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:49:58,016 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:49:58,025 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:49:58,026 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:49:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,063 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,064 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,065 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,073 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,078 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,079 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,079 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,080 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,094 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,095 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,096 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,096 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,097 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,109 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,110 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:49:58,119 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:49:58,134 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 21:49:58,157 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:49:58,157 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:49:58,157 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:49:58,158 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:49:58,158 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:49:58,158 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:49:58,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:49:58,158 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:49:58,174 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:49:58,177 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-21 21:49:58,180 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-21 21:49:58,182 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-21 21:49:58,246 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-21 21:49:58,247 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:49:58,253 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-10-21 21:49:58,258 INFO L116 LiptonReduction]: Number of co-enabled transitions 2734 [2020-10-21 21:49:58,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:49:58,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:49:58,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:49:58,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:49:58,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:49:58,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:49:58,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:49:58,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:49:58,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:49:58,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:49:58,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:49:58,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:49:58,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:49:58,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:49:58,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:49:58,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:49:59,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:49:59,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:49:59,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:49:59,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:49:59,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:49:59,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:49:59,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:49:59,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:49:59,351 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-21 21:49:59,884 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-21 21:50:00,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:50:00,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:00,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:00,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:00,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:00,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:00,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:00,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:00,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:00,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:01,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:01,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:01,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:01,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:01,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:01,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:01,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:01,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:01,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:01,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:01,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:01,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:01,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:01,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:01,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:02,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:02,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:02,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:02,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:02,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:02,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:02,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:50:02,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,086 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-21 21:50:02,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,087 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-21 21:50:02,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:02,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:02,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:02,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:02,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:50:02,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,157 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-21 21:50:02,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,158 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-21 21:50:02,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:02,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:02,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:02,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:02,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:02,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:02,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:02,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:02,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:02,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:02,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:02,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:02,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:02,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:02,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:02,532 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-10-21 21:50:02,772 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-21 21:50:02,964 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-21 21:50:03,377 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-21 21:50:03,578 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-21 21:50:03,589 INFO L131 LiptonReduction]: Checked pairs total: 7373 [2020-10-21 21:50:03,589 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-10-21 21:50:03,595 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-21 21:50:03,811 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3570 states. [2020-10-21 21:50:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states. [2020-10-21 21:50:03,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 21:50:03,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:03,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:03,826 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:03,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:03,833 INFO L82 PathProgramCache]: Analyzing trace with hash 578469628, now seen corresponding path program 1 times [2020-10-21 21:50:03,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:03,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682165807] [2020-10-21 21:50:03,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:04,114 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-21 21:50:04,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682165807] [2020-10-21 21:50:04,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:04,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:50:04,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304245111] [2020-10-21 21:50:04,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:50:04,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:04,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:50:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:50:04,141 INFO L87 Difference]: Start difference. First operand 3570 states. Second operand 3 states. [2020-10-21 21:50:04,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:04,253 INFO L93 Difference]: Finished difference Result 3090 states and 12070 transitions. [2020-10-21 21:50:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:50:04,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 21:50:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:04,302 INFO L225 Difference]: With dead ends: 3090 [2020-10-21 21:50:04,302 INFO L226 Difference]: Without dead ends: 2610 [2020-10-21 21:50:04,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:50:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-21 21:50:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-21 21:50:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-21 21:50:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10086 transitions. [2020-10-21 21:50:04,492 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10086 transitions. Word has length 9 [2020-10-21 21:50:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:04,493 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10086 transitions. [2020-10-21 21:50:04,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:50:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10086 transitions. [2020-10-21 21:50:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:50:04,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:04,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:04,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:50:04,498 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:04,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1780606083, now seen corresponding path program 1 times [2020-10-21 21:50:04,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:04,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261089255] [2020-10-21 21:50:04,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:04,604 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-21 21:50:04,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261089255] [2020-10-21 21:50:04,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:04,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:50:04,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217089148] [2020-10-21 21:50:04,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:04,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:04,608 INFO L87 Difference]: Start difference. First operand 2610 states and 10086 transitions. Second operand 4 states. [2020-10-21 21:50:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:04,719 INFO L93 Difference]: Finished difference Result 2706 states and 10118 transitions. [2020-10-21 21:50:04,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:04,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 21:50:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:04,741 INFO L225 Difference]: With dead ends: 2706 [2020-10-21 21:50:04,742 INFO L226 Difference]: Without dead ends: 2226 [2020-10-21 21:50:04,743 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:04,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2020-10-21 21:50:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2226. [2020-10-21 21:50:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2020-10-21 21:50:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 8422 transitions. [2020-10-21 21:50:04,827 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 8422 transitions. Word has length 12 [2020-10-21 21:50:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:04,827 INFO L481 AbstractCegarLoop]: Abstraction has 2226 states and 8422 transitions. [2020-10-21 21:50:04,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 8422 transitions. [2020-10-21 21:50:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 21:50:04,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:04,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:04,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:50:04,832 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 736342772, now seen corresponding path program 1 times [2020-10-21 21:50:04,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:04,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613680256] [2020-10-21 21:50:04,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:04,914 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-21 21:50:04,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613680256] [2020-10-21 21:50:04,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:04,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:50:04,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271611441] [2020-10-21 21:50:04,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:04,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:04,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:04,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:04,917 INFO L87 Difference]: Start difference. First operand 2226 states and 8422 transitions. Second operand 4 states. [2020-10-21 21:50:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:04,966 INFO L93 Difference]: Finished difference Result 2322 states and 8582 transitions. [2020-10-21 21:50:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:04,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-21 21:50:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:04,984 INFO L225 Difference]: With dead ends: 2322 [2020-10-21 21:50:04,984 INFO L226 Difference]: Without dead ends: 2034 [2020-10-21 21:50:04,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2020-10-21 21:50:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034. [2020-10-21 21:50:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2020-10-21 21:50:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 7622 transitions. [2020-10-21 21:50:05,057 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 7622 transitions. Word has length 14 [2020-10-21 21:50:05,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:05,058 INFO L481 AbstractCegarLoop]: Abstraction has 2034 states and 7622 transitions. [2020-10-21 21:50:05,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 7622 transitions. [2020-10-21 21:50:05,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 21:50:05,062 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:05,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:05,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:50:05,063 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:05,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:05,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1043542916, now seen corresponding path program 1 times [2020-10-21 21:50:05,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:05,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085796506] [2020-10-21 21:50:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:05,254 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-21 21:50:05,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085796506] [2020-10-21 21:50:05,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:05,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:50:05,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607715550] [2020-10-21 21:50:05,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:05,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:05,257 INFO L87 Difference]: Start difference. First operand 2034 states and 7622 transitions. Second operand 4 states. [2020-10-21 21:50:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:05,301 INFO L93 Difference]: Finished difference Result 2046 states and 6966 transitions. [2020-10-21 21:50:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:50:05,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 21:50:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:05,314 INFO L225 Difference]: With dead ends: 2046 [2020-10-21 21:50:05,314 INFO L226 Difference]: Without dead ends: 1566 [2020-10-21 21:50:05,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2020-10-21 21:50:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2020-10-21 21:50:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2020-10-21 21:50:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 5282 transitions. [2020-10-21 21:50:05,366 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 5282 transitions. Word has length 16 [2020-10-21 21:50:05,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:05,366 INFO L481 AbstractCegarLoop]: Abstraction has 1566 states and 5282 transitions. [2020-10-21 21:50:05,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 5282 transitions. [2020-10-21 21:50:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 21:50:05,370 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:05,370 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-21 21:50:05,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:50:05,370 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:05,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:05,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1253401598, now seen corresponding path program 1 times [2020-10-21 21:50:05,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:05,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076072552] [2020-10-21 21:50:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:05,446 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-21 21:50:05,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076072552] [2020-10-21 21:50:05,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:05,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:50:05,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345397353] [2020-10-21 21:50:05,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:50:05,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:50:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:05,449 INFO L87 Difference]: Start difference. First operand 1566 states and 5282 transitions. Second operand 5 states. [2020-10-21 21:50:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:05,504 INFO L93 Difference]: Finished difference Result 1302 states and 4011 transitions. [2020-10-21 21:50:05,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:05,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-21 21:50:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:05,511 INFO L225 Difference]: With dead ends: 1302 [2020-10-21 21:50:05,511 INFO L226 Difference]: Without dead ends: 1002 [2020-10-21 21:50:05,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-10-21 21:50:05,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 1002. [2020-10-21 21:50:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2020-10-21 21:50:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 3026 transitions. [2020-10-21 21:50:05,541 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 3026 transitions. Word has length 18 [2020-10-21 21:50:05,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:05,541 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 3026 transitions. [2020-10-21 21:50:05,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:50:05,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 3026 transitions. [2020-10-21 21:50:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-21 21:50:05,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:05,545 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] [2020-10-21 21:50:05,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:50:05,545 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:05,545 INFO L82 PathProgramCache]: Analyzing trace with hash -658725959, now seen corresponding path program 1 times [2020-10-21 21:50:05,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:05,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623866954] [2020-10-21 21:50:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:05,626 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-21 21:50:05,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623866954] [2020-10-21 21:50:05,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:05,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:50:05,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628931892] [2020-10-21 21:50:05,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:50:05,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:50:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:50:05,629 INFO L87 Difference]: Start difference. First operand 1002 states and 3026 transitions. Second operand 6 states. [2020-10-21 21:50:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:05,696 INFO L93 Difference]: Finished difference Result 845 states and 2522 transitions. [2020-10-21 21:50:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:50:05,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-21 21:50:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:05,702 INFO L225 Difference]: With dead ends: 845 [2020-10-21 21:50:05,702 INFO L226 Difference]: Without dead ends: 746 [2020-10-21 21:50:05,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:50:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2020-10-21 21:50:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2020-10-21 21:50:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2020-10-21 21:50:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 2258 transitions. [2020-10-21 21:50:05,723 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 2258 transitions. Word has length 21 [2020-10-21 21:50:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:05,723 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 2258 transitions. [2020-10-21 21:50:05,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:50:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 2258 transitions. [2020-10-21 21:50:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-21 21:50:05,726 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:05,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:05,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:50:05,726 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -323714646, now seen corresponding path program 1 times [2020-10-21 21:50:05,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:05,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970980352] [2020-10-21 21:50:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:05,857 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-21 21:50:05,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970980352] [2020-10-21 21:50:05,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:05,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:50:05,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968867342] [2020-10-21 21:50:05,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:50:05,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:50:05,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:05,860 INFO L87 Difference]: Start difference. First operand 746 states and 2258 transitions. Second operand 7 states. [2020-10-21 21:50:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:05,953 INFO L93 Difference]: Finished difference Result 710 states and 2184 transitions. [2020-10-21 21:50:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:50:05,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-21 21:50:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:05,959 INFO L225 Difference]: With dead ends: 710 [2020-10-21 21:50:05,959 INFO L226 Difference]: Without dead ends: 694 [2020-10-21 21:50:05,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-21 21:50:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2020-10-21 21:50:05,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2020-10-21 21:50:05,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2020-10-21 21:50:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 2154 transitions. [2020-10-21 21:50:05,979 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 2154 transitions. Word has length 24 [2020-10-21 21:50:05,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:05,980 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 2154 transitions. [2020-10-21 21:50:05,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:50:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 2154 transitions. [2020-10-21 21:50:05,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:50:05,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:05,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:05,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:50:05,983 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:05,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:05,983 INFO L82 PathProgramCache]: Analyzing trace with hash 238875023, now seen corresponding path program 1 times [2020-10-21 21:50:05,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:05,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699206151] [2020-10-21 21:50:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:06,093 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-21 21:50:06,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699206151] [2020-10-21 21:50:06,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:06,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:50:06,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128650167] [2020-10-21 21:50:06,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:50:06,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:06,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:50:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:06,095 INFO L87 Difference]: Start difference. First operand 694 states and 2154 transitions. Second operand 5 states. [2020-10-21 21:50:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:06,132 INFO L93 Difference]: Finished difference Result 877 states and 2676 transitions. [2020-10-21 21:50:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:06,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-21 21:50:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:06,135 INFO L225 Difference]: With dead ends: 877 [2020-10-21 21:50:06,135 INFO L226 Difference]: Without dead ends: 358 [2020-10-21 21:50:06,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2020-10-21 21:50:06,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2020-10-21 21:50:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2020-10-21 21:50:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 993 transitions. [2020-10-21 21:50:06,146 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 993 transitions. Word has length 27 [2020-10-21 21:50:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:06,146 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 993 transitions. [2020-10-21 21:50:06,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:50:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 993 transitions. [2020-10-21 21:50:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:50:06,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:06,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:06,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:50:06,148 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:06,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 779162261, now seen corresponding path program 2 times [2020-10-21 21:50:06,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:06,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135289515] [2020-10-21 21:50:06,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:06,274 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-21 21:50:06,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135289515] [2020-10-21 21:50:06,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:06,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:50:06,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119185823] [2020-10-21 21:50:06,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:06,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:06,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:06,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:06,278 INFO L87 Difference]: Start difference. First operand 358 states and 993 transitions. Second operand 4 states. [2020-10-21 21:50:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:06,305 INFO L93 Difference]: Finished difference Result 457 states and 1252 transitions. [2020-10-21 21:50:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:50:06,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-21 21:50:06,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:06,307 INFO L225 Difference]: With dead ends: 457 [2020-10-21 21:50:06,307 INFO L226 Difference]: Without dead ends: 174 [2020-10-21 21:50:06,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-21 21:50:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2020-10-21 21:50:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-10-21 21:50:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 429 transitions. [2020-10-21 21:50:06,314 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 429 transitions. Word has length 27 [2020-10-21 21:50:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:06,314 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 429 transitions. [2020-10-21 21:50:06,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 429 transitions. [2020-10-21 21:50:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:50:06,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:06,317 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:06,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:50:06,317 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:06,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1540409849, now seen corresponding path program 3 times [2020-10-21 21:50:06,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:06,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912829692] [2020-10-21 21:50:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:06,494 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-21 21:50:06,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912829692] [2020-10-21 21:50:06,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:06,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:50:06,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065288462] [2020-10-21 21:50:06,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:50:06,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:06,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:50:06,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:06,496 INFO L87 Difference]: Start difference. First operand 174 states and 429 transitions. Second operand 5 states. [2020-10-21 21:50:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:06,529 INFO L93 Difference]: Finished difference Result 213 states and 516 transitions. [2020-10-21 21:50:06,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:06,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-10-21 21:50:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:06,530 INFO L225 Difference]: With dead ends: 213 [2020-10-21 21:50:06,531 INFO L226 Difference]: Without dead ends: 87 [2020-10-21 21:50:06,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-21 21:50:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-21 21:50:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-21 21:50:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 180 transitions. [2020-10-21 21:50:06,534 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 180 transitions. Word has length 27 [2020-10-21 21:50:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:06,534 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 180 transitions. [2020-10-21 21:50:06,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:50:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 180 transitions. [2020-10-21 21:50:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:50:06,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:06,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:06,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:50:06,536 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1777183393, now seen corresponding path program 4 times [2020-10-21 21:50:06,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:06,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460557968] [2020-10-21 21:50:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:50:07,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460557968] [2020-10-21 21:50:07,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:07,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-21 21:50:07,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770497685] [2020-10-21 21:50:07,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-21 21:50:07,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-21 21:50:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-10-21 21:50:07,104 INFO L87 Difference]: Start difference. First operand 87 states and 180 transitions. Second operand 13 states. [2020-10-21 21:50:07,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:07,865 INFO L93 Difference]: Finished difference Result 138 states and 267 transitions. [2020-10-21 21:50:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-21 21:50:07,865 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-10-21 21:50:07,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:07,866 INFO L225 Difference]: With dead ends: 138 [2020-10-21 21:50:07,866 INFO L226 Difference]: Without dead ends: 100 [2020-10-21 21:50:07,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2020-10-21 21:50:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-21 21:50:07,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2020-10-21 21:50:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-21 21:50:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 173 transitions. [2020-10-21 21:50:07,869 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 173 transitions. Word has length 27 [2020-10-21 21:50:07,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:07,870 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 173 transitions. [2020-10-21 21:50:07,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-21 21:50:07,870 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 173 transitions. [2020-10-21 21:50:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:50:07,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:07,871 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:07,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:50:07,871 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash -132857503, now seen corresponding path program 5 times [2020-10-21 21:50:07,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:07,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764057871] [2020-10-21 21:50:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:08,107 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-21 21:50:08,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764057871] [2020-10-21 21:50:08,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:08,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:50:08,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041699938] [2020-10-21 21:50:08,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:50:08,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:50:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:50:08,109 INFO L87 Difference]: Start difference. First operand 87 states and 173 transitions. Second operand 8 states. [2020-10-21 21:50:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:08,221 INFO L93 Difference]: Finished difference Result 106 states and 208 transitions. [2020-10-21 21:50:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 21:50:08,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-21 21:50:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:08,223 INFO L225 Difference]: With dead ends: 106 [2020-10-21 21:50:08,223 INFO L226 Difference]: Without dead ends: 55 [2020-10-21 21:50:08,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:50:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-21 21:50:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-10-21 21:50:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-21 21:50:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 94 transitions. [2020-10-21 21:50:08,225 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 94 transitions. Word has length 27 [2020-10-21 21:50:08,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:08,226 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 94 transitions. [2020-10-21 21:50:08,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:50:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 94 transitions. [2020-10-21 21:50:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 21:50:08,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:08,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:08,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 21:50:08,227 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash -88853699, now seen corresponding path program 6 times [2020-10-21 21:50:08,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:08,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063802046] [2020-10-21 21:50:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:50:08,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:50:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:50:08,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:50:08,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:50:08,370 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:50:08,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 21:50:08,403 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-21 21:50:08,404 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [814] [2020-10-21 21:50:08,404 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-21 21:50:08,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,405 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-21 21:50:08,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,405 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-21 21:50:08,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,406 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-21 21:50:08,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,406 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-21 21:50:08,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,406 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-21 21:50:08,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,407 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-21 21:50:08,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,407 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-21 21:50:08,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,407 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-21 21:50:08,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,408 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-21 21:50:08,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,408 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-21 21:50:08,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,408 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-21 21:50:08,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,409 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-21 21:50:08,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,409 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-21 21:50:08,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,411 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-21 21:50:08,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,412 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-21 21:50:08,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,412 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-21 21:50:08,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,412 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-21 21:50:08,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,413 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-21 21:50:08,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,413 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-21 21:50:08,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,414 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-21 21:50:08,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,414 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-21 21:50:08,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,414 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-21 21:50:08,414 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,415 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-21 21:50:08,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,415 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-21 21:50:08,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,416 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-21 21:50:08,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,416 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-21 21:50:08,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,416 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-21 21:50:08,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,417 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-21 21:50:08,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,417 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-21 21:50:08,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,417 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-21 21:50:08,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,418 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-21 21:50:08,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,419 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-21 21:50:08,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,419 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-21 21:50:08,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,420 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-21 21:50:08,420 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,420 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-21 21:50:08,420 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,420 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-21 21:50:08,420 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:08,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:50:08 BasicIcfg [2020-10-21 21:50:08,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:50:08,502 INFO L168 Benchmark]: Toolchain (without parser) took 14021.10 ms. Allocated memory was 137.4 MB in the beginning and 455.6 MB in the end (delta: 318.2 MB). Free memory was 98.4 MB in the beginning and 78.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 338.0 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,503 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.86 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 97.5 MB in the beginning and 148.3 MB in the end (delta: -50.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 145.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,505 INFO L168 Benchmark]: Boogie Preprocessor took 43.44 ms. Allocated memory is still 199.8 MB. Free memory was 145.5 MB in the beginning and 142.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,505 INFO L168 Benchmark]: RCFGBuilder took 2545.06 ms. Allocated memory was 199.8 MB in the beginning and 254.8 MB in the end (delta: 55.1 MB). Free memory was 142.6 MB in the beginning and 119.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 99.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,506 INFO L168 Benchmark]: TraceAbstraction took 10505.45 ms. Allocated memory was 254.8 MB in the beginning and 455.6 MB in the end (delta: 200.8 MB). Free memory was 117.9 MB in the beginning and 78.6 MB in the end (delta: 39.3 MB). Peak memory consumption was 240.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:08,512 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.86 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 97.5 MB in the beginning and 148.3 MB in the end (delta: -50.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.99 ms. Allocated memory is still 199.8 MB. Free memory was 148.3 MB in the beginning and 145.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.44 ms. Allocated memory is still 199.8 MB. Free memory was 145.5 MB in the beginning and 142.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2545.06 ms. Allocated memory was 199.8 MB in the beginning and 254.8 MB in the end (delta: 55.1 MB). Free memory was 142.6 MB in the beginning and 119.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 99.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10505.45 ms. Allocated memory was 254.8 MB in the beginning and 455.6 MB in the end (delta: 200.8 MB). Free memory was 117.9 MB in the beginning and 78.6 MB in the end (delta: 39.3 MB). Peak memory consumption was 240.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1812 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 51 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 212 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2734 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 7373 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t373; [L870] FCALL, FORK 0 pthread_create(&t373, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t374; [L872] FCALL, FORK 0 pthread_create(&t374, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t375; [L874] FCALL, FORK 0 pthread_create(&t375, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t376; [L876] FCALL, FORK 0 pthread_create(&t376, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1 [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = z [L802] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix014_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 387 SDtfs, 591 SDslu, 993 SDs, 0 SdLazy, 546 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3570occurred 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.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 39581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...