/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/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:43:58,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:43:58,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:43:58,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:43:58,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:43:58,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:43:58,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:43:58,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:43:58,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:43:58,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:43:58,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:43:58,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:43:58,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:43:58,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:43:58,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:43:58,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:43:58,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:43:58,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:43:58,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:43:58,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:43:58,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:43:58,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:43:58,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:43:58,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:43:58,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:43:58,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:43:58,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:43:58,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:43:58,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:43:58,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:43:58,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:43:58,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:43:58,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:43:58,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:43:58,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:43:58,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:43:58,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:43:58,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:43:58,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:43:58,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:43:58,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:43:58,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:43:58,924 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:43:58,924 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:43:58,925 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:43:58,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:43:58,926 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:43:58,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:43:58,926 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:43:58,926 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:43:58,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:43:58,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:43:58,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:43:58,927 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:43:58,927 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:43:58,928 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:43:58,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:43:58,928 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:43:58,928 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:43:58,928 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:43:58,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:43:58,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:43:58,929 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:43:58,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:43:58,929 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:43:58,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:43:58,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:43:58,930 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:43:58,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:43:58,930 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:43:58,930 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:43:58,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:43:59,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:43:59,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:43:59,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:43:59,219 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:43:59,219 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:43:59,220 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2020-10-11 18:43:59,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7602958/1df3fd64bc3945cd98d295e5277046cc/FLAG94434c07a [2020-10-11 18:43:59,791 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:43:59,791 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2020-10-11 18:43:59,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7602958/1df3fd64bc3945cd98d295e5277046cc/FLAG94434c07a [2020-10-11 18:44:00,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e7602958/1df3fd64bc3945cd98d295e5277046cc [2020-10-11 18:44:00,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:44:00,095 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:44:00,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:00,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:44:00,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:44:00,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b24b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00, skipping insertion in model container [2020-10-11 18:44:00,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:44:00,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:44:00,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:00,704 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:44:00,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:44:00,834 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:44:00,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00 WrapperNode [2020-10-11 18:44:00,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:44:00,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:00,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:44:00,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:44:00,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:44:00,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:44:00,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:44:00,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:44:00,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (1/1) ... [2020-10-11 18:44:00,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:44:00,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:44:00,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:44:00,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:44:00,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (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-11 18:44:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:44:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:44:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:44:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:44:01,020 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:44:01,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:44:01,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:44:01,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:44:01,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:44:01,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:44:01,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:44:01,024 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:44:02,722 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:44:02,723 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:44:02,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:02 BoogieIcfgContainer [2020-10-11 18:44:02,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:44:02,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:44:02,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:44:02,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:44:02,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:44:00" (1/3) ... [2020-10-11 18:44:02,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96739c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:02, skipping insertion in model container [2020-10-11 18:44:02,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:44:00" (2/3) ... [2020-10-11 18:44:02,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f96739c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:44:02, skipping insertion in model container [2020-10-11 18:44:02,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:44:02" (3/3) ... [2020-10-11 18:44:02,733 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2020-10-11 18:44:02,745 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:44:02,753 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:44:02,754 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:44:02,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,779 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,779 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,782 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,792 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,797 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:44:02,816 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-11 18:44:02,837 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:44:02,837 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:44:02,837 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:44:02,837 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:44:02,837 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:44:02,837 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:44:02,838 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:44:02,838 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:44:02,851 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-11 18:44:02,888 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-11 18:44:02,888 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:02,893 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-11 18:44:02,893 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-11 18:44:02,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-11 18:44:02,911 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2020-10-11 18:44:02,911 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:02,911 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:02,912 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] [2020-10-11 18:44:02,913 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:02,918 INFO L82 PathProgramCache]: Analyzing trace with hash -643034223, now seen corresponding path program 1 times [2020-10-11 18:44:02,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:02,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170105662] [2020-10-11 18:44:02,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:03,193 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-11 18:44:03,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170105662] [2020-10-11 18:44:03,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:03,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:44:03,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337743303] [2020-10-11 18:44:03,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:44:03,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:03,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:44:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:44:03,308 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 74 [2020-10-11 18:44:03,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 150 flow. Second operand 3 states. [2020-10-11 18:44:03,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:03,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 74 [2020-10-11 18:44:03,312 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:03,339 INFO L129 PetriNetUnfolder]: 0/69 cut-off events. [2020-10-11 18:44:03,339 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:03,340 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 0/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:44:03,341 INFO L132 encePairwiseOnDemand]: 69/74 looper letters, 0 selfloop transitions, 2 changer transitions 9/69 dead transitions. [2020-10-11 18:44:03,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 148 flow [2020-10-11 18:44:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:44:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:44:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2020-10-11 18:44:03,357 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.963963963963964 [2020-10-11 18:44:03,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2020-10-11 18:44:03,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2020-10-11 18:44:03,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:03,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2020-10-11 18:44:03,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:44:03,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:44:03,372 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:44:03,374 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 150 flow. Second operand 3 states and 214 transitions. [2020-10-11 18:44:03,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 148 flow [2020-10-11 18:44:03,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 69 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:44:03,384 INFO L241 Difference]: Finished difference. Result has 76 places, 60 transitions, 128 flow [2020-10-11 18:44:03,387 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2020-10-11 18:44:03,418 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, -1 predicate places. [2020-10-11 18:44:03,419 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 128 flow [2020-10-11 18:44:03,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:44:03,419 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:03,420 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] [2020-10-11 18:44:03,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:44:03,420 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1471555611, now seen corresponding path program 1 times [2020-10-11 18:44:03,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:03,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721052170] [2020-10-11 18:44:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:03,675 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-11 18:44:03,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721052170] [2020-10-11 18:44:03,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:03,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:03,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617297419] [2020-10-11 18:44:03,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:03,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:03,874 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 74 [2020-10-11 18:44:03,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 128 flow. Second operand 6 states. [2020-10-11 18:44:03,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:03,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 74 [2020-10-11 18:44:03,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:04,019 INFO L129 PetriNetUnfolder]: 24/163 cut-off events. [2020-10-11 18:44:04,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:44:04,021 INFO L80 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 163 events. 24/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 589 event pairs, 5 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 195. Up to 31 conditions per place. [2020-10-11 18:44:04,022 INFO L132 encePairwiseOnDemand]: 67/74 looper letters, 8 selfloop transitions, 3 changer transitions 19/81 dead transitions. [2020-10-11 18:44:04,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 230 flow [2020-10-11 18:44:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 599 transitions. [2020-10-11 18:44:04,027 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8993993993993994 [2020-10-11 18:44:04,027 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 599 transitions. [2020-10-11 18:44:04,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 599 transitions. [2020-10-11 18:44:04,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:04,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 599 transitions. [2020-10-11 18:44:04,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:04,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:04,034 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:04,035 INFO L185 Difference]: Start difference. First operand has 76 places, 60 transitions, 128 flow. Second operand 9 states and 599 transitions. [2020-10-11 18:44:04,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 81 transitions, 230 flow [2020-10-11 18:44:04,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:44:04,038 INFO L241 Difference]: Finished difference. Result has 80 places, 62 transitions, 167 flow [2020-10-11 18:44:04,039 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=167, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2020-10-11 18:44:04,039 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2020-10-11 18:44:04,039 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 167 flow [2020-10-11 18:44:04,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:04,040 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:04,040 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] [2020-10-11 18:44:04,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:44:04,040 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 85309990, now seen corresponding path program 1 times [2020-10-11 18:44:04,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:04,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209074739] [2020-10-11 18:44:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:04,367 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-11 18:44:04,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209074739] [2020-10-11 18:44:04,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:04,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:04,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459518994] [2020-10-11 18:44:04,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:04,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:04,914 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2020-10-11 18:44:04,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 167 flow. Second operand 11 states. [2020-10-11 18:44:04,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:04,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2020-10-11 18:44:04,916 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:05,370 INFO L129 PetriNetUnfolder]: 137/368 cut-off events. [2020-10-11 18:44:05,370 INFO L130 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2020-10-11 18:44:05,375 INFO L80 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 368 events. 137/368 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1691 event pairs, 59 based on Foata normal form. 14/368 useless extension candidates. Maximal degree in co-relation 830. Up to 129 conditions per place. [2020-10-11 18:44:05,378 INFO L132 encePairwiseOnDemand]: 62/74 looper letters, 13 selfloop transitions, 9 changer transitions 35/103 dead transitions. [2020-10-11 18:44:05,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 103 transitions, 391 flow [2020-10-11 18:44:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-11 18:44:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-11 18:44:05,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 940 transitions. [2020-10-11 18:44:05,383 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.793918918918919 [2020-10-11 18:44:05,384 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 940 transitions. [2020-10-11 18:44:05,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 940 transitions. [2020-10-11 18:44:05,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:05,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 940 transitions. [2020-10-11 18:44:05,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-11 18:44:05,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-11 18:44:05,390 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-11 18:44:05,390 INFO L185 Difference]: Start difference. First operand has 80 places, 62 transitions, 167 flow. Second operand 16 states and 940 transitions. [2020-10-11 18:44:05,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 103 transitions, 391 flow [2020-10-11 18:44:05,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 103 transitions, 370 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-11 18:44:05,401 INFO L241 Difference]: Finished difference. Result has 96 places, 66 transitions, 232 flow [2020-10-11 18:44:05,402 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=232, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2020-10-11 18:44:05,402 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 19 predicate places. [2020-10-11 18:44:05,402 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 232 flow [2020-10-11 18:44:05,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:05,402 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:05,403 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-11 18:44:05,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:44:05,403 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1238327072, now seen corresponding path program 1 times [2020-10-11 18:44:05,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:05,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610091234] [2020-10-11 18:44:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:05,659 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-11 18:44:05,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610091234] [2020-10-11 18:44:05,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:05,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:44:05,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64117739] [2020-10-11 18:44:05,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:44:05,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:44:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:44:06,404 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 74 [2020-10-11 18:44:06,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 66 transitions, 232 flow. Second operand 9 states. [2020-10-11 18:44:06,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:06,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 74 [2020-10-11 18:44:06,405 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:06,762 INFO L129 PetriNetUnfolder]: 72/274 cut-off events. [2020-10-11 18:44:06,763 INFO L130 PetriNetUnfolder]: For 765/857 co-relation queries the response was YES. [2020-10-11 18:44:06,764 INFO L80 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 274 events. 72/274 cut-off events. For 765/857 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1263 event pairs, 18 based on Foata normal form. 10/275 useless extension candidates. Maximal degree in co-relation 794. Up to 66 conditions per place. [2020-10-11 18:44:06,766 INFO L132 encePairwiseOnDemand]: 65/74 looper letters, 17 selfloop transitions, 7 changer transitions 25/98 dead transitions. [2020-10-11 18:44:06,766 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 568 flow [2020-10-11 18:44:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:44:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:44:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 696 transitions. [2020-10-11 18:44:06,769 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.855036855036855 [2020-10-11 18:44:06,769 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 696 transitions. [2020-10-11 18:44:06,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 696 transitions. [2020-10-11 18:44:06,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:06,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 696 transitions. [2020-10-11 18:44:06,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:44:06,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:44:06,774 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:44:06,774 INFO L185 Difference]: Start difference. First operand has 96 places, 66 transitions, 232 flow. Second operand 11 states and 696 transitions. [2020-10-11 18:44:06,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 568 flow [2020-10-11 18:44:06,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 98 transitions, 542 flow, removed 10 selfloop flow, removed 6 redundant places. [2020-10-11 18:44:06,781 INFO L241 Difference]: Finished difference. Result has 98 places, 68 transitions, 281 flow [2020-10-11 18:44:06,782 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=281, PETRI_PLACES=98, PETRI_TRANSITIONS=68} [2020-10-11 18:44:06,782 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 21 predicate places. [2020-10-11 18:44:06,782 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 68 transitions, 281 flow [2020-10-11 18:44:06,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:44:06,782 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:06,783 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] [2020-10-11 18:44:06,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:44:06,783 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:06,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash -862354673, now seen corresponding path program 1 times [2020-10-11 18:44:06,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:06,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788131891] [2020-10-11 18:44:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:07,032 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-11 18:44:07,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788131891] [2020-10-11 18:44:07,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:07,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:44:07,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537278085] [2020-10-11 18:44:07,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:44:07,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:44:07,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:44:08,414 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2020-10-11 18:44:08,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 68 transitions, 281 flow. Second operand 12 states. [2020-10-11 18:44:08,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:08,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2020-10-11 18:44:08,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:08,652 INFO L129 PetriNetUnfolder]: 54/215 cut-off events. [2020-10-11 18:44:08,653 INFO L130 PetriNetUnfolder]: For 999/1002 co-relation queries the response was YES. [2020-10-11 18:44:08,656 INFO L80 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 215 events. 54/215 cut-off events. For 999/1002 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 818 event pairs, 20 based on Foata normal form. 6/213 useless extension candidates. Maximal degree in co-relation 757. Up to 87 conditions per place. [2020-10-11 18:44:08,657 INFO L132 encePairwiseOnDemand]: 64/74 looper letters, 18 selfloop transitions, 7 changer transitions 13/84 dead transitions. [2020-10-11 18:44:08,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 84 transitions, 512 flow [2020-10-11 18:44:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 751 transitions. [2020-10-11 18:44:08,661 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7806652806652806 [2020-10-11 18:44:08,661 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 751 transitions. [2020-10-11 18:44:08,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 751 transitions. [2020-10-11 18:44:08,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:08,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 751 transitions. [2020-10-11 18:44:08,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:08,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:08,666 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:08,666 INFO L185 Difference]: Start difference. First operand has 98 places, 68 transitions, 281 flow. Second operand 13 states and 751 transitions. [2020-10-11 18:44:08,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 84 transitions, 512 flow [2020-10-11 18:44:08,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 84 transitions, 478 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-11 18:44:08,677 INFO L241 Difference]: Finished difference. Result has 105 places, 68 transitions, 292 flow [2020-10-11 18:44:08,677 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=292, PETRI_PLACES=105, PETRI_TRANSITIONS=68} [2020-10-11 18:44:08,678 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 28 predicate places. [2020-10-11 18:44:08,678 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 68 transitions, 292 flow [2020-10-11 18:44:08,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:44:08,678 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:08,679 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] [2020-10-11 18:44:08,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:44:08,679 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash -786273722, now seen corresponding path program 1 times [2020-10-11 18:44:08,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:08,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850778224] [2020-10-11 18:44:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:08,846 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-11 18:44:08,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850778224] [2020-10-11 18:44:08,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:08,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:08,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520229583] [2020-10-11 18:44:08,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:08,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:08,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:08,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:08,986 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 74 [2020-10-11 18:44:08,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 68 transitions, 292 flow. Second operand 6 states. [2020-10-11 18:44:08,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:08,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 74 [2020-10-11 18:44:08,987 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:09,114 INFO L129 PetriNetUnfolder]: 31/208 cut-off events. [2020-10-11 18:44:09,114 INFO L130 PetriNetUnfolder]: For 1282/1391 co-relation queries the response was YES. [2020-10-11 18:44:09,115 INFO L80 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 208 events. 31/208 cut-off events. For 1282/1391 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 888 event pairs, 7 based on Foata normal form. 13/215 useless extension candidates. Maximal degree in co-relation 743. Up to 43 conditions per place. [2020-10-11 18:44:09,117 INFO L132 encePairwiseOnDemand]: 68/74 looper letters, 12 selfloop transitions, 3 changer transitions 10/82 dead transitions. [2020-10-11 18:44:09,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 82 transitions, 488 flow [2020-10-11 18:44:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 593 transitions. [2020-10-11 18:44:09,119 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8903903903903904 [2020-10-11 18:44:09,120 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 593 transitions. [2020-10-11 18:44:09,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 593 transitions. [2020-10-11 18:44:09,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:09,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 593 transitions. [2020-10-11 18:44:09,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:09,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:09,123 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:09,124 INFO L185 Difference]: Start difference. First operand has 105 places, 68 transitions, 292 flow. Second operand 9 states and 593 transitions. [2020-10-11 18:44:09,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 82 transitions, 488 flow [2020-10-11 18:44:09,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 82 transitions, 402 flow, removed 37 selfloop flow, removed 14 redundant places. [2020-10-11 18:44:09,130 INFO L241 Difference]: Finished difference. Result has 100 places, 68 transitions, 277 flow [2020-10-11 18:44:09,130 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=277, PETRI_PLACES=100, PETRI_TRANSITIONS=68} [2020-10-11 18:44:09,131 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2020-10-11 18:44:09,131 INFO L481 AbstractCegarLoop]: Abstraction has has 100 places, 68 transitions, 277 flow [2020-10-11 18:44:09,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:09,131 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:09,131 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] [2020-10-11 18:44:09,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:44:09,132 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:09,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2003432899, now seen corresponding path program 1 times [2020-10-11 18:44:09,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:09,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669964949] [2020-10-11 18:44:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:09,498 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-11 18:44:09,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669964949] [2020-10-11 18:44:09,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:09,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:44:09,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169863262] [2020-10-11 18:44:09,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:44:09,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:44:09,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:44:10,414 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2020-10-11 18:44:10,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 68 transitions, 277 flow. Second operand 12 states. [2020-10-11 18:44:10,416 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:10,416 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2020-10-11 18:44:10,416 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:10,760 INFO L129 PetriNetUnfolder]: 63/278 cut-off events. [2020-10-11 18:44:10,760 INFO L130 PetriNetUnfolder]: For 1383/1396 co-relation queries the response was YES. [2020-10-11 18:44:10,761 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 278 events. 63/278 cut-off events. For 1383/1396 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1321 event pairs, 19 based on Foata normal form. 5/276 useless extension candidates. Maximal degree in co-relation 959. Up to 118 conditions per place. [2020-10-11 18:44:10,763 INFO L132 encePairwiseOnDemand]: 62/74 looper letters, 18 selfloop transitions, 8 changer transitions 15/87 dead transitions. [2020-10-11 18:44:10,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 87 transitions, 529 flow [2020-10-11 18:44:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 752 transitions. [2020-10-11 18:44:10,767 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7817047817047817 [2020-10-11 18:44:10,768 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 752 transitions. [2020-10-11 18:44:10,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 752 transitions. [2020-10-11 18:44:10,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:10,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 752 transitions. [2020-10-11 18:44:10,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:10,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:10,772 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:10,772 INFO L185 Difference]: Start difference. First operand has 100 places, 68 transitions, 277 flow. Second operand 13 states and 752 transitions. [2020-10-11 18:44:10,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 87 transitions, 529 flow [2020-10-11 18:44:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 87 transitions, 492 flow, removed 17 selfloop flow, removed 7 redundant places. [2020-10-11 18:44:10,779 INFO L241 Difference]: Finished difference. Result has 107 places, 70 transitions, 309 flow [2020-10-11 18:44:10,779 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=309, PETRI_PLACES=107, PETRI_TRANSITIONS=70} [2020-10-11 18:44:10,779 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 30 predicate places. [2020-10-11 18:44:10,779 INFO L481 AbstractCegarLoop]: Abstraction has has 107 places, 70 transitions, 309 flow [2020-10-11 18:44:10,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:44:10,780 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:10,780 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] [2020-10-11 18:44:10,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:44:10,780 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:10,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1130819779, now seen corresponding path program 2 times [2020-10-11 18:44:10,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:10,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933377904] [2020-10-11 18:44:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:44:11,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933377904] [2020-10-11 18:44:11,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:11,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:11,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719466831] [2020-10-11 18:44:11,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:11,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:11,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:11,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:11,820 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 74 [2020-10-11 18:44:11,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 70 transitions, 309 flow. Second operand 11 states. [2020-10-11 18:44:11,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:11,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 74 [2020-10-11 18:44:11,822 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:12,278 INFO L129 PetriNetUnfolder]: 60/314 cut-off events. [2020-10-11 18:44:12,278 INFO L130 PetriNetUnfolder]: For 2364/2415 co-relation queries the response was YES. [2020-10-11 18:44:12,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 314 events. 60/314 cut-off events. For 2364/2415 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1653 event pairs, 16 based on Foata normal form. 15/323 useless extension candidates. Maximal degree in co-relation 1196. Up to 101 conditions per place. [2020-10-11 18:44:12,282 INFO L132 encePairwiseOnDemand]: 63/74 looper letters, 22 selfloop transitions, 11 changer transitions 13/92 dead transitions. [2020-10-11 18:44:12,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 92 transitions, 685 flow [2020-10-11 18:44:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 767 transitions. [2020-10-11 18:44:12,294 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7972972972972973 [2020-10-11 18:44:12,294 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 767 transitions. [2020-10-11 18:44:12,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 767 transitions. [2020-10-11 18:44:12,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:12,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 767 transitions. [2020-10-11 18:44:12,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:12,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:12,299 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:12,299 INFO L185 Difference]: Start difference. First operand has 107 places, 70 transitions, 309 flow. Second operand 13 states and 767 transitions. [2020-10-11 18:44:12,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 92 transitions, 685 flow [2020-10-11 18:44:12,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 92 transitions, 579 flow, removed 49 selfloop flow, removed 10 redundant places. [2020-10-11 18:44:12,307 INFO L241 Difference]: Finished difference. Result has 110 places, 74 transitions, 386 flow [2020-10-11 18:44:12,308 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=386, PETRI_PLACES=110, PETRI_TRANSITIONS=74} [2020-10-11 18:44:12,308 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 33 predicate places. [2020-10-11 18:44:12,308 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 74 transitions, 386 flow [2020-10-11 18:44:12,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:12,308 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:12,309 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] [2020-10-11 18:44:12,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:44:12,309 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:12,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:12,309 INFO L82 PathProgramCache]: Analyzing trace with hash 922342277, now seen corresponding path program 3 times [2020-10-11 18:44:12,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:12,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261946449] [2020-10-11 18:44:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:12,596 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-11 18:44:12,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261946449] [2020-10-11 18:44:12,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:12,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:44:12,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751116780] [2020-10-11 18:44:12,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:44:12,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:12,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:44:12,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:44:14,135 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2020-10-11 18:44:14,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 74 transitions, 386 flow. Second operand 13 states. [2020-10-11 18:44:14,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:14,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2020-10-11 18:44:14,136 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:14,606 INFO L129 PetriNetUnfolder]: 58/303 cut-off events. [2020-10-11 18:44:14,607 INFO L130 PetriNetUnfolder]: For 2436/2532 co-relation queries the response was YES. [2020-10-11 18:44:14,608 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 303 events. 58/303 cut-off events. For 2436/2532 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1568 event pairs, 25 based on Foata normal form. 18/315 useless extension candidates. Maximal degree in co-relation 1218. Up to 129 conditions per place. [2020-10-11 18:44:14,611 INFO L132 encePairwiseOnDemand]: 61/74 looper letters, 20 selfloop transitions, 5 changer transitions 19/90 dead transitions. [2020-10-11 18:44:14,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 90 transitions, 693 flow [2020-10-11 18:44:14,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:44:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:44:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 862 transitions. [2020-10-11 18:44:14,617 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7765765765765765 [2020-10-11 18:44:14,617 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 862 transitions. [2020-10-11 18:44:14,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 862 transitions. [2020-10-11 18:44:14,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:14,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 862 transitions. [2020-10-11 18:44:14,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:44:14,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:44:14,625 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:44:14,625 INFO L185 Difference]: Start difference. First operand has 110 places, 74 transitions, 386 flow. Second operand 15 states and 862 transitions. [2020-10-11 18:44:14,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 90 transitions, 693 flow [2020-10-11 18:44:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 90 transitions, 600 flow, removed 39 selfloop flow, removed 11 redundant places. [2020-10-11 18:44:14,639 INFO L241 Difference]: Finished difference. Result has 113 places, 70 transitions, 343 flow [2020-10-11 18:44:14,639 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=343, PETRI_PLACES=113, PETRI_TRANSITIONS=70} [2020-10-11 18:44:14,639 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 36 predicate places. [2020-10-11 18:44:14,639 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 70 transitions, 343 flow [2020-10-11 18:44:14,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:44:14,640 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:14,640 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] [2020-10-11 18:44:14,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:44:14,640 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:14,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:14,641 INFO L82 PathProgramCache]: Analyzing trace with hash -766505515, now seen corresponding path program 4 times [2020-10-11 18:44:14,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:14,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488418847] [2020-10-11 18:44:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:15,020 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-11 18:44:15,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488418847] [2020-10-11 18:44:15,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:15,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:44:15,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749664387] [2020-10-11 18:44:15,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:44:15,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:44:15,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:44:16,529 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 74 [2020-10-11 18:44:16,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 70 transitions, 343 flow. Second operand 11 states. [2020-10-11 18:44:16,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:16,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 74 [2020-10-11 18:44:16,530 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:16,807 INFO L129 PetriNetUnfolder]: 40/272 cut-off events. [2020-10-11 18:44:16,808 INFO L130 PetriNetUnfolder]: For 2021/2079 co-relation queries the response was YES. [2020-10-11 18:44:16,811 INFO L80 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 272 events. 40/272 cut-off events. For 2021/2079 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1460 event pairs, 10 based on Foata normal form. 19/287 useless extension candidates. Maximal degree in co-relation 916. Up to 56 conditions per place. [2020-10-11 18:44:16,813 INFO L132 encePairwiseOnDemand]: 64/74 looper letters, 15 selfloop transitions, 10 changer transitions 13/84 dead transitions. [2020-10-11 18:44:16,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 84 transitions, 607 flow [2020-10-11 18:44:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:44:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:44:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 761 transitions. [2020-10-11 18:44:16,819 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7910602910602911 [2020-10-11 18:44:16,819 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 761 transitions. [2020-10-11 18:44:16,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 761 transitions. [2020-10-11 18:44:16,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:16,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 761 transitions. [2020-10-11 18:44:16,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:44:16,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:44:16,824 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:44:16,824 INFO L185 Difference]: Start difference. First operand has 113 places, 70 transitions, 343 flow. Second operand 13 states and 761 transitions. [2020-10-11 18:44:16,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 84 transitions, 607 flow [2020-10-11 18:44:16,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 84 transitions, 483 flow, removed 55 selfloop flow, removed 15 redundant places. [2020-10-11 18:44:16,831 INFO L241 Difference]: Finished difference. Result has 106 places, 67 transitions, 303 flow [2020-10-11 18:44:16,832 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=303, PETRI_PLACES=106, PETRI_TRANSITIONS=67} [2020-10-11 18:44:16,832 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2020-10-11 18:44:16,832 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 67 transitions, 303 flow [2020-10-11 18:44:16,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:44:16,833 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:16,833 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] [2020-10-11 18:44:16,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:44:16,833 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:16,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1946284197, now seen corresponding path program 1 times [2020-10-11 18:44:16,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:16,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986285301] [2020-10-11 18:44:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:16,947 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-11 18:44:16,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986285301] [2020-10-11 18:44:16,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:16,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:44:16,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569136319] [2020-10-11 18:44:16,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:44:16,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:16,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:44:16,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:44:17,058 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 74 [2020-10-11 18:44:17,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 67 transitions, 303 flow. Second operand 6 states. [2020-10-11 18:44:17,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:17,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 74 [2020-10-11 18:44:17,059 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:17,225 INFO L129 PetriNetUnfolder]: 60/298 cut-off events. [2020-10-11 18:44:17,225 INFO L130 PetriNetUnfolder]: For 329/335 co-relation queries the response was YES. [2020-10-11 18:44:17,227 INFO L80 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 298 events. 60/298 cut-off events. For 329/335 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1633 event pairs, 15 based on Foata normal form. 11/297 useless extension candidates. Maximal degree in co-relation 597. Up to 60 conditions per place. [2020-10-11 18:44:17,228 INFO L132 encePairwiseOnDemand]: 66/74 looper letters, 11 selfloop transitions, 11 changer transitions 6/85 dead transitions. [2020-10-11 18:44:17,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 85 transitions, 384 flow [2020-10-11 18:44:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:44:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:44:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 588 transitions. [2020-10-11 18:44:17,231 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8828828828828829 [2020-10-11 18:44:17,232 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 588 transitions. [2020-10-11 18:44:17,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 588 transitions. [2020-10-11 18:44:17,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:17,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 588 transitions. [2020-10-11 18:44:17,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:44:17,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:44:17,236 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:44:17,236 INFO L185 Difference]: Start difference. First operand has 106 places, 67 transitions, 303 flow. Second operand 9 states and 588 transitions. [2020-10-11 18:44:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 85 transitions, 384 flow [2020-10-11 18:44:17,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 85 transitions, 315 flow, removed 25 selfloop flow, removed 20 redundant places. [2020-10-11 18:44:17,242 INFO L241 Difference]: Finished difference. Result has 93 places, 76 transitions, 298 flow [2020-10-11 18:44:17,242 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=298, PETRI_PLACES=93, PETRI_TRANSITIONS=76} [2020-10-11 18:44:17,242 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 16 predicate places. [2020-10-11 18:44:17,243 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 76 transitions, 298 flow [2020-10-11 18:44:17,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:44:17,243 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:17,243 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-11 18:44:17,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:44:17,244 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash 271073769, now seen corresponding path program 1 times [2020-10-11 18:44:17,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:17,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461521986] [2020-10-11 18:44:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:44:17,403 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-11 18:44:17,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461521986] [2020-10-11 18:44:17,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:44:17,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:44:17,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310080082] [2020-10-11 18:44:17,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:44:17,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:44:17,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:44:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:44:17,550 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 74 [2020-10-11 18:44:17,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 76 transitions, 298 flow. Second operand 7 states. [2020-10-11 18:44:17,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:44:17,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 74 [2020-10-11 18:44:17,551 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:44:17,725 INFO L129 PetriNetUnfolder]: 34/235 cut-off events. [2020-10-11 18:44:17,725 INFO L130 PetriNetUnfolder]: For 205/302 co-relation queries the response was YES. [2020-10-11 18:44:17,726 INFO L80 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 235 events. 34/235 cut-off events. For 205/302 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1238 event pairs, 0 based on Foata normal form. 48/274 useless extension candidates. Maximal degree in co-relation 524. Up to 34 conditions per place. [2020-10-11 18:44:17,727 INFO L132 encePairwiseOnDemand]: 66/74 looper letters, 8 selfloop transitions, 15 changer transitions 13/89 dead transitions. [2020-10-11 18:44:17,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 417 flow [2020-10-11 18:44:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:44:17,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:44:17,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 774 transitions. [2020-10-11 18:44:17,730 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8716216216216216 [2020-10-11 18:44:17,730 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 774 transitions. [2020-10-11 18:44:17,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 774 transitions. [2020-10-11 18:44:17,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:44:17,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 774 transitions. [2020-10-11 18:44:17,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:44:17,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:44:17,733 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:44:17,733 INFO L185 Difference]: Start difference. First operand has 93 places, 76 transitions, 298 flow. Second operand 12 states and 774 transitions. [2020-10-11 18:44:17,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 417 flow [2020-10-11 18:44:17,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 89 transitions, 378 flow, removed 13 selfloop flow, removed 8 redundant places. [2020-10-11 18:44:17,737 INFO L241 Difference]: Finished difference. Result has 102 places, 74 transitions, 304 flow [2020-10-11 18:44:17,737 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=304, PETRI_PLACES=102, PETRI_TRANSITIONS=74} [2020-10-11 18:44:17,737 INFO L341 CegarLoopForPetriNet]: 77 programPoint places, 25 predicate places. [2020-10-11 18:44:17,738 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 74 transitions, 304 flow [2020-10-11 18:44:17,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:44:17,738 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:44:17,738 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] [2020-10-11 18:44:17,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:44:17,738 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:44:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:44:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash -956264260, now seen corresponding path program 1 times [2020-10-11 18:44:17,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:44:17,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106592075] [2020-10-11 18:44:17,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:44:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:44:17,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:44:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:44:17,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:44:17,836 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:44:17,836 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:44:17,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:44:17,859 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-11 18:44:17,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,861 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-11 18:44:17,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,861 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-11 18:44:17,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,861 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-11 18:44:17,861 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,862 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-11 18:44:17,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,862 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-11 18:44:17,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,862 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-11 18:44:17,862 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,863 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-11 18:44:17,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,863 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-11 18:44:17,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,863 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-11 18:44:17,863 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,864 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-11 18:44:17,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,864 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-11 18:44:17,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,864 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-11 18:44:17,864 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,865 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-11 18:44:17,865 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,866 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-11 18:44:17,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,866 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-11 18:44:17,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,866 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-11 18:44:17,866 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,867 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-11 18:44:17,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,867 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-11 18:44:17,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,867 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-11 18:44:17,867 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,868 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-11 18:44:17,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,868 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-11 18:44:17,868 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,868 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-11 18:44:17,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,869 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-11 18:44:17,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,869 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-11 18:44:17,869 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,869 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-11 18:44:17,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,870 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-11 18:44:17,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,870 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-11 18:44:17,870 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:44:17,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:44:17 BasicIcfg [2020-10-11 18:44:17,939 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:44:17,942 INFO L168 Benchmark]: Toolchain (without parser) took 17846.98 ms. Allocated memory was 253.2 MB in the beginning and 568.9 MB in the end (delta: 315.6 MB). Free memory was 205.2 MB in the beginning and 409.8 MB in the end (delta: -204.6 MB). Peak memory consumption was 111.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:17,942 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:44:17,943 INFO L168 Benchmark]: CACSL2BoogieTranslator took 739.44 ms. Allocated memory was 253.2 MB in the beginning and 318.8 MB in the end (delta: 65.5 MB). Free memory was 205.2 MB in the beginning and 271.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:17,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.35 ms. Allocated memory is still 318.8 MB. Free memory was 271.4 MB in the beginning and 266.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:17,944 INFO L168 Benchmark]: Boogie Preprocessor took 49.47 ms. Allocated memory is still 318.8 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:44:17,947 INFO L168 Benchmark]: RCFGBuilder took 1771.03 ms. Allocated memory was 318.8 MB in the beginning and 358.6 MB in the end (delta: 39.8 MB). Free memory was 263.8 MB in the beginning and 217.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:17,948 INFO L168 Benchmark]: TraceAbstraction took 15213.41 ms. Allocated memory was 358.6 MB in the beginning and 568.9 MB in the end (delta: 210.2 MB). Free memory was 213.9 MB in the beginning and 409.8 MB in the end (delta: -195.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.2 GB. [2020-10-11 18:44:17,956 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 739.44 ms. Allocated memory was 253.2 MB in the beginning and 318.8 MB in the end (delta: 65.5 MB). Free memory was 205.2 MB in the beginning and 271.4 MB in the end (delta: -66.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.35 ms. Allocated memory is still 318.8 MB. Free memory was 271.4 MB in the beginning and 266.3 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.47 ms. Allocated memory is still 318.8 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1771.03 ms. Allocated memory was 318.8 MB in the beginning and 358.6 MB in the end (delta: 39.8 MB). Free memory was 263.8 MB in the beginning and 217.2 MB in the end (delta: 46.6 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15213.41 ms. Allocated memory was 358.6 MB in the beginning and 568.9 MB in the end (delta: 210.2 MB). Free memory was 213.9 MB in the beginning and 409.8 MB in the end (delta: -195.9 MB). Peak memory consumption was 14.3 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] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 0 pthread_t t2479; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 0 pthread_t t2480; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 2 x$w_buff1 = x$w_buff0 [L744] 2 x$w_buff0 = 2 [L745] 2 x$w_buff1_used = x$w_buff0_used [L746] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L748] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L749] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L750] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L751] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L761] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L731] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L732] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L733] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L792] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 x$flush_delayed = weak$$choice2 [L798] 0 x$mem_tmp = x [L799] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L800] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L801] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L801] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L807] 0 x = x$flush_delayed ? x$mem_tmp : x [L808] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 428 SDtfs, 600 SDslu, 2044 SDs, 0 SdLazy, 1828 SolverSat, 286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 190072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...