/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 16:59:00,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 16:59:00,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 16:59:00,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 16:59:00,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 16:59:00,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 16:59:00,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 16:59:00,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 16:59:00,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 16:59:00,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 16:59:00,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 16:59:00,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 16:59:00,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 16:59:00,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 16:59:00,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 16:59:00,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 16:59:00,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 16:59:00,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 16:59:00,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 16:59:00,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 16:59:00,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 16:59:00,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 16:59:00,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 16:59:00,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 16:59:00,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 16:59:00,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 16:59:00,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 16:59:00,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 16:59:00,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 16:59:00,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 16:59:00,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 16:59:00,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 16:59:00,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 16:59:00,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 16:59:00,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 16:59:00,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 16:59:00,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 16:59:00,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 16:59:00,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 16:59:00,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 16:59:00,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 16:59:00,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 16:59:00,557 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 16:59:00,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 16:59:00,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 16:59:00,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 16:59:00,562 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 16:59:00,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 16:59:00,563 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 16:59:00,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 16:59:00,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 16:59:00,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 16:59:00,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 16:59:00,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 16:59:00,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 16:59:00,564 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 16:59:00,564 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 16:59:00,564 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 16:59:00,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 16:59:00,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 16:59:00,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 16:59:00,567 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 16:59:00,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 16:59:00,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 16:59:00,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 16:59:00,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 16:59:00,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 16:59:00,568 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 16:59:00,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 16:59:00,569 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 16:59:00,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 16:59:00,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 16:59:00,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 16:59:00,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 16:59:00,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 16:59:00,919 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 16:59:00,920 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 16:59:00,920 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2020-10-09 16:59:00,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b64bf88/050b92e2d76142539a893348cc8976cb/FLAGbeac0b909 [2020-10-09 16:59:01,506 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 16:59:01,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_tso.opt.i [2020-10-09 16:59:01,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b64bf88/050b92e2d76142539a893348cc8976cb/FLAGbeac0b909 [2020-10-09 16:59:01,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b64bf88/050b92e2d76142539a893348cc8976cb [2020-10-09 16:59:01,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 16:59:01,782 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 16:59:01,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 16:59:01,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 16:59:01,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 16:59:01,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:59:01" (1/1) ... [2020-10-09 16:59:01,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11584aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:01, skipping insertion in model container [2020-10-09 16:59:01,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 04:59:01" (1/1) ... [2020-10-09 16:59:01,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 16:59:01,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 16:59:02,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:59:02,379 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 16:59:02,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 16:59:02,533 INFO L208 MainTranslator]: Completed translation [2020-10-09 16:59:02,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02 WrapperNode [2020-10-09 16:59:02,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 16:59:02,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 16:59:02,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 16:59:02,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 16:59:02,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 16:59:02,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 16:59:02,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 16:59:02,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 16:59:02,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... [2020-10-09 16:59:02,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 16:59:02,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 16:59:02,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 16:59:02,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 16:59:02,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 16:59:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 16:59:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 16:59:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 16:59:02,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 16:59:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 16:59:02,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 16:59:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 16:59:02,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 16:59:02,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 16:59:02,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 16:59:02,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 16:59:02,722 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 16:59:04,789 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 16:59:04,789 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 16:59:04,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:59:04 BoogieIcfgContainer [2020-10-09 16:59:04,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 16:59:04,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 16:59:04,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 16:59:04,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 16:59:04,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 04:59:01" (1/3) ... [2020-10-09 16:59:04,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754b6ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:59:04, skipping insertion in model container [2020-10-09 16:59:04,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 04:59:02" (2/3) ... [2020-10-09 16:59:04,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754b6ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 04:59:04, skipping insertion in model container [2020-10-09 16:59:04,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 04:59:04" (3/3) ... [2020-10-09 16:59:04,801 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi001_tso.opt.i [2020-10-09 16:59:04,812 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 16:59:04,819 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 16:59:04,820 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 16:59:04,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,847 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,850 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,852 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,860 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,863 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,864 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,864 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,865 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,866 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 16:59:04,885 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-09 16:59:04,906 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 16:59:04,906 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 16:59:04,906 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 16:59:04,906 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 16:59:04,906 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 16:59:04,906 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 16:59:04,907 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 16:59:04,907 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 16:59:04,919 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-10-09 16:59:04,959 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-09 16:59:04,959 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:59:04,963 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-09 16:59:04,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2020-10-09 16:59:04,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2020-10-09 16:59:04,982 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2020-10-09 16:59:04,982 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:59:04,983 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:59:04,984 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:59:04,985 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:59:04,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:59:04,992 INFO L82 PathProgramCache]: Analyzing trace with hash 424462516, now seen corresponding path program 1 times [2020-10-09 16:59:05,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:59:05,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402135857] [2020-10-09 16:59:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 16:59:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:59:05,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:59:05,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:59:05,168 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-09 16:59:05,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:59:05,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:05,238 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-09 16:59:05,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402135857] [2020-10-09 16:59:05,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:59:05,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 16:59:05,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633949902] [2020-10-09 16:59:05,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 16:59:05,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:59:05,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 16:59:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 16:59:05,439 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 79 [2020-10-09 16:59:05,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 160 flow. Second operand 4 states. [2020-10-09 16:59:05,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:59:05,441 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 79 [2020-10-09 16:59:05,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:59:05,474 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2020-10-09 16:59:05,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:59:05,475 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 74 events. 0/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 16:59:05,477 INFO L132 encePairwiseOnDemand]: 74/79 looper letters, 0 selfloop transitions, 2 changer transitions 9/74 dead transitions. [2020-10-09 16:59:05,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 74 transitions, 158 flow [2020-10-09 16:59:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 16:59:05,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 16:59:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2020-10-09 16:59:05,497 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9662447257383966 [2020-10-09 16:59:05,498 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 229 transitions. [2020-10-09 16:59:05,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 229 transitions. [2020-10-09 16:59:05,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:59:05,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 229 transitions. [2020-10-09 16:59:05,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 16:59:05,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 16:59:05,521 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 16:59:05,524 INFO L185 Difference]: Start difference. First operand has 82 places, 77 transitions, 160 flow. Second operand 3 states and 229 transitions. [2020-10-09 16:59:05,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 74 transitions, 158 flow [2020-10-09 16:59:05,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 74 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 16:59:05,533 INFO L241 Difference]: Finished difference. Result has 81 places, 65 transitions, 138 flow [2020-10-09 16:59:05,536 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2020-10-09 16:59:05,537 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, -1 predicate places. [2020-10-09 16:59:05,537 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 138 flow [2020-10-09 16:59:05,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 16:59:05,538 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:59:05,538 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:59:05,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 16:59:05,748 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:59:05,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:59:05,749 INFO L82 PathProgramCache]: Analyzing trace with hash 446928039, now seen corresponding path program 1 times [2020-10-09 16:59:05,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:59:05,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157818359] [2020-10-09 16:59:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 16:59:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:59:05,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 16:59:05,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:59:05,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:59:05,937 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-09 16:59:05,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:59:06,004 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-09 16:59:06,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157818359] [2020-10-09 16:59:06,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:59:06,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:59:06,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98023737] [2020-10-09 16:59:06,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:59:06,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:59:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:59:06,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:59:06,157 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 79 [2020-10-09 16:59:06,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 138 flow. Second operand 8 states. [2020-10-09 16:59:06,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:59:06,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 79 [2020-10-09 16:59:06,158 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:59:06,273 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-09 16:59:06,273 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 16:59:06,274 INFO L80 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 0 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2020-10-09 16:59:06,274 INFO L132 encePairwiseOnDemand]: 73/79 looper letters, 6 selfloop transitions, 2 changer transitions 10/75 dead transitions. [2020-10-09 16:59:06,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 194 flow [2020-10-09 16:59:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:59:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:59:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 641 transitions. [2020-10-09 16:59:06,279 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9015471167369902 [2020-10-09 16:59:06,280 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 641 transitions. [2020-10-09 16:59:06,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 641 transitions. [2020-10-09 16:59:06,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:59:06,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 641 transitions. [2020-10-09 16:59:06,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:59:06,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:59:06,286 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:59:06,287 INFO L185 Difference]: Start difference. First operand has 81 places, 65 transitions, 138 flow. Second operand 9 states and 641 transitions. [2020-10-09 16:59:06,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 194 flow [2020-10-09 16:59:06,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 16:59:06,292 INFO L241 Difference]: Finished difference. Result has 85 places, 65 transitions, 154 flow [2020-10-09 16:59:06,292 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=154, PETRI_PLACES=85, PETRI_TRANSITIONS=65} [2020-10-09 16:59:06,293 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places. [2020-10-09 16:59:06,293 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 65 transitions, 154 flow [2020-10-09 16:59:06,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:59:06,293 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:59:06,293 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:59:06,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 16:59:06,506 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:59:06,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:59:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash 589465482, now seen corresponding path program 1 times [2020-10-09 16:59:06,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:59:06,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780598492] [2020-10-09 16:59:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 16:59:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:59:06,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 16:59:06,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:59:06,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:59:06,663 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-09 16:59:06,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:59:06,698 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-09 16:59:06,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780598492] [2020-10-09 16:59:06,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:59:06,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 16:59:06,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133530771] [2020-10-09 16:59:06,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 16:59:06,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:59:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 16:59:06,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 16:59:06,782 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2020-10-09 16:59:06,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 65 transitions, 154 flow. Second operand 8 states. [2020-10-09 16:59:06,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:59:06,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2020-10-09 16:59:06,783 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:59:06,988 INFO L129 PetriNetUnfolder]: 16/112 cut-off events. [2020-10-09 16:59:06,988 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-09 16:59:06,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 112 events. 16/112 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 267 event pairs, 0 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 164. Up to 10 conditions per place. [2020-10-09 16:59:06,990 INFO L132 encePairwiseOnDemand]: 71/79 looper letters, 4 selfloop transitions, 7 changer transitions 19/86 dead transitions. [2020-10-09 16:59:06,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 86 transitions, 256 flow [2020-10-09 16:59:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 16:59:06,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 16:59:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2020-10-09 16:59:06,993 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8829113924050633 [2020-10-09 16:59:06,994 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 837 transitions. [2020-10-09 16:59:06,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 837 transitions. [2020-10-09 16:59:06,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:59:06,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 837 transitions. [2020-10-09 16:59:06,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 16:59:06,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 16:59:06,999 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 16:59:06,999 INFO L185 Difference]: Start difference. First operand has 85 places, 65 transitions, 154 flow. Second operand 12 states and 837 transitions. [2020-10-09 16:59:07,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 86 transitions, 256 flow [2020-10-09 16:59:07,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 236 flow, removed 7 selfloop flow, removed 9 redundant places. [2020-10-09 16:59:07,003 INFO L241 Difference]: Finished difference. Result has 90 places, 67 transitions, 180 flow [2020-10-09 16:59:07,004 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=180, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2020-10-09 16:59:07,004 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2020-10-09 16:59:07,004 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 180 flow [2020-10-09 16:59:07,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 16:59:07,004 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:59:07,005 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:59:07,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 16:59:07,217 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:59:07,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:59:07,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1375420649, now seen corresponding path program 1 times [2020-10-09 16:59:07,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:59:07,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288976065] [2020-10-09 16:59:07,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 16:59:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 16:59:07,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-09 16:59:07,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:59:07,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:59:07,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:59:07,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:59:07,525 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-09 16:59:07,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:59:07,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-09 16:59:07,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-09 16:59:07,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,603 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:07,605 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:07,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:59:07,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-09 16:59:07,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-09 16:59:07,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 2, 3, 2, 1] term [2020-10-09 16:59:07,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:59:07,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:59:07,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-09 16:59:07,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-10-09 16:59:07,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,740 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 4, 2, 3, 2, 1] term [2020-10-09 16:59:07,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:59:07,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:59:07,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 16:59:07,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 16:59:07,799 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:59:07,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 16:59:07,847 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-09 16:59:07,862 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:07,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:07,894 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:07,908 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 16:59:07,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:07,939 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 16:59:08,023 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-09 16:59:08,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288976065] [2020-10-09 16:59:08,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:59:08,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 16 [2020-10-09 16:59:08,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23320188] [2020-10-09 16:59:08,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-09 16:59:08,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:59:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-09 16:59:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2020-10-09 16:59:10,103 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 79 [2020-10-09 16:59:10,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 180 flow. Second operand 16 states. [2020-10-09 16:59:10,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:59:10,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 79 [2020-10-09 16:59:10,105 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:59:10,333 INFO L129 PetriNetUnfolder]: 5/107 cut-off events. [2020-10-09 16:59:10,333 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2020-10-09 16:59:10,334 INFO L80 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 107 events. 5/107 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 event pairs, 0 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 152. Up to 10 conditions per place. [2020-10-09 16:59:10,334 INFO L132 encePairwiseOnDemand]: 71/79 looper letters, 16 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2020-10-09 16:59:10,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 77 transitions, 252 flow [2020-10-09 16:59:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 16:59:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 16:59:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 567 transitions. [2020-10-09 16:59:10,338 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7974683544303798 [2020-10-09 16:59:10,338 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 567 transitions. [2020-10-09 16:59:10,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 567 transitions. [2020-10-09 16:59:10,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:59:10,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 567 transitions. [2020-10-09 16:59:10,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 16:59:10,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 16:59:10,342 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 16:59:10,342 INFO L185 Difference]: Start difference. First operand has 90 places, 67 transitions, 180 flow. Second operand 9 states and 567 transitions. [2020-10-09 16:59:10,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 77 transitions, 252 flow [2020-10-09 16:59:10,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 77 transitions, 220 flow, removed 9 selfloop flow, removed 11 redundant places. [2020-10-09 16:59:10,346 INFO L241 Difference]: Finished difference. Result has 86 places, 67 transitions, 165 flow [2020-10-09 16:59:10,346 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=165, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2020-10-09 16:59:10,346 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 4 predicate places. [2020-10-09 16:59:10,346 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 165 flow [2020-10-09 16:59:10,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-09 16:59:10,347 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:59:10,347 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:59:10,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 16:59:10,559 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:59:10,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:59:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash -745423233, now seen corresponding path program 2 times [2020-10-09 16:59:10,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:59:10,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789413285] [2020-10-09 16:59:10,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 16:59:10,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 16:59:10,714 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 16:59:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 16:59:10,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 16:59:10,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 16:59:10,780 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-09 16:59:10,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 16:59:10,822 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-09 16:59:10,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789413285] [2020-10-09 16:59:10,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 16:59:10,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-09 16:59:10,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689457395] [2020-10-09 16:59:10,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-09 16:59:10,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 16:59:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-09 16:59:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-09 16:59:11,084 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2020-10-09 16:59:11,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 67 transitions, 165 flow. Second operand 9 states. [2020-10-09 16:59:11,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 16:59:11,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2020-10-09 16:59:11,085 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 16:59:11,185 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2020-10-09 16:59:11,185 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-09 16:59:11,186 INFO L80 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 102 events. 2/102 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 0 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 144. Up to 7 conditions per place. [2020-10-09 16:59:11,187 INFO L132 encePairwiseOnDemand]: 73/79 looper letters, 9 selfloop transitions, 1 changer transitions 5/72 dead transitions. [2020-10-09 16:59:11,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 72 transitions, 211 flow [2020-10-09 16:59:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 16:59:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-09 16:59:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 485 transitions. [2020-10-09 16:59:11,192 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8770343580470162 [2020-10-09 16:59:11,192 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 485 transitions. [2020-10-09 16:59:11,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 485 transitions. [2020-10-09 16:59:11,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 16:59:11,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 485 transitions. [2020-10-09 16:59:11,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-09 16:59:11,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-09 16:59:11,195 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-09 16:59:11,195 INFO L185 Difference]: Start difference. First operand has 86 places, 67 transitions, 165 flow. Second operand 7 states and 485 transitions. [2020-10-09 16:59:11,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 72 transitions, 211 flow [2020-10-09 16:59:11,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 72 transitions, 192 flow, removed 7 selfloop flow, removed 7 redundant places. [2020-10-09 16:59:11,199 INFO L241 Difference]: Finished difference. Result has 86 places, 67 transitions, 165 flow [2020-10-09 16:59:11,199 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=86, PETRI_TRANSITIONS=67} [2020-10-09 16:59:11,199 INFO L341 CegarLoopForPetriNet]: 82 programPoint places, 4 predicate places. [2020-10-09 16:59:11,200 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 67 transitions, 165 flow [2020-10-09 16:59:11,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-09 16:59:11,200 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 16:59:11,200 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 16:59:11,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 16:59:11,414 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 16:59:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 16:59:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1877904079, now seen corresponding path program 3 times [2020-10-09 16:59:11,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 16:59:11,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638461140] [2020-10-09 16:59:11,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 16:59:11,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 16:59:11,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 16:59:11,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:59:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 16:59:11,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 16:59:11,665 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 16:59:11,666 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 16:59:11,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 16:59:11,902 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-09 16:59:11,902 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,904 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-09 16:59:11,904 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,904 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-09 16:59:11,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,905 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-09 16:59:11,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,905 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-09 16:59:11,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,905 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-09 16:59:11,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,906 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-09 16:59:11,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,906 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-09 16:59:11,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,907 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-09 16:59:11,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,907 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-09 16:59:11,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,908 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-09 16:59:11,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,910 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-09 16:59:11,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,910 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-09 16:59:11,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,910 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-09 16:59:11,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,911 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-09 16:59:11,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,911 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-09 16:59:11,911 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,911 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-09 16:59:11,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,912 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-09 16:59:11,912 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,912 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-09 16:59:11,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,913 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-09 16:59:11,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,913 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-09 16:59:11,913 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,914 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-09 16:59:11,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,914 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-09 16:59:11,914 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,914 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-09 16:59:11,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,915 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-09 16:59:11,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,915 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-09 16:59:11,915 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,916 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-09 16:59:11,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,916 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-09 16:59:11,916 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:11,917 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-09 16:59:11,917 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 16:59:12,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 04:59:12 BasicIcfg [2020-10-09 16:59:12,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 16:59:12,041 INFO L168 Benchmark]: Toolchain (without parser) took 10256.22 ms. Allocated memory was 252.7 MB in the beginning and 482.9 MB in the end (delta: 230.2 MB). Free memory was 207.6 MB in the beginning and 309.9 MB in the end (delta: -102.2 MB). Peak memory consumption was 127.9 MB. Max. memory is 14.2 GB. [2020-10-09 16:59:12,042 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 16:59:12,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 750.36 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 207.6 MB in the beginning and 270.5 MB in the end (delta: -62.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. [2020-10-09 16:59:12,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 317.7 MB. Free memory was 270.5 MB in the beginning and 265.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-09 16:59:12,049 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 ms. Allocated memory is still 317.7 MB. Free memory was 265.4 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 16:59:12,050 INFO L168 Benchmark]: RCFGBuilder took 2148.75 ms. Allocated memory was 317.7 MB in the beginning and 359.7 MB in the end (delta: 41.9 MB). Free memory was 262.9 MB in the beginning and 218.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. [2020-10-09 16:59:12,051 INFO L168 Benchmark]: TraceAbstraction took 7243.06 ms. Allocated memory was 359.7 MB in the beginning and 482.9 MB in the end (delta: 123.2 MB). Free memory was 218.7 MB in the beginning and 309.9 MB in the end (delta: -91.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. [2020-10-09 16:59:12,061 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 750.36 ms. Allocated memory was 252.7 MB in the beginning and 317.7 MB in the end (delta: 65.0 MB). Free memory was 207.6 MB in the beginning and 270.5 MB in the end (delta: -62.8 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.82 ms. Allocated memory is still 317.7 MB. Free memory was 270.5 MB in the beginning and 265.4 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.24 ms. Allocated memory is still 317.7 MB. Free memory was 265.4 MB in the beginning and 262.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2148.75 ms. Allocated memory was 317.7 MB in the beginning and 359.7 MB in the end (delta: 41.9 MB). Free memory was 262.9 MB in the beginning and 218.7 MB in the end (delta: 44.2 MB). Peak memory consumption was 99.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7243.06 ms. Allocated memory was 359.7 MB in the beginning and 482.9 MB in the end (delta: 123.2 MB). Free memory was 218.7 MB in the beginning and 309.9 MB in the end (delta: -91.2 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 0 pthread_t t1615; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L792] FCALL, FORK 0 pthread_create(&t1615, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L793] 0 pthread_t t1616; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] FCALL, FORK 0 pthread_create(&t1616, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L749] 2 y$w_buff1 = y$w_buff0 [L750] 2 y$w_buff0 = 2 [L751] 2 y$w_buff1_used = y$w_buff0_used [L752] 2 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L754] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L755] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L756] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L757] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L737] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L739] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L742] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 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) [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L800] 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) [L800] 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) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 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 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 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 [L807] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 0 y$flush_delayed = weak$$choice2 [L810] 0 y$mem_tmp = y [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L814] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L815] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L819] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L819] 0 y = y$flush_delayed ? y$mem_tmp : y [L820] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6.9s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 191 SDslu, 605 SDs, 0 SdLazy, 604 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 536 GetRequests, 470 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 514 ConstructedInterpolants, 0 QuantifiedInterpolants, 87126 SizeOfPredicates, 39 NumberOfNonLiveVariables, 768 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...