/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:09:31,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:09:31,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:09:31,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:09:31,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:09:31,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:09:31,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:09:31,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:09:31,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:09:31,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:09:31,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:09:31,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:09:31,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:09:31,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:09:31,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:09:31,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:09:31,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:09:31,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:09:31,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:09:31,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:09:31,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:09:31,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:09:31,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:09:31,163 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:09:31,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:09:31,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:09:31,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:09:31,166 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:09:31,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:09:31,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:09:31,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:09:31,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:09:31,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:09:31,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:09:31,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:09:31,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:09:31,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:09:31,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:09:31,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:09:31,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:09:31,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:09:31,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:09:31,195 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:09:31,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:09:31,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:09:31,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:09:31,197 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:09:31,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:09:31,197 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:09:31,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:09:31,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:09:31,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:09:31,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:09:31,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:09:31,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:09:31,198 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:09:31,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:09:31,199 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:09:31,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:09:31,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:09:31,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:09:31,200 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:09:31,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:09:31,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:09:31,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:09:31,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:09:31,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:09:31,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:09:31,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:09:31,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:09:31,201 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:09:31,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:09:31,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:09:31,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:09:31,531 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:09:31,531 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:09:31,532 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2020-10-16 05:09:31,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a789577/67daea9292a842ecb21ce414dda275d5/FLAG5e61b8521 [2020-10-16 05:09:32,136 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:09:32,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2020-10-16 05:09:32,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a789577/67daea9292a842ecb21ce414dda275d5/FLAG5e61b8521 [2020-10-16 05:09:32,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0a789577/67daea9292a842ecb21ce414dda275d5 [2020-10-16 05:09:32,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:09:32,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:09:32,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:09:32,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:09:32,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:09:32,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:09:32" (1/1) ... [2020-10-16 05:09:32,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132a106a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:32, skipping insertion in model container [2020-10-16 05:09:32,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:09:32" (1/1) ... [2020-10-16 05:09:32,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:09:32,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:09:33,024 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:09:33,040 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:09:33,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:09:33,175 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:09:33,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33 WrapperNode [2020-10-16 05:09:33,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:09:33,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:09:33,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:09:33,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:09:33,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:09:33,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:09:33,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:09:33,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:09:33,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (1/1) ... [2020-10-16 05:09:33,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:09:33,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:09:33,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:09:33,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:09:33,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (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-16 05:09:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:09:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:09:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:09:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:09:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:09:33,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:09:33,357 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:09:33,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:09:33,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:09:33,361 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:09:35,055 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:09:35,055 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:09:35,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:09:35 BoogieIcfgContainer [2020-10-16 05:09:35,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:09:35,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:09:35,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:09:35,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:09:35,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:09:32" (1/3) ... [2020-10-16 05:09:35,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cd4c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:09:35, skipping insertion in model container [2020-10-16 05:09:35,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:33" (2/3) ... [2020-10-16 05:09:35,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cd4c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:09:35, skipping insertion in model container [2020-10-16 05:09:35,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:09:35" (3/3) ... [2020-10-16 05:09:35,066 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2020-10-16 05:09:35,077 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:09:35,084 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:09:35,085 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:09:35,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,112 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,122 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,123 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,123 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:35,147 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 05:09:35,167 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:09:35,167 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:09:35,168 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:09:35,168 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:09:35,168 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:09:35,168 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:09:35,168 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:09:35,168 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:09:35,181 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 05:09:35,219 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 05:09:35,219 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:35,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 05:09:35,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 05:09:35,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:35,233 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:09:35,235 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:35,238 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:35,239 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:35,257 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 05:09:35,258 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:35,258 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 05:09:35,261 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 05:09:35,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:35,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:35,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:35,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:35,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:35,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:35,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:35,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:35,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:35,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:09:35,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:35,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:35,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:09:35,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:35,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:09:35,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:35,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:35,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:09:35,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:35,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:35,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:35,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:35,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:35,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:35,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:35,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:35,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:35,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:36,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:36,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:36,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:36,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:09:36,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:36,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:36,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:36,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:36,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:36,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:36,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:36,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:36,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:09:36,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:36,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:36,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:09:36,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:36,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,554 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:09:36,668 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 05:09:36,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:36,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:36,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:09:36,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:36,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:36,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:36,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:36,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:37,782 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 05:09:37,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:09:37,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:37,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:37,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:38,516 WARN L193 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 05:09:38,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:38,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:38,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:38,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:38,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:38,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:38,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:38,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:38,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:38,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:38,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:39,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:39,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:39,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:39,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:39,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:09:39,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:39,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:39,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:39,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:39,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:39,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:39,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:39,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:39,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:39,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:39,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:39,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:39,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:39,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:39,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:39,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:39,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:39,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:39,930 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:09:40,233 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:09:40,791 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 05:09:41,050 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 05:09:41,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:09:41,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,133 WARN L193 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2020-10-16 05:09:42,446 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:09:42,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:42,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:42,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:42,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:42,920 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 05:09:43,023 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-16 05:09:43,028 INFO L132 LiptonReduction]: Checked pairs total: 2125 [2020-10-16 05:09:43,028 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 05:09:43,031 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7801 [2020-10-16 05:09:43,035 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 05:09:43,035 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:43,035 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:43,036 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:09:43,036 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash 895506, now seen corresponding path program 1 times [2020-10-16 05:09:43,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:43,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547375658] [2020-10-16 05:09:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:43,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547375658] [2020-10-16 05:09:43,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:43,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:09:43,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199097605] [2020-10-16 05:09:43,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:09:43,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:43,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:09:43,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:09:43,289 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2020-10-16 05:09:43,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states. [2020-10-16 05:09:43,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:43,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2020-10-16 05:09:43,293 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:43,364 INFO L129 PetriNetUnfolder]: 23/59 cut-off events. [2020-10-16 05:09:43,364 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:43,365 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 59 events. 23/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 194 event pairs, 16 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 37 conditions per place. [2020-10-16 05:09:43,367 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 7 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 05:09:43,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 68 flow [2020-10-16 05:09:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2020-10-16 05:09:43,384 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7928571428571428 [2020-10-16 05:09:43,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2020-10-16 05:09:43,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2020-10-16 05:09:43,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:43,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2020-10-16 05:09:43,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:43,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:43,401 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:43,403 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 333 transitions. [2020-10-16 05:09:43,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 68 flow [2020-10-16 05:09:43,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:43,409 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2020-10-16 05:09:43,412 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 05:09:43,413 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 05:09:43,413 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2020-10-16 05:09:43,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:09:43,413 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:43,413 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:43,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:09:43,414 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:43,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1851001785, now seen corresponding path program 1 times [2020-10-16 05:09:43,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:43,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659288721] [2020-10-16 05:09:43,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:43,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659288721] [2020-10-16 05:09:43,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:43,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:09:43,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105967322] [2020-10-16 05:09:43,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:09:43,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:43,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:09:43,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:09:43,561 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 140 [2020-10-16 05:09:43,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states. [2020-10-16 05:09:43,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:43,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 140 [2020-10-16 05:09:43,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:43,608 INFO L129 PetriNetUnfolder]: 38/91 cut-off events. [2020-10-16 05:09:43,608 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 05:09:43,609 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 91 events. 38/91 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 30 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 171. Up to 72 conditions per place. [2020-10-16 05:09:43,610 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 8 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2020-10-16 05:09:43,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 18 transitions, 68 flow [2020-10-16 05:09:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2020-10-16 05:09:43,614 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2020-10-16 05:09:43,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2020-10-16 05:09:43,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2020-10-16 05:09:43,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:43,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2020-10-16 05:09:43,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:43,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:43,618 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:43,618 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 306 transitions. [2020-10-16 05:09:43,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 18 transitions, 68 flow [2020-10-16 05:09:43,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 18 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:43,619 INFO L241 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2020-10-16 05:09:43,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2020-10-16 05:09:43,620 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 05:09:43,620 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2020-10-16 05:09:43,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:09:43,621 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:43,621 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:43,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:09:43,621 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1546524851, now seen corresponding path program 1 times [2020-10-16 05:09:43,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:43,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588206129] [2020-10-16 05:09:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:43,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588206129] [2020-10-16 05:09:43,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:43,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:09:43,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869061678] [2020-10-16 05:09:43,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:09:43,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:43,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:09:43,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:09:43,703 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 140 [2020-10-16 05:09:43,704 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states. [2020-10-16 05:09:43,704 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:43,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 140 [2020-10-16 05:09:43,704 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:43,791 INFO L129 PetriNetUnfolder]: 33/87 cut-off events. [2020-10-16 05:09:43,791 INFO L130 PetriNetUnfolder]: For 17/20 co-relation queries the response was YES. [2020-10-16 05:09:43,792 INFO L80 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 87 events. 33/87 cut-off events. For 17/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 326 event pairs, 4 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 179. Up to 55 conditions per place. [2020-10-16 05:09:43,792 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 10 selfloop transitions, 4 changer transitions 0/21 dead transitions. [2020-10-16 05:09:43,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 89 flow [2020-10-16 05:09:43,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:09:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:09:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2020-10-16 05:09:43,802 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7267857142857143 [2020-10-16 05:09:43,802 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2020-10-16 05:09:43,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2020-10-16 05:09:43,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:43,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2020-10-16 05:09:43,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:09:43,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:09:43,810 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:09:43,810 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 407 transitions. [2020-10-16 05:09:43,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 89 flow [2020-10-16 05:09:43,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:09:43,812 INFO L241 Difference]: Finished difference. Result has 26 places, 17 transitions, 62 flow [2020-10-16 05:09:43,812 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2020-10-16 05:09:43,813 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2020-10-16 05:09:43,813 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 62 flow [2020-10-16 05:09:43,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:09:43,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:43,817 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:43,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:09:43,818 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:43,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1546480800, now seen corresponding path program 1 times [2020-10-16 05:09:43,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:43,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218094973] [2020-10-16 05:09:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:43,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218094973] [2020-10-16 05:09:43,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:43,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:09:43,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516208095] [2020-10-16 05:09:43,899 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:09:43,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:43,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:09:43,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:09:43,901 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 05:09:43,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 62 flow. Second operand 3 states. [2020-10-16 05:09:43,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:43,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 05:09:43,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:43,945 INFO L129 PetriNetUnfolder]: 28/74 cut-off events. [2020-10-16 05:09:43,945 INFO L130 PetriNetUnfolder]: For 48/50 co-relation queries the response was YES. [2020-10-16 05:09:43,946 INFO L80 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 74 events. 28/74 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 18 based on Foata normal form. 3/75 useless extension candidates. Maximal degree in co-relation 158. Up to 47 conditions per place. [2020-10-16 05:09:43,946 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 8 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2020-10-16 05:09:43,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 20 transitions, 90 flow [2020-10-16 05:09:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:43,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2020-10-16 05:09:43,949 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7404761904761905 [2020-10-16 05:09:43,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2020-10-16 05:09:43,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2020-10-16 05:09:43,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:43,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2020-10-16 05:09:43,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:43,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:43,952 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:43,952 INFO L185 Difference]: Start difference. First operand has 26 places, 17 transitions, 62 flow. Second operand 3 states and 311 transitions. [2020-10-16 05:09:43,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 20 transitions, 90 flow [2020-10-16 05:09:43,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 20 transitions, 82 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:43,953 INFO L241 Difference]: Finished difference. Result has 27 places, 17 transitions, 65 flow [2020-10-16 05:09:43,954 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=27, PETRI_TRANSITIONS=17} [2020-10-16 05:09:43,954 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2020-10-16 05:09:43,954 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 65 flow [2020-10-16 05:09:43,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:09:43,954 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:43,954 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:43,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:09:43,955 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:43,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:43,955 INFO L82 PathProgramCache]: Analyzing trace with hash -696265198, now seen corresponding path program 1 times [2020-10-16 05:09:43,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:43,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027415320] [2020-10-16 05:09:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:44,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-16 05:09:44,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027415320] [2020-10-16 05:09:44,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:44,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:44,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861742394] [2020-10-16 05:09:44,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:44,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:44,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:44,098 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 140 [2020-10-16 05:09:44,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 65 flow. Second operand 5 states. [2020-10-16 05:09:44,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:44,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 140 [2020-10-16 05:09:44,099 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:44,196 INFO L129 PetriNetUnfolder]: 24/66 cut-off events. [2020-10-16 05:09:44,196 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2020-10-16 05:09:44,197 INFO L80 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 66 events. 24/66 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 200 event pairs, 7 based on Foata normal form. 4/70 useless extension candidates. Maximal degree in co-relation 158. Up to 29 conditions per place. [2020-10-16 05:09:44,197 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 10 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2020-10-16 05:09:44,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 109 flow [2020-10-16 05:09:44,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:09:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:09:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2020-10-16 05:09:44,204 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6910714285714286 [2020-10-16 05:09:44,204 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2020-10-16 05:09:44,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2020-10-16 05:09:44,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:44,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2020-10-16 05:09:44,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:09:44,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:09:44,206 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:09:44,206 INFO L185 Difference]: Start difference. First operand has 27 places, 17 transitions, 65 flow. Second operand 4 states and 387 transitions. [2020-10-16 05:09:44,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 109 flow [2020-10-16 05:09:44,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 101 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:44,208 INFO L241 Difference]: Finished difference. Result has 29 places, 19 transitions, 81 flow [2020-10-16 05:09:44,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2020-10-16 05:09:44,209 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2020-10-16 05:09:44,209 INFO L481 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 81 flow [2020-10-16 05:09:44,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:44,209 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:44,209 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:44,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:09:44,209 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:44,210 INFO L82 PathProgramCache]: Analyzing trace with hash 903999185, now seen corresponding path program 1 times [2020-10-16 05:09:44,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:44,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136469122] [2020-10-16 05:09:44,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:44,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:44,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136469122] [2020-10-16 05:09:44,260 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:44,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:09:44,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516822970] [2020-10-16 05:09:44,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:09:44,261 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:09:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:09:44,262 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 140 [2020-10-16 05:09:44,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 81 flow. Second operand 3 states. [2020-10-16 05:09:44,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:44,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 140 [2020-10-16 05:09:44,263 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:44,285 INFO L129 PetriNetUnfolder]: 6/44 cut-off events. [2020-10-16 05:09:44,285 INFO L130 PetriNetUnfolder]: For 60/69 co-relation queries the response was YES. [2020-10-16 05:09:44,285 INFO L80 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 44 events. 6/44 cut-off events. For 60/69 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 133 event pairs, 1 based on Foata normal form. 6/50 useless extension candidates. Maximal degree in co-relation 98. Up to 18 conditions per place. [2020-10-16 05:09:44,286 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 4 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2020-10-16 05:09:44,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 20 transitions, 97 flow [2020-10-16 05:09:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2020-10-16 05:09:44,288 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2020-10-16 05:09:44,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2020-10-16 05:09:44,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2020-10-16 05:09:44,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:44,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2020-10-16 05:09:44,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:44,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:44,291 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:44,291 INFO L185 Difference]: Start difference. First operand has 29 places, 19 transitions, 81 flow. Second operand 3 states and 348 transitions. [2020-10-16 05:09:44,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 20 transitions, 97 flow [2020-10-16 05:09:44,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 20 transitions, 91 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:44,293 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 89 flow [2020-10-16 05:09:44,294 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2020-10-16 05:09:44,294 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2020-10-16 05:09:44,294 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 89 flow [2020-10-16 05:09:44,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:09:44,294 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:44,294 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:44,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:09:44,295 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:44,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2122055121, now seen corresponding path program 2 times [2020-10-16 05:09:44,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:44,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113204068] [2020-10-16 05:09:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:44,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113204068] [2020-10-16 05:09:44,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:44,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:44,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760665336] [2020-10-16 05:09:44,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:09:44,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:09:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:09:44,387 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2020-10-16 05:09:44,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 89 flow. Second operand 4 states. [2020-10-16 05:09:44,387 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:44,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2020-10-16 05:09:44,388 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:44,432 INFO L129 PetriNetUnfolder]: 19/87 cut-off events. [2020-10-16 05:09:44,432 INFO L130 PetriNetUnfolder]: For 47/48 co-relation queries the response was YES. [2020-10-16 05:09:44,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 87 events. 19/87 cut-off events. For 47/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 375 event pairs, 6 based on Foata normal form. 11/95 useless extension candidates. Maximal degree in co-relation 195. Up to 40 conditions per place. [2020-10-16 05:09:44,434 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 4 selfloop transitions, 5 changer transitions 3/27 dead transitions. [2020-10-16 05:09:44,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 127 flow [2020-10-16 05:09:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:09:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:09:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2020-10-16 05:09:44,439 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8057142857142857 [2020-10-16 05:09:44,439 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2020-10-16 05:09:44,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2020-10-16 05:09:44,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:44,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2020-10-16 05:09:44,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:09:44,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:09:44,443 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:09:44,443 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 89 flow. Second operand 5 states and 564 transitions. [2020-10-16 05:09:44,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 127 flow [2020-10-16 05:09:44,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 27 transitions, 125 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:09:44,446 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 124 flow [2020-10-16 05:09:44,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2020-10-16 05:09:44,446 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2020-10-16 05:09:44,446 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 124 flow [2020-10-16 05:09:44,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:09:44,447 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:44,447 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:44,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:09:44,447 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:44,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1788609796, now seen corresponding path program 1 times [2020-10-16 05:09:44,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:44,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55220005] [2020-10-16 05:09:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:09:44,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55220005] [2020-10-16 05:09:44,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:44,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:09:44,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523373951] [2020-10-16 05:09:44,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:44,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:44,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:44,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:44,579 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2020-10-16 05:09:44,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 124 flow. Second operand 5 states. [2020-10-16 05:09:44,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:44,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2020-10-16 05:09:44,580 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:44,635 INFO L129 PetriNetUnfolder]: 8/61 cut-off events. [2020-10-16 05:09:44,636 INFO L130 PetriNetUnfolder]: For 75/100 co-relation queries the response was YES. [2020-10-16 05:09:44,636 INFO L80 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 61 events. 8/61 cut-off events. For 75/100 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 227 event pairs, 0 based on Foata normal form. 34/95 useless extension candidates. Maximal degree in co-relation 182. Up to 24 conditions per place. [2020-10-16 05:09:44,637 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 2 selfloop transitions, 8 changer transitions 5/27 dead transitions. [2020-10-16 05:09:44,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 27 transitions, 162 flow [2020-10-16 05:09:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:09:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:09:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 784 transitions. [2020-10-16 05:09:44,642 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8 [2020-10-16 05:09:44,642 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 784 transitions. [2020-10-16 05:09:44,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 784 transitions. [2020-10-16 05:09:44,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:44,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 784 transitions. [2020-10-16 05:09:44,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:09:44,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:09:44,646 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:09:44,647 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 124 flow. Second operand 7 states and 784 transitions. [2020-10-16 05:09:44,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 27 transitions, 162 flow [2020-10-16 05:09:44,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 27 transitions, 150 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:44,649 INFO L241 Difference]: Finished difference. Result has 43 places, 22 transitions, 130 flow [2020-10-16 05:09:44,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2020-10-16 05:09:44,650 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2020-10-16 05:09:44,650 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 22 transitions, 130 flow [2020-10-16 05:09:44,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:44,650 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:44,650 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:44,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:09:44,650 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:44,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1567428856, now seen corresponding path program 1 times [2020-10-16 05:09:44,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:44,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737460524] [2020-10-16 05:09:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:09:44,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:09:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:09:44,735 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:09:44,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:09:44,785 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:09:44,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:09:44,786 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:09:44,795 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L786-->L793: Formula: (let ((.cse7 (= (mod ~y$w_buff1_used~0_In414947562 256) 0)) (.cse6 (= (mod ~y$r_buff1_thd0~0_In414947562 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In414947562 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In414947562 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (or .cse7 .cse6)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In414947562 ~y$r_buff0_thd0~0_Out414947562) (= ~y$r_buff1_thd0~0_In414947562 ~y$r_buff1_thd0~0_Out414947562) (= ULTIMATE.start_assume_abort_if_not_~cond_Out414947562 |ULTIMATE.start_assume_abort_if_not_#in~cond_In414947562|) (or (and .cse0 (or (and .cse1 (= ~y~0_Out414947562 ~y~0_In414947562)) (and (= ~y~0_Out414947562 ~y$w_buff1~0_In414947562) .cse2 .cse3))) (and (= ~y$w_buff0~0_In414947562 ~y~0_Out414947562) .cse4 .cse5)) (or (and .cse0 (= ~y$w_buff0_used~0_Out414947562 ~y$w_buff0_used~0_In414947562)) (and (= ~y$w_buff0_used~0_Out414947562 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out414947562 0)) (or (and (= ~y$w_buff1_used~0_Out414947562 ~y$w_buff1_used~0_In414947562) .cse1) (and (= ~y$w_buff1_used~0_Out414947562 0) .cse2 .cse3))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In414947562|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In414947562, ~y$w_buff1~0=~y$w_buff1~0_In414947562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In414947562, ~y$w_buff0~0=~y$w_buff0~0_In414947562, ~y~0=~y~0_In414947562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In414947562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In414947562} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out414947562, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out414947562|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out414947562|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out414947562|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out414947562|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out414947562|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out414947562|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In414947562|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out414947562, ~y$w_buff1~0=~y$w_buff1~0_In414947562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out414947562, ~y$w_buff0~0=~y$w_buff0~0_In414947562, ~y~0=~y~0_Out414947562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out414947562, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out414947562} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 05:09:44,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,804 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,805 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,805 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,805 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,805 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,806 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,806 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,806 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,807 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,808 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,808 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,809 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,809 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,811 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,811 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,812 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,813 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,813 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,813 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,814 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,818 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,818 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,819 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:44,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:44,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:09:44 BasicIcfg [2020-10-16 05:09:44,888 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:09:44,893 INFO L168 Benchmark]: Toolchain (without parser) took 12447.38 ms. Allocated memory was 251.1 MB in the beginning and 543.2 MB in the end (delta: 292.0 MB). Free memory was 206.2 MB in the beginning and 452.2 MB in the end (delta: -246.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:44,894 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:09:44,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.82 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 206.2 MB in the beginning and 265.3 MB in the end (delta: -59.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:44,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.71 ms. Allocated memory is still 314.6 MB. Free memory was 265.3 MB in the beginning and 262.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:44,897 INFO L168 Benchmark]: Boogie Preprocessor took 47.85 ms. Allocated memory is still 314.6 MB. Free memory was 262.8 MB in the beginning and 260.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:44,899 INFO L168 Benchmark]: RCFGBuilder took 1770.08 ms. Allocated memory was 314.6 MB in the beginning and 357.6 MB in the end (delta: 43.0 MB). Free memory was 260.3 MB in the beginning and 212.1 MB in the end (delta: 48.2 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:44,900 INFO L168 Benchmark]: TraceAbstraction took 9829.50 ms. Allocated memory was 357.6 MB in the beginning and 543.2 MB in the end (delta: 185.6 MB). Free memory was 208.9 MB in the beginning and 452.2 MB in the end (delta: -243.4 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:09:44,910 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 731.82 ms. Allocated memory was 251.1 MB in the beginning and 314.6 MB in the end (delta: 63.4 MB). Free memory was 206.2 MB in the beginning and 265.3 MB in the end (delta: -59.1 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.71 ms. Allocated memory is still 314.6 MB. Free memory was 265.3 MB in the beginning and 262.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.85 ms. Allocated memory is still 314.6 MB. Free memory was 262.8 MB in the beginning and 260.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1770.08 ms. Allocated memory was 314.6 MB in the beginning and 357.6 MB in the end (delta: 43.0 MB). Free memory was 260.3 MB in the beginning and 212.1 MB in the end (delta: 48.2 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9829.50 ms. Allocated memory was 357.6 MB in the beginning and 543.2 MB in the end (delta: 185.6 MB). Free memory was 208.9 MB in the beginning and 452.2 MB in the end (delta: -243.4 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 582 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.7s, 77 PlacesBefore, 24 PlacesAfterwards, 72 TransitionsBefore, 17 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2125 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L703] 0 int y = 0; [L704] 0 _Bool y$flush_delayed; [L705] 0 int y$mem_tmp; [L706] 0 _Bool y$r_buff0_thd0; [L707] 0 _Bool y$r_buff0_thd1; [L708] 0 _Bool y$r_buff0_thd2; [L709] 0 _Bool y$r_buff1_thd0; [L710] 0 _Bool y$r_buff1_thd1; [L711] 0 _Bool y$r_buff1_thd2; [L712] 0 _Bool y$read_delayed; [L713] 0 int *y$read_delayed_var; [L714] 0 int y$w_buff0; [L715] 0 _Bool y$w_buff0_used; [L716] 0 int y$w_buff1; [L717] 0 _Bool y$w_buff1_used; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2473; [L780] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 1 y$w_buff1 = y$w_buff0 [L724] 1 y$w_buff0 = 2 [L725] 1 y$w_buff1_used = y$w_buff0_used [L726] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L728] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 pthread_t t2474; [L782] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 y$flush_delayed = weak$$choice2 [L798] 0 y$mem_tmp = y [L799] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L800] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L807] 0 y = y$flush_delayed ? y$mem_tmp : y [L808] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 36 SDtfs, 7 SDslu, 5 SDs, 0 SdLazy, 104 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 3209 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...