/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:07:00,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:07:00,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:07:00,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:07:00,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:07:00,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:07:00,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:07:00,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:07:00,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:07:00,798 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:07:00,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:07:00,800 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:07:00,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:07:00,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:07:00,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:07:00,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:07:00,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:07:00,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:07:00,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:07:00,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:07:00,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:07:00,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:07:00,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:07:00,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:07:00,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:07:00,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:07:00,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:07:00,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:07:00,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:07:00,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:07:00,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:07:00,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:07:00,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:07:00,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:07:00,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:07:00,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:07:00,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:07:00,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:07:00,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:07:00,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:07:00,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:07:00,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:07:00,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:07:00,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:07:00,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:07:00,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:07:00,843 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:07:00,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:07:00,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:07:00,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:07:00,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:07:00,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:07:00,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:07:00,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:07:00,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:07:00,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:07:00,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:07:00,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:07:00,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:07:00,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:07:00,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:07:00,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:07:00,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:07:00,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:07:00,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:07:00,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:07:00,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:07:00,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:07:00,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:07:00,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:07:00,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:07:01,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:07:01,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:07:01,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:07:01,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:07:01,189 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:07:01,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2022-12-13 07:07:02,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:07:02,606 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:07:02,607 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2022-12-13 07:07:02,613 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c55b54471/5b0e57ca07184cb58dc29c186c05b3b0/FLAGd8937fffa [2022-12-13 07:07:02,624 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c55b54471/5b0e57ca07184cb58dc29c186c05b3b0 [2022-12-13 07:07:02,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:07:02,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:07:02,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:07:02,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:07:02,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:07:02,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61cf8d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02, skipping insertion in model container [2022-12-13 07:07:02,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:07:02,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:07:02,827 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c[2954,2967] [2022-12-13 07:07:02,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:07:02,853 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:07:02,888 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c[2954,2967] [2022-12-13 07:07:02,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:07:02,904 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:07:02,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02 WrapperNode [2022-12-13 07:07:02,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:07:02,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:07:02,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:07:02,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:07:02,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,966 INFO L138 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 202 [2022-12-13 07:07:02,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:07:02,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:07:02,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:07:02,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:07:02,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:02,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:03,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:03,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:03,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:07:03,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:07:03,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:07:03,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:07:03,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (1/1) ... [2022-12-13 07:07:03,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:07:03,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:07:03,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:07:03,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:07:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:07:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:07:03,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:07:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:07:03,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:07:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:07:03,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:07:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:07:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:07:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:07:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:07:03,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:07:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:07:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:07:03,093 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:07:03,240 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:07:03,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:07:03,624 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:07:03,634 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:07:03,634 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 07:07:03,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:07:03 BoogieIcfgContainer [2022-12-13 07:07:03,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:07:03,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:07:03,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:07:03,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:07:03,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:07:02" (1/3) ... [2022-12-13 07:07:03,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65993a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:07:03, skipping insertion in model container [2022-12-13 07:07:03,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:07:02" (2/3) ... [2022-12-13 07:07:03,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65993a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:07:03, skipping insertion in model container [2022-12-13 07:07:03,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:07:03" (3/3) ... [2022-12-13 07:07:03,655 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2022-12-13 07:07:03,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:07:03,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:07:03,677 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:07:03,834 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:07:03,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 237 places, 240 transitions, 504 flow [2022-12-13 07:07:03,960 INFO L130 PetriNetUnfolder]: 13/237 cut-off events. [2022-12-13 07:07:03,960 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:03,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 237 events. 13/237 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 335 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-13 07:07:03,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 237 places, 240 transitions, 504 flow [2022-12-13 07:07:03,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 227 transitions, 472 flow [2022-12-13 07:07:03,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:04,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 227 transitions, 472 flow [2022-12-13 07:07:04,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 227 transitions, 472 flow [2022-12-13 07:07:04,141 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-12-13 07:07:04,141 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:04,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 227 events. 13/227 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 334 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2022-12-13 07:07:04,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 227 transitions, 472 flow [2022-12-13 07:07:04,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 16638 [2022-12-13 07:07:12,321 INFO L241 LiptonReduction]: Total number of compositions: 211 [2022-12-13 07:07:12,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:07:12,347 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fdd8f55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:07:12,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:07:12,359 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 07:07:12,359 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:12,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:12,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:12,361 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 865913725, now seen corresponding path program 1 times [2022-12-13 07:07:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68451147] [2022-12-13 07:07:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:13,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:13,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68451147] [2022-12-13 07:07:13,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68451147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:13,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:13,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222815352] [2022-12-13 07:07:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:13,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:13,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:07:13,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:13,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:13,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:07:13,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:13,599 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 07:07:13,599 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 07:07:13,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 283 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-13 07:07:13,603 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-13 07:07:13,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-13 07:07:13,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 07:07:13,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 07:07:13,619 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2022-12-13 07:07:13,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 45 transitions, 228 flow [2022-12-13 07:07:13,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 38 transitions, 191 flow [2022-12-13 07:07:13,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:13,622 INFO L89 Accepts]: Start accepts. Operand has 30 places, 38 transitions, 191 flow [2022-12-13 07:07:13,625 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:13,625 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:13,625 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 38 transitions, 191 flow [2022-12-13 07:07:13,628 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 38 transitions, 191 flow [2022-12-13 07:07:13,628 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:13,629 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:13,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 07:07:13,631 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 38 transitions, 191 flow [2022-12-13 07:07:13,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:13,631 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:13,631 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:13,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:07:13,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:13,632 INFO L85 PathProgramCache]: Analyzing trace with hash 927589825, now seen corresponding path program 2 times [2022-12-13 07:07:13,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:13,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255464891] [2022-12-13 07:07:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:13,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:14,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:14,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255464891] [2022-12-13 07:07:14,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255464891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:14,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:14,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995947418] [2022-12-13 07:07:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:14,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:14,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:14,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:14,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:07:14,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 38 transitions, 191 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:14,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:14,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:07:14,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:14,282 INFO L130 PetriNetUnfolder]: 38/116 cut-off events. [2022-12-13 07:07:14,283 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 07:07:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 116 events. 38/116 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 415 event pairs, 0 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 274. Up to 58 conditions per place. [2022-12-13 07:07:14,284 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 44 selfloop transitions, 7 changer transitions 16/67 dead transitions. [2022-12-13 07:07:14,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 67 transitions, 471 flow [2022-12-13 07:07:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-13 07:07:14,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-13 07:07:14,286 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 07:07:14,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 67 transitions, 471 flow [2022-12-13 07:07:14,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 51 transitions, 357 flow [2022-12-13 07:07:14,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:14,288 INFO L89 Accepts]: Start accepts. Operand has 34 places, 51 transitions, 357 flow [2022-12-13 07:07:14,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:14,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:14,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 51 transitions, 357 flow [2022-12-13 07:07:14,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 51 transitions, 357 flow [2022-12-13 07:07:14,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:14,291 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:14,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 07:07:14,293 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 51 transitions, 357 flow [2022-12-13 07:07:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:14,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:14,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:14,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:07:14,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1320418611, now seen corresponding path program 3 times [2022-12-13 07:07:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089814294] [2022-12-13 07:07:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:14,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089814294] [2022-12-13 07:07:14,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089814294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:14,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:14,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:14,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674294272] [2022-12-13 07:07:14,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:14,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:14,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:14,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:14,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:07:14,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 51 transitions, 357 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:14,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:14,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:07:14,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:14,805 INFO L130 PetriNetUnfolder]: 28/88 cut-off events. [2022-12-13 07:07:14,805 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 07:07:14,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 88 events. 28/88 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 258 event pairs, 0 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 274. Up to 55 conditions per place. [2022-12-13 07:07:14,806 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 34 selfloop transitions, 8 changer transitions 10/52 dead transitions. [2022-12-13 07:07:14,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 467 flow [2022-12-13 07:07:14,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:07:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:07:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-13 07:07:14,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4625 [2022-12-13 07:07:14,809 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 12 predicate places. [2022-12-13 07:07:14,809 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 52 transitions, 467 flow [2022-12-13 07:07:14,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 42 transitions, 375 flow [2022-12-13 07:07:14,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:14,811 INFO L89 Accepts]: Start accepts. Operand has 37 places, 42 transitions, 375 flow [2022-12-13 07:07:14,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:14,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:14,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 42 transitions, 375 flow [2022-12-13 07:07:14,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 42 transitions, 375 flow [2022-12-13 07:07:14,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:14,813 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:14,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:07:14,814 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 42 transitions, 375 flow [2022-12-13 07:07:14,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:14,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:14,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:14,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:07:14,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:14,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1877972475, now seen corresponding path program 4 times [2022-12-13 07:07:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:14,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706786890] [2022-12-13 07:07:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:14,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:15,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:15,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706786890] [2022-12-13 07:07:15,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706786890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:15,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:15,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:15,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825429983] [2022-12-13 07:07:15,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:15,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:15,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:15,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:15,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:15,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:07:15,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 42 transitions, 375 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:15,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:15,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:07:15,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:15,297 INFO L130 PetriNetUnfolder]: 17/57 cut-off events. [2022-12-13 07:07:15,297 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 07:07:15,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 57 events. 17/57 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 219. Up to 34 conditions per place. [2022-12-13 07:07:15,298 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 21 selfloop transitions, 5 changer transitions 15/41 dead transitions. [2022-12-13 07:07:15,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 449 flow [2022-12-13 07:07:15,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:07:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:07:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-12-13 07:07:15,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-13 07:07:15,299 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2022-12-13 07:07:15,300 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 449 flow [2022-12-13 07:07:15,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 26 transitions, 281 flow [2022-12-13 07:07:15,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:15,301 INFO L89 Accepts]: Start accepts. Operand has 41 places, 26 transitions, 281 flow [2022-12-13 07:07:15,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:15,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:15,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 281 flow [2022-12-13 07:07:15,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 281 flow [2022-12-13 07:07:15,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:15,303 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:15,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 07:07:15,304 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 281 flow [2022-12-13 07:07:15,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:15,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:15,304 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:15,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:07:15,305 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 5547123, now seen corresponding path program 5 times [2022-12-13 07:07:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:15,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460842977] [2022-12-13 07:07:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:15,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:15,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460842977] [2022-12-13 07:07:15,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460842977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:15,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:15,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426371436] [2022-12-13 07:07:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:15,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:15,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:15,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:07:15,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 281 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:15,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:15,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:07:15,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:15,770 INFO L130 PetriNetUnfolder]: 8/40 cut-off events. [2022-12-13 07:07:15,771 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 07:07:15,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 40 events. 8/40 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2022-12-13 07:07:15,772 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 16 selfloop transitions, 3 changer transitions 13/32 dead transitions. [2022-12-13 07:07:15,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 414 flow [2022-12-13 07:07:15,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-12-13 07:07:15,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2022-12-13 07:07:15,775 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2022-12-13 07:07:15,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 32 transitions, 414 flow [2022-12-13 07:07:15,776 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 19 transitions, 246 flow [2022-12-13 07:07:15,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:07:15,776 INFO L89 Accepts]: Start accepts. Operand has 44 places, 19 transitions, 246 flow [2022-12-13 07:07:15,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:07:15,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:15,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 19 transitions, 246 flow [2022-12-13 07:07:15,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 19 transitions, 246 flow [2022-12-13 07:07:15,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:15,780 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:15,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:07:15,782 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 19 transitions, 246 flow [2022-12-13 07:07:15,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:15,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:07:15,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:07:15,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:07:15,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:07:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:07:15,783 INFO L85 PathProgramCache]: Analyzing trace with hash 750249621, now seen corresponding path program 6 times [2022-12-13 07:07:15,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:07:15,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227279845] [2022-12-13 07:07:15,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:07:15,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:07:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:07:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:07:16,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:07:16,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227279845] [2022-12-13 07:07:16,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227279845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:07:16,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:07:16,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:07:16,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471275564] [2022-12-13 07:07:16,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:07:16,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:07:16,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:07:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:07:16,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:07:16,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 07:07:16,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 19 transitions, 246 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:16,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:07:16,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 07:07:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:07:16,201 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-13 07:07:16,202 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:07:16,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 21 events. 3/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 102. Up to 11 conditions per place. [2022-12-13 07:07:16,202 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2022-12-13 07:07:16,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 18 transitions, 270 flow [2022-12-13 07:07:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:07:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:07:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2022-12-13 07:07:16,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19791666666666666 [2022-12-13 07:07:16,205 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2022-12-13 07:07:16,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 18 transitions, 270 flow [2022-12-13 07:07:16,206 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 07:07:16,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:07:16,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 07:07:16,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 07:07:16,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:07:16,208 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:07:16,208 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 07:07:16,208 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 07:07:16,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:07:16,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:07:16,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:07:16,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:07:16,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:07:16,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:07:16,211 INFO L445 BasicCegarLoop]: Path program histogram: [6] [2022-12-13 07:07:16,215 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:07:16,215 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:07:16,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:07:16 BasicIcfg [2022-12-13 07:07:16,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:07:16,219 INFO L158 Benchmark]: Toolchain (without parser) took 13590.89ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 155.3MB in the beginning and 196.7MB in the end (delta: -41.4MB). Peak memory consumption was 69.7MB. Max. memory is 8.0GB. [2022-12-13 07:07:16,219 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:07:16,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.17ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 143.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 07:07:16,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.11ms. Allocated memory is still 178.3MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:07:16,220 INFO L158 Benchmark]: Boogie Preprocessor took 48.64ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 139.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 07:07:16,220 INFO L158 Benchmark]: RCFGBuilder took 620.44ms. Allocated memory is still 178.3MB. Free memory was 139.6MB in the beginning and 118.7MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 07:07:16,221 INFO L158 Benchmark]: TraceAbstraction took 12569.25ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 117.7MB in the beginning and 196.7MB in the end (delta: -79.0MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. [2022-12-13 07:07:16,222 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 274.17ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 143.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.11ms. Allocated memory is still 178.3MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.64ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 139.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 620.44ms. Allocated memory is still 178.3MB. Free memory was 139.6MB in the beginning and 118.7MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12569.25ms. Allocated memory was 178.3MB in the beginning and 287.3MB in the end (delta: 109.1MB). Free memory was 117.7MB in the beginning and 196.7MB in the end (delta: -79.0MB). Peak memory consumption was 32.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 224 PlacesBefore, 26 PlacesAfterwards, 227 TransitionsBefore, 16 TransitionsAfterwards, 16638 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 138 ConcurrentYvCompositions, 13 ChoiceCompositions, 211 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 10583, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 0, independent unconditional: 10583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 0, independent unconditional: 10583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10583, independent: 10583, independent conditional: 0, independent unconditional: 10583, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9084, independent: 9084, independent conditional: 0, independent unconditional: 9084, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9084, independent: 9084, independent conditional: 0, independent unconditional: 9084, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10583, independent: 1499, independent conditional: 0, independent unconditional: 1499, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9084, unknown conditional: 0, unknown unconditional: 9084] , Statistics on independence cache: Total cache size (in pairs): 19415, Positive cache size: 19415, Positive conditional cache size: 0, Positive unconditional cache size: 19415, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 88]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 363 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 206 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 0 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 959 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 07:07:16,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...