/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:16:46,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:16:46,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:16:46,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:16:46,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:16:46,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:16:46,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:16:46,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:16:46,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:16:46,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:16:46,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:16:46,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:16:46,327 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:16:46,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:16:46,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:16:46,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:16:46,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:16:46,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:16:46,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:16:46,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:16:46,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:16:46,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:16:46,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:16:46,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:16:46,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:16:46,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:16:46,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:16:46,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:16:46,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:16:46,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:16:46,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:16:46,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:16:46,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:16:46,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:16:46,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:16:46,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:16:46,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:16:46,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:16:46,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:16:46,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:16:46,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:16:46,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:16:46,411 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:16:46,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:16:46,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:16:46,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:16:46,413 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:16:46,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:16:46,414 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:16:46,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:16:46,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:16:46,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:16:46,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:16:46,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:16:46,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:16:46,417 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:16:46,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:16:46,417 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:16:46,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:16:46,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:16:46,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:16:46,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:16:46,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:16:46,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:16:46,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:16:46,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:16:46,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:16:46,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:16:46,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:16:46,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:16:46,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:16:46,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:16:46,738 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:16:46,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:16:46,743 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:16:46,744 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:16:46,744 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2020-10-15 22:16:46,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7780d9e2e/b2e29b6a5b0c49e5897e07667552f32c/FLAGe6c4f4c96 [2020-10-15 22:16:47,380 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:16:47,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2020-10-15 22:16:47,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7780d9e2e/b2e29b6a5b0c49e5897e07667552f32c/FLAGe6c4f4c96 [2020-10-15 22:16:47,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7780d9e2e/b2e29b6a5b0c49e5897e07667552f32c [2020-10-15 22:16:47,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:16:47,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:16:47,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:16:47,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:16:47,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:16:47,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:16:47" (1/1) ... [2020-10-15 22:16:47,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e9e907 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:47, skipping insertion in model container [2020-10-15 22:16:47,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:16:47" (1/1) ... [2020-10-15 22:16:47,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:16:47,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:16:48,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:16:48,301 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:16:48,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:16:48,436 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:16:48,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48 WrapperNode [2020-10-15 22:16:48,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:16:48,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:16:48,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:16:48,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:16:48,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:16:48,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:16:48,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:16:48,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:16:48,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... [2020-10-15 22:16:48,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:16:48,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:16:48,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:16:48,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:16:48,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:16:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:16:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:16:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:16:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:16:48,623 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:16:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:16:48,624 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:16:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:16:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:16:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:16:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:16:48,627 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:16:50,552 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:16:50,552 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:16:50,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:16:50 BoogieIcfgContainer [2020-10-15 22:16:50,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:16:50,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:16:50,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:16:50,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:16:50,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:16:47" (1/3) ... [2020-10-15 22:16:50,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd4d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:16:50, skipping insertion in model container [2020-10-15 22:16:50,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:48" (2/3) ... [2020-10-15 22:16:50,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd4d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:16:50, skipping insertion in model container [2020-10-15 22:16:50,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:16:50" (3/3) ... [2020-10-15 22:16:50,564 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2020-10-15 22:16:50,575 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:16:50,576 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:16:50,583 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:16:50,584 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:16:50,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,614 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,614 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,621 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,623 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,626 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,635 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,636 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,636 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,642 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,652 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:50,668 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 22:16:50,689 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:16:50,689 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:16:50,690 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:16:50,690 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:16:50,690 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:16:50,690 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:16:50,690 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:16:50,690 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:16:50,704 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:16:50,707 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-15 22:16:50,710 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-15 22:16:50,712 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-15 22:16:50,756 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-15 22:16:50,756 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:16:50,761 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-15 22:16:50,764 INFO L117 LiptonReduction]: Number of co-enabled transitions 1544 [2020-10-15 22:16:50,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:50,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:50,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:50,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:50,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:50,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:51,320 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 22:16:51,435 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 22:16:51,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:16:51,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:51,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:51,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:51,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:51,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:51,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:51,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:51,869 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-15 22:16:52,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:52,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:16:52,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:16:52,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:52,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:52,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:52,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:52,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:16:52,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:52,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:52,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 22:16:52,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:53,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:16:53,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:53,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 22:16:53,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:53,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:53,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:53,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:53,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:53,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:53,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:53,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:53,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:53,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:53,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 22:16:53,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:53,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:54,444 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-15 22:16:54,547 INFO L132 LiptonReduction]: Checked pairs total: 3724 [2020-10-15 22:16:54,547 INFO L134 LiptonReduction]: Total number of compositions: 73 [2020-10-15 22:16:54,554 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-15 22:16:54,612 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-15 22:16:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-15 22:16:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-15 22:16:54,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:54,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-15 22:16:54,623 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:54,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash 907185274, now seen corresponding path program 1 times [2020-10-15 22:16:54,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:54,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128151796] [2020-10-15 22:16:54,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:54,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128151796] [2020-10-15 22:16:54,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:54,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:16:54,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161589421] [2020-10-15 22:16:54,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:16:54,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:54,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:16:54,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:16:54,912 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-15 22:16:54,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:54,997 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-15 22:16:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:16:55,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-15 22:16:55,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:55,022 INFO L225 Difference]: With dead ends: 650 [2020-10-15 22:16:55,022 INFO L226 Difference]: Without dead ends: 550 [2020-10-15 22:16:55,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:16:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-15 22:16:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-10-15 22:16:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-15 22:16:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-10-15 22:16:55,127 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 5 [2020-10-15 22:16:55,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:55,128 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-10-15 22:16:55,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:16:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-10-15 22:16:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 22:16:55,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:55,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:55,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:16:55,134 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -635619955, now seen corresponding path program 1 times [2020-10-15 22:16:55,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:55,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861742394] [2020-10-15 22:16:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:55,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861742394] [2020-10-15 22:16:55,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:55,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:16:55,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474349283] [2020-10-15 22:16:55,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:55,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:55,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:55,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:55,270 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-10-15 22:16:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:55,309 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-10-15 22:16:55,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:55,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-15 22:16:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:55,315 INFO L225 Difference]: With dead ends: 630 [2020-10-15 22:16:55,316 INFO L226 Difference]: Without dead ends: 530 [2020-10-15 22:16:55,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-15 22:16:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-15 22:16:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-15 22:16:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-10-15 22:16:55,347 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-10-15 22:16:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:55,349 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-10-15 22:16:55,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-10-15 22:16:55,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:16:55,351 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:55,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:55,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:16:55,354 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash -36008682, now seen corresponding path program 1 times [2020-10-15 22:16:55,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:55,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743740988] [2020-10-15 22:16:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:55,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743740988] [2020-10-15 22:16:55,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:55,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:16:55,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350563026] [2020-10-15 22:16:55,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:55,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:55,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:55,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:55,458 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-10-15 22:16:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:55,494 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2020-10-15 22:16:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:55,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 22:16:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:55,499 INFO L225 Difference]: With dead ends: 593 [2020-10-15 22:16:55,499 INFO L226 Difference]: Without dead ends: 518 [2020-10-15 22:16:55,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2020-10-15 22:16:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2020-10-15 22:16:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-10-15 22:16:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1573 transitions. [2020-10-15 22:16:55,517 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1573 transitions. Word has length 11 [2020-10-15 22:16:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:55,518 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1573 transitions. [2020-10-15 22:16:55,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1573 transitions. [2020-10-15 22:16:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:16:55,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:55,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:55,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:16:55,521 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1142318475, now seen corresponding path program 1 times [2020-10-15 22:16:55,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:55,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412647472] [2020-10-15 22:16:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:55,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412647472] [2020-10-15 22:16:55,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:55,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:55,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960473039] [2020-10-15 22:16:55,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:55,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:55,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:55,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:55,664 INFO L87 Difference]: Start difference. First operand 518 states and 1573 transitions. Second operand 4 states. [2020-10-15 22:16:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:55,707 INFO L93 Difference]: Finished difference Result 450 states and 1184 transitions. [2020-10-15 22:16:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:55,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 22:16:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:55,710 INFO L225 Difference]: With dead ends: 450 [2020-10-15 22:16:55,710 INFO L226 Difference]: Without dead ends: 350 [2020-10-15 22:16:55,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-10-15 22:16:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2020-10-15 22:16:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-10-15 22:16:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 901 transitions. [2020-10-15 22:16:55,721 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 901 transitions. Word has length 12 [2020-10-15 22:16:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:55,722 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 901 transitions. [2020-10-15 22:16:55,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 901 transitions. [2020-10-15 22:16:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:16:55,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:55,724 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:55,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:16:55,724 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:55,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:55,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2134645641, now seen corresponding path program 1 times [2020-10-15 22:16:55,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:55,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889089975] [2020-10-15 22:16:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:55,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889089975] [2020-10-15 22:16:55,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:55,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:16:55,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135917070] [2020-10-15 22:16:55,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:16:55,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:16:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:55,862 INFO L87 Difference]: Start difference. First operand 350 states and 901 transitions. Second operand 5 states. [2020-10-15 22:16:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:55,938 INFO L93 Difference]: Finished difference Result 250 states and 576 transitions. [2020-10-15 22:16:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:16:55,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-15 22:16:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:55,941 INFO L225 Difference]: With dead ends: 250 [2020-10-15 22:16:55,941 INFO L226 Difference]: Without dead ends: 198 [2020-10-15 22:16:55,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:55,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-15 22:16:55,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2020-10-15 22:16:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2020-10-15 22:16:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 445 transitions. [2020-10-15 22:16:55,948 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 445 transitions. Word has length 14 [2020-10-15 22:16:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:55,948 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 445 transitions. [2020-10-15 22:16:55,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:16:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 445 transitions. [2020-10-15 22:16:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:16:55,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:55,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:55,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:16:55,950 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash 844900567, now seen corresponding path program 1 times [2020-10-15 22:16:55,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:55,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896198983] [2020-10-15 22:16:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:56,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896198983] [2020-10-15 22:16:56,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:56,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:56,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954477621] [2020-10-15 22:16:56,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:56,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:56,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:56,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:56,143 INFO L87 Difference]: Start difference. First operand 198 states and 445 transitions. Second operand 4 states. [2020-10-15 22:16:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:56,173 INFO L93 Difference]: Finished difference Result 282 states and 608 transitions. [2020-10-15 22:16:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:56,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 22:16:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:56,175 INFO L225 Difference]: With dead ends: 282 [2020-10-15 22:16:56,175 INFO L226 Difference]: Without dead ends: 202 [2020-10-15 22:16:56,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-10-15 22:16:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 196. [2020-10-15 22:16:56,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-15 22:16:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 423 transitions. [2020-10-15 22:16:56,181 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 423 transitions. Word has length 17 [2020-10-15 22:16:56,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:56,182 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 423 transitions. [2020-10-15 22:16:56,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 423 transitions. [2020-10-15 22:16:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:16:56,183 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:56,183 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:56,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:16:56,184 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -943597129, now seen corresponding path program 1 times [2020-10-15 22:16:56,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:56,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947745991] [2020-10-15 22:16:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:56,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947745991] [2020-10-15 22:16:56,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:56,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:56,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257150525] [2020-10-15 22:16:56,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:56,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:56,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:56,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:56,297 INFO L87 Difference]: Start difference. First operand 196 states and 423 transitions. Second operand 4 states. [2020-10-15 22:16:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:56,322 INFO L93 Difference]: Finished difference Result 276 states and 566 transitions. [2020-10-15 22:16:56,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:56,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 22:16:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:56,324 INFO L225 Difference]: With dead ends: 276 [2020-10-15 22:16:56,324 INFO L226 Difference]: Without dead ends: 194 [2020-10-15 22:16:56,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-15 22:16:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 188. [2020-10-15 22:16:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-10-15 22:16:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 387 transitions. [2020-10-15 22:16:56,331 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 387 transitions. Word has length 17 [2020-10-15 22:16:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:56,331 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 387 transitions. [2020-10-15 22:16:56,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 387 transitions. [2020-10-15 22:16:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:16:56,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:56,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:56,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:16:56,333 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2064873241, now seen corresponding path program 2 times [2020-10-15 22:16:56,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:56,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294227299] [2020-10-15 22:16:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:56,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294227299] [2020-10-15 22:16:56,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:56,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:16:56,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850835138] [2020-10-15 22:16:56,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:16:56,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:16:56,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:56,429 INFO L87 Difference]: Start difference. First operand 188 states and 387 transitions. Second operand 6 states. [2020-10-15 22:16:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:56,487 INFO L93 Difference]: Finished difference Result 160 states and 331 transitions. [2020-10-15 22:16:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:16:56,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-15 22:16:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:56,489 INFO L225 Difference]: With dead ends: 160 [2020-10-15 22:16:56,489 INFO L226 Difference]: Without dead ends: 62 [2020-10-15 22:16:56,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:16:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-15 22:16:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-15 22:16:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-15 22:16:56,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2020-10-15 22:16:56,496 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 17 [2020-10-15 22:16:56,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:56,496 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2020-10-15 22:16:56,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:16:56,496 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2020-10-15 22:16:56,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:16:56,497 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:56,497 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:56,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:16:56,498 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash -60410364, now seen corresponding path program 1 times [2020-10-15 22:16:56,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:56,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044768530] [2020-10-15 22:16:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:56,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044768530] [2020-10-15 22:16:56,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:56,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:16:56,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331608467] [2020-10-15 22:16:56,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:16:56,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:16:56,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:16:56,765 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 8 states. [2020-10-15 22:16:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:56,990 INFO L93 Difference]: Finished difference Result 97 states and 168 transitions. [2020-10-15 22:16:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:16:56,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-15 22:16:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:56,992 INFO L225 Difference]: With dead ends: 97 [2020-10-15 22:16:56,992 INFO L226 Difference]: Without dead ends: 62 [2020-10-15 22:16:56,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:16:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-15 22:16:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2020-10-15 22:16:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-15 22:16:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-15 22:16:56,995 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-10-15 22:16:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:56,996 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-15 22:16:56,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:16:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-15 22:16:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:16:56,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:56,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:56,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:16:56,999 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1813740604, now seen corresponding path program 2 times [2020-10-15 22:16:56,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:57,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788638305] [2020-10-15 22:16:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 22:16:57,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788638305] [2020-10-15 22:16:57,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:57,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 22:16:57,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026898233] [2020-10-15 22:16:57,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 22:16:57,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:57,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 22:16:57,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-15 22:16:57,191 INFO L87 Difference]: Start difference. First operand 50 states and 85 transitions. Second operand 8 states. [2020-10-15 22:16:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:57,339 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2020-10-15 22:16:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:16:57,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-10-15 22:16:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:57,340 INFO L225 Difference]: With dead ends: 70 [2020-10-15 22:16:57,341 INFO L226 Difference]: Without dead ends: 51 [2020-10-15 22:16:57,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-15 22:16:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-15 22:16:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2020-10-15 22:16:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-15 22:16:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2020-10-15 22:16:57,344 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2020-10-15 22:16:57,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:57,344 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2020-10-15 22:16:57,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 22:16:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2020-10-15 22:16:57,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:16:57,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:57,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:57,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:16:57,345 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:57,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:57,346 INFO L82 PathProgramCache]: Analyzing trace with hash -883528708, now seen corresponding path program 3 times [2020-10-15 22:16:57,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:57,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814616810] [2020-10-15 22:16:57,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:16:57,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:16:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:16:57,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:16:57,474 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:16:57,475 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:16:57,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:16:57,498 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,500 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,501 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,502 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,503 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,503 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,504 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,505 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,506 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,507 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,508 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,509 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,510 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,511 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 22:16:57,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:57,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:16:57 BasicIcfg [2020-10-15 22:16:57,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:16:57,579 INFO L168 Benchmark]: Toolchain (without parser) took 9908.07 ms. Allocated memory was 251.7 MB in the beginning and 512.8 MB in the end (delta: 261.1 MB). Free memory was 206.7 MB in the beginning and 161.4 MB in the end (delta: 45.3 MB). Peak memory consumption was 306.4 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:57,579 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:16:57,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.89 ms. Allocated memory was 251.7 MB in the beginning and 315.1 MB in the end (delta: 63.4 MB). Free memory was 206.7 MB in the beginning and 267.7 MB in the end (delta: -61.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:57,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.19 ms. Allocated memory is still 315.1 MB. Free memory was 267.7 MB in the beginning and 265.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:57,582 INFO L168 Benchmark]: Boogie Preprocessor took 56.86 ms. Allocated memory is still 315.1 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:57,582 INFO L168 Benchmark]: RCFGBuilder took 1996.12 ms. Allocated memory was 315.1 MB in the beginning and 359.1 MB in the end (delta: 44.0 MB). Free memory was 262.7 MB in the beginning and 214.4 MB in the end (delta: 48.3 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:57,583 INFO L168 Benchmark]: TraceAbstraction took 7021.01 ms. Allocated memory was 359.1 MB in the beginning and 512.8 MB in the end (delta: 153.6 MB). Free memory was 211.0 MB in the beginning and 161.4 MB in the end (delta: 49.6 MB). Peak memory consumption was 203.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:57,612 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.26 ms. Allocated memory is still 251.7 MB. Free memory is still 228.0 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 764.89 ms. Allocated memory was 251.7 MB in the beginning and 315.1 MB in the end (delta: 63.4 MB). Free memory was 206.7 MB in the beginning and 267.7 MB in the end (delta: -61.0 MB). Peak memory consumption was 33.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 61.19 ms. Allocated memory is still 315.1 MB. Free memory was 267.7 MB in the beginning and 265.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 56.86 ms. Allocated memory is still 315.1 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1996.12 ms. Allocated memory was 315.1 MB in the beginning and 359.1 MB in the end (delta: 44.0 MB). Free memory was 262.7 MB in the beginning and 214.4 MB in the end (delta: 48.3 MB). Peak memory consumption was 101.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7021.01 ms. Allocated memory was 359.1 MB in the beginning and 512.8 MB in the end (delta: 153.6 MB). Free memory was 211.0 MB in the beginning and 161.4 MB in the end (delta: 49.6 MB). Peak memory consumption was 203.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1024 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 139 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.8s, 99 PlacesBefore, 36 PlacesAfterwards, 91 TransitionsBefore, 27 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 3724 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L706] 0 _Bool x$flush_delayed; [L707] 0 int x$mem_tmp; [L708] 0 _Bool x$r_buff0_thd0; [L709] 0 _Bool x$r_buff0_thd1; [L710] 0 _Bool x$r_buff0_thd2; [L711] 0 _Bool x$r_buff0_thd3; [L712] 0 _Bool x$r_buff1_thd0; [L713] 0 _Bool x$r_buff1_thd1; [L714] 0 _Bool x$r_buff1_thd2; [L715] 0 _Bool x$r_buff1_thd3; [L716] 0 _Bool x$read_delayed; [L717] 0 int *x$read_delayed_var; [L718] 0 int x$w_buff0; [L719] 0 _Bool x$w_buff0_used; [L720] 0 int x$w_buff1; [L721] 0 _Bool x$w_buff1_used; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2525; [L819] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] 0 pthread_t t2526; [L821] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2527; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 1 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L823] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L731] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L836] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 282 SDtfs, 270 SDslu, 549 SDs, 0 SdLazy, 220 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 12083 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...