/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:11:49,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:11:49,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:11:49,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:11:49,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:11:49,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:11:49,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:11:49,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:11:49,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:11:49,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:11:49,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:11:49,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:11:49,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:11:49,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:11:49,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:11:49,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:11:49,445 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:11:49,446 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:11:49,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:11:49,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:11:49,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:11:49,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:11:49,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:11:49,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:11:49,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:11:49,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:11:49,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:11:49,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:11:49,460 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:11:49,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:11:49,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:11:49,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:11:49,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:11:49,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:11:49,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:11:49,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:11:49,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:11:49,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:11:49,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:11:49,468 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:11:49,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:11:49,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:11:49,515 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:11:49,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:11:49,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:11:49,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:11:49,518 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:11:49,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:11:49,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:11:49,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:11:49,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:11:49,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:11:49,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:11:49,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:11:49,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:11:49,520 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:11:49,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:11:49,521 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:11:49,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:11:49,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:11:49,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:11:49,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:11:49,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:11:49,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:11:49,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:11:49,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:11:49,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:11:49,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:11:49,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:11:49,523 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:11:49,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:11:49,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:11:49,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:11:49,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:11:49,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:11:49,831 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:11:49,831 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:11:49,832 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.opt.i [2020-10-16 11:11:49,898 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80bd20bc6/39a5d195bb1f4fffbf498762bc7a81d8/FLAG55d55b7f9 [2020-10-16 11:11:50,445 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:11:50,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix038_tso.opt.i [2020-10-16 11:11:50,489 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80bd20bc6/39a5d195bb1f4fffbf498762bc7a81d8/FLAG55d55b7f9 [2020-10-16 11:11:50,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/80bd20bc6/39a5d195bb1f4fffbf498762bc7a81d8 [2020-10-16 11:11:50,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:11:50,721 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:11:50,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:11:50,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:11:50,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:11:50,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:11:50" (1/1) ... [2020-10-16 11:11:50,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fcd43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:50, skipping insertion in model container [2020-10-16 11:11:50,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:11:50" (1/1) ... [2020-10-16 11:11:50,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:11:50,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:11:51,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:11:51,276 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:11:51,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:11:51,412 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:11:51,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51 WrapperNode [2020-10-16 11:11:51,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:11:51,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:11:51,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:11:51,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:11:51,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,440 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:11:51,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:11:51,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:11:51,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:11:51,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... [2020-10-16 11:11:51,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:11:51,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:11:51,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:11:51,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:11:51,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:11:51,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:11:51,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:11:51,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:11:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:11:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:11:51,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:11:51,590 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:11:51,590 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:11:51,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:11:51,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:11:51,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:11:51,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:11:51,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:11:51,593 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:11:53,273 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:11:53,274 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 11:11:53,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:11:53 BoogieIcfgContainer [2020-10-16 11:11:53,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:11:53,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:11:53,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:11:53,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:11:53,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:11:50" (1/3) ... [2020-10-16 11:11:53,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbb7596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:11:53, skipping insertion in model container [2020-10-16 11:11:53,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:11:51" (2/3) ... [2020-10-16 11:11:53,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fbb7596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:11:53, skipping insertion in model container [2020-10-16 11:11:53,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:11:53" (3/3) ... [2020-10-16 11:11:53,285 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.opt.i [2020-10-16 11:11:53,319 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:11:53,319 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:11:53,333 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 11:11:53,335 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:11:53,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,376 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,377 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,378 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,378 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,383 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,384 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,385 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,386 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,389 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,390 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,390 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,390 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,401 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,401 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,408 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,410 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,411 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,414 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,414 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,415 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,416 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:11:53,418 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:11:53,432 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 11:11:53,453 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:11:53,453 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:11:53,453 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:11:53,453 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:11:53,454 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:11:53,454 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:11:53,454 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:11:53,454 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:11:53,476 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:11:53,479 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-10-16 11:11:53,482 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2020-10-16 11:11:53,484 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-10-16 11:11:53,555 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-10-16 11:11:53,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:11:53,561 INFO L80 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 11:11:53,568 INFO L117 LiptonReduction]: Number of co-enabled transitions 1600 [2020-10-16 11:11:54,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:11:54,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:11:54,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:54,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:54,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:54,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:54,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,191 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-16 11:11:54,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,193 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-16 11:11:54,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:54,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:54,644 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 11:11:54,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:54,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:54,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:54,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:54,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:11:54,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:54,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,880 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-16 11:11:54,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,882 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-16 11:11:54,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:54,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:54,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 11:11:54,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 11:11:54,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:55,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:55,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:55,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:55,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:55,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:55,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:55,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:55,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:55,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:55,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:55,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:55,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:55,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:55,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:55,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:55,792 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 11:11:55,934 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 11:11:56,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 11:11:56,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 11:11:56,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:11:56,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:56,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:56,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:56,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:56,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:56,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:11:56,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:11:56,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:11:56,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:56,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 11:11:56,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 11:11:56,935 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2020-10-16 11:11:57,139 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 11:11:57,257 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 11:11:57,265 INFO L132 LiptonReduction]: Checked pairs total: 3769 [2020-10-16 11:11:57,265 INFO L134 LiptonReduction]: Total number of compositions: 78 [2020-10-16 11:11:57,272 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-16 11:11:57,318 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 714 states. [2020-10-16 11:11:57,320 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states. [2020-10-16 11:11:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 11:11:57,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:57,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:57,328 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1203146802, now seen corresponding path program 1 times [2020-10-16 11:11:57,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:57,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461484261] [2020-10-16 11:11:57,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:57,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461484261] [2020-10-16 11:11:57,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:57,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 11:11:57,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946997422] [2020-10-16 11:11:57,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 11:11:57,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:57,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 11:11:57,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 11:11:57,617 INFO L87 Difference]: Start difference. First operand 714 states. Second operand 3 states. [2020-10-16 11:11:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:57,708 INFO L93 Difference]: Finished difference Result 618 states and 1920 transitions. [2020-10-16 11:11:57,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 11:11:57,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 11:11:57,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:57,732 INFO L225 Difference]: With dead ends: 618 [2020-10-16 11:11:57,732 INFO L226 Difference]: Without dead ends: 522 [2020-10-16 11:11:57,733 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-16 11:11:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-10-16 11:11:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-10-16 11:11:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-10-16 11:11:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1600 transitions. [2020-10-16 11:11:57,822 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1600 transitions. Word has length 7 [2020-10-16 11:11:57,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:57,824 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 1600 transitions. [2020-10-16 11:11:57,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 11:11:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1600 transitions. [2020-10-16 11:11:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:11:57,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:57,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:57,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:11:57,830 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:57,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:57,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1445504783, now seen corresponding path program 1 times [2020-10-16 11:11:57,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:57,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887145326] [2020-10-16 11:11:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:57,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887145326] [2020-10-16 11:11:57,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:57,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:11:57,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911014889] [2020-10-16 11:11:57,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:57,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:57,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:57,913 INFO L87 Difference]: Start difference. First operand 522 states and 1600 transitions. Second operand 4 states. [2020-10-16 11:11:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:57,979 INFO L93 Difference]: Finished difference Result 554 states and 1632 transitions. [2020-10-16 11:11:57,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:11:57,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 11:11:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:57,991 INFO L225 Difference]: With dead ends: 554 [2020-10-16 11:11:57,991 INFO L226 Difference]: Without dead ends: 458 [2020-10-16 11:11:57,992 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-16 11:11:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-16 11:11:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-16 11:11:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-16 11:11:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1376 transitions. [2020-10-16 11:11:58,038 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1376 transitions. Word has length 10 [2020-10-16 11:11:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:58,038 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1376 transitions. [2020-10-16 11:11:58,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1376 transitions. [2020-10-16 11:11:58,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:11:58,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:58,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:58,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:11:58,042 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1810357054, now seen corresponding path program 1 times [2020-10-16 11:11:58,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:58,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920276416] [2020-10-16 11:11:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:58,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920276416] [2020-10-16 11:11:58,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:58,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:11:58,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567709960] [2020-10-16 11:11:58,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:58,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:58,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:58,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:58,117 INFO L87 Difference]: Start difference. First operand 458 states and 1376 transitions. Second operand 4 states. [2020-10-16 11:11:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:58,146 INFO L93 Difference]: Finished difference Result 506 states and 1468 transitions. [2020-10-16 11:11:58,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:11:58,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 11:11:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:58,150 INFO L225 Difference]: With dead ends: 506 [2020-10-16 11:11:58,151 INFO L226 Difference]: Without dead ends: 442 [2020-10-16 11:11:58,151 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-16 11:11:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-16 11:11:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-16 11:11:58,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-16 11:11:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1316 transitions. [2020-10-16 11:11:58,168 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1316 transitions. Word has length 12 [2020-10-16 11:11:58,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:58,168 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1316 transitions. [2020-10-16 11:11:58,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1316 transitions. [2020-10-16 11:11:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:11:58,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:58,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:58,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:11:58,171 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1063676776, now seen corresponding path program 1 times [2020-10-16 11:11:58,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:58,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308512071] [2020-10-16 11:11:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:58,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308512071] [2020-10-16 11:11:58,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:58,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:11:58,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217805391] [2020-10-16 11:11:58,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:58,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:58,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:58,255 INFO L87 Difference]: Start difference. First operand 442 states and 1316 transitions. Second operand 4 states. [2020-10-16 11:11:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:58,285 INFO L93 Difference]: Finished difference Result 406 states and 1057 transitions. [2020-10-16 11:11:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 11:11:58,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 11:11:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:58,288 INFO L225 Difference]: With dead ends: 406 [2020-10-16 11:11:58,288 INFO L226 Difference]: Without dead ends: 310 [2020-10-16 11:11:58,288 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-16 11:11:58,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-10-16 11:11:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2020-10-16 11:11:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-10-16 11:11:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 788 transitions. [2020-10-16 11:11:58,297 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 788 transitions. Word has length 13 [2020-10-16 11:11:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:58,298 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 788 transitions. [2020-10-16 11:11:58,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 788 transitions. [2020-10-16 11:11:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:11:58,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:58,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:58,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:11:58,300 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:58,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1371200177, now seen corresponding path program 1 times [2020-10-16 11:11:58,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:58,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752175252] [2020-10-16 11:11:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:58,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:58,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752175252] [2020-10-16 11:11:58,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:58,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:11:58,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744591620] [2020-10-16 11:11:58,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:11:58,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:58,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:11:58,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:11:58,370 INFO L87 Difference]: Start difference. First operand 310 states and 788 transitions. Second operand 4 states. [2020-10-16 11:11:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:58,402 INFO L93 Difference]: Finished difference Result 462 states and 1120 transitions. [2020-10-16 11:11:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:11:58,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:11:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:58,405 INFO L225 Difference]: With dead ends: 462 [2020-10-16 11:11:58,405 INFO L226 Difference]: Without dead ends: 324 [2020-10-16 11:11:58,406 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-16 11:11:58,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-16 11:11:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 300. [2020-10-16 11:11:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-10-16 11:11:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 720 transitions. [2020-10-16 11:11:58,415 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 720 transitions. Word has length 15 [2020-10-16 11:11:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:58,415 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 720 transitions. [2020-10-16 11:11:58,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:11:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 720 transitions. [2020-10-16 11:11:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:11:58,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:58,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:58,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:11:58,417 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:58,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash 929601903, now seen corresponding path program 1 times [2020-10-16 11:11:58,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:58,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176259711] [2020-10-16 11:11:58,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:58,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176259711] [2020-10-16 11:11:58,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:58,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:11:58,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686601700] [2020-10-16 11:11:58,496 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:11:58,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:11:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:11:58,497 INFO L87 Difference]: Start difference. First operand 300 states and 720 transitions. Second operand 5 states. [2020-10-16 11:11:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:58,540 INFO L93 Difference]: Finished difference Result 231 states and 494 transitions. [2020-10-16 11:11:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:11:58,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-16 11:11:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:58,542 INFO L225 Difference]: With dead ends: 231 [2020-10-16 11:11:58,543 INFO L226 Difference]: Without dead ends: 180 [2020-10-16 11:11:58,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:11:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-16 11:11:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2020-10-16 11:11:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-16 11:11:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 374 transitions. [2020-10-16 11:11:58,548 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 374 transitions. Word has length 15 [2020-10-16 11:11:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:58,549 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 374 transitions. [2020-10-16 11:11:58,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:11:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 374 transitions. [2020-10-16 11:11:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:11:58,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:58,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:11:58,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:11:58,550 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:58,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash 496421310, now seen corresponding path program 1 times [2020-10-16 11:11:58,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:58,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522410188] [2020-10-16 11:11:58,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:58,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522410188] [2020-10-16 11:11:58,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:58,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:11:58,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894432974] [2020-10-16 11:11:58,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:11:58,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:58,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:11:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:11:58,674 INFO L87 Difference]: Start difference. First operand 180 states and 374 transitions. Second operand 6 states. [2020-10-16 11:11:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:58,733 INFO L93 Difference]: Finished difference Result 154 states and 321 transitions. [2020-10-16 11:11:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:11:58,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:11:58,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:58,735 INFO L225 Difference]: With dead ends: 154 [2020-10-16 11:11:58,735 INFO L226 Difference]: Without dead ends: 94 [2020-10-16 11:11:58,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:11:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-10-16 11:11:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-10-16 11:11:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-16 11:11:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 186 transitions. [2020-10-16 11:11:58,739 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 186 transitions. Word has length 18 [2020-10-16 11:11:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:58,739 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 186 transitions. [2020-10-16 11:11:58,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:11:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 186 transitions. [2020-10-16 11:11:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:11:58,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:58,740 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-16 11:11:58,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:11:58,741 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash -423206655, now seen corresponding path program 1 times [2020-10-16 11:11:58,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:58,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715926145] [2020-10-16 11:11:58,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:58,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715926145] [2020-10-16 11:11:58,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:58,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:11:58,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255492355] [2020-10-16 11:11:58,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:11:58,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:58,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:11:58,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:11:58,902 INFO L87 Difference]: Start difference. First operand 94 states and 186 transitions. Second operand 10 states. [2020-10-16 11:11:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:59,133 INFO L93 Difference]: Finished difference Result 138 states and 256 transitions. [2020-10-16 11:11:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 11:11:59,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-16 11:11:59,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:59,134 INFO L225 Difference]: With dead ends: 138 [2020-10-16 11:11:59,135 INFO L226 Difference]: Without dead ends: 51 [2020-10-16 11:11:59,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-16 11:11:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-16 11:11:59,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2020-10-16 11:11:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-16 11:11:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2020-10-16 11:11:59,138 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 69 transitions. Word has length 21 [2020-10-16 11:11:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:59,139 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 69 transitions. [2020-10-16 11:11:59,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:11:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2020-10-16 11:11:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:11:59,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:59,139 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-16 11:11:59,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:11:59,140 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:59,140 INFO L82 PathProgramCache]: Analyzing trace with hash -252972643, now seen corresponding path program 2 times [2020-10-16 11:11:59,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:59,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613154243] [2020-10-16 11:11:59,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:11:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:11:59,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613154243] [2020-10-16 11:11:59,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:11:59,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:11:59,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934631633] [2020-10-16 11:11:59,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:11:59,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:11:59,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:11:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:11:59,293 INFO L87 Difference]: Start difference. First operand 43 states and 69 transitions. Second operand 6 states. [2020-10-16 11:11:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:11:59,359 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-10-16 11:11:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:11:59,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-16 11:11:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:11:59,360 INFO L225 Difference]: With dead ends: 54 [2020-10-16 11:11:59,360 INFO L226 Difference]: Without dead ends: 31 [2020-10-16 11:11:59,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:11:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-16 11:11:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-16 11:11:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-16 11:11:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-10-16 11:11:59,362 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 21 [2020-10-16 11:11:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:11:59,363 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-10-16 11:11:59,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:11:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-10-16 11:11:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 11:11:59,363 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:11:59,363 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-16 11:11:59,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:11:59,363 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:11:59,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:11:59,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1948613855, now seen corresponding path program 3 times [2020-10-16 11:11:59,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:11:59,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715048491] [2020-10-16 11:11:59,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:11:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:11:59,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:11:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:11:59,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:11:59,476 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:11:59,477 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:11:59,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:11:59,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-16 11:11:59,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,508 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,509 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,510 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,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-16 11:11:59,511 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,512 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,512 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,513 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,513 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,513 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,513 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,519 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,520 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,520 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,521 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,522 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:11:59,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:11:59,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:11:59 BasicIcfg [2020-10-16 11:11:59,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:11:59,599 INFO L168 Benchmark]: Toolchain (without parser) took 8878.15 ms. Allocated memory was 140.5 MB in the beginning and 321.9 MB in the end (delta: 181.4 MB). Free memory was 102.4 MB in the beginning and 191.0 MB in the end (delta: -88.6 MB). Peak memory consumption was 92.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:59,600 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:11:59,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.08 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 102.2 MB in the beginning and 157.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:59,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.39 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:59,602 INFO L168 Benchmark]: Boogie Preprocessor took 48.40 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:59,602 INFO L168 Benchmark]: RCFGBuilder took 1756.35 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 152.3 MB in the beginning and 86.4 MB in the end (delta: 65.9 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. [2020-10-16 11:11:59,603 INFO L168 Benchmark]: TraceAbstraction took 6319.80 ms. Allocated memory was 235.4 MB in the beginning and 321.9 MB in the end (delta: 86.5 MB). Free memory was 86.4 MB in the beginning and 191.0 MB in the end (delta: -104.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 11:11:59,607 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.20 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 691.08 ms. Allocated memory was 140.5 MB in the beginning and 202.9 MB in the end (delta: 62.4 MB). Free memory was 102.2 MB in the beginning and 157.5 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.39 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.40 ms. Allocated memory is still 202.9 MB. Free memory was 154.2 MB in the beginning and 152.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1756.35 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 152.3 MB in the beginning and 86.4 MB in the end (delta: 65.9 MB). Peak memory consumption was 98.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6319.80 ms. Allocated memory was 235.4 MB in the beginning and 321.9 MB in the end (delta: 86.5 MB). Free memory was 86.4 MB in the beginning and 191.0 MB in the end (delta: -104.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1089 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 35 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 138 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 27 TransitionsAfterwards, 1600 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 3769 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L712] 0 int y = 0; [L713] 0 _Bool y$flush_delayed; [L714] 0 int y$mem_tmp; [L715] 0 _Bool y$r_buff0_thd0; [L716] 0 _Bool y$r_buff0_thd1; [L717] 0 _Bool y$r_buff0_thd2; [L718] 0 _Bool y$r_buff0_thd3; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L822] 0 pthread_t t1022; [L823] FCALL, FORK 0 pthread_create(&t1022, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] 0 pthread_t t1023; [L825] FCALL, FORK 0 pthread_create(&t1023, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L826] 0 pthread_t t1024; [L827] FCALL, FORK 0 pthread_create(&t1024, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L784] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L788] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 z = 1 [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y [L766] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L766] 2 y = y$flush_delayed ? y$mem_tmp : y [L767] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L804] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 3 return 0; [L829] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L833] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 241 SDtfs, 293 SDslu, 588 SDs, 0 SdLazy, 244 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=714occurred 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, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 8611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...