/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:42:07,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:42:07,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:42:07,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:42:07,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:42:07,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:42:07,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:42:07,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:42:07,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:42:07,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:42:07,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:42:07,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:42:07,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:42:07,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:42:07,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:42:07,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:42:07,808 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:42:07,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:42:07,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:42:07,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:42:07,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:42:07,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:42:07,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:42:07,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:42:07,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:42:07,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:42:07,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:42:07,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:42:07,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:42:07,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:42:07,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:42:07,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:42:07,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:42:07,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:42:07,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:42:07,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:42:07,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:42:07,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:42:07,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:42:07,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:42:07,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:42:07,850 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 01:42:07,874 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:42:07,874 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:42:07,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:42:07,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:42:07,876 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:42:07,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:42:07,876 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:42:07,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:42:07,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:42:07,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:42:07,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:42:07,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:42:07,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:42:07,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:42:07,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:42:07,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:42:07,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:42:07,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:42:07,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:42:07,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:42:07,879 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 [2022-12-13 01:42:08,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:42:08,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:42:08,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:42:08,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:42:08,156 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:42:08,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2022-12-13 01:42:09,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:42:09,310 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:42:09,310 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2022-12-13 01:42:09,315 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4566cdd9a/3bf0187cc7f3411a921bf3bb692127e9/FLAG6be91aa42 [2022-12-13 01:42:09,333 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4566cdd9a/3bf0187cc7f3411a921bf3bb692127e9 [2022-12-13 01:42:09,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:42:09,336 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:42:09,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:42:09,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:42:09,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:42:09,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@352e7257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09, skipping insertion in model container [2022-12-13 01:42:09,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:42:09,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:42:09,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,523 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/parallel-bluetooth.wvr.c[3134,3147] [2022-12-13 01:42:09,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:42:09,531 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:42:09,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:42:09,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:42:09,548 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/parallel-bluetooth.wvr.c[3134,3147] [2022-12-13 01:42:09,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:42:09,557 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:42:09,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09 WrapperNode [2022-12-13 01:42:09,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:42:09,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:42:09,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:42:09,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:42:09,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,581 INFO L138 Inliner]: procedures = 21, calls = 48, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 119 [2022-12-13 01:42:09,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:42:09,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:42:09,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:42:09,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:42:09,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:42:09,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:42:09,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:42:09,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:42:09,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (1/1) ... [2022-12-13 01:42:09,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:42:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:42:09,640 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 01:42:09,668 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 01:42:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:42:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:42:09,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:42:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:42:09,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:42:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:42:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:42:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:42:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:42:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:42:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:42:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:42:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:42:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:42:09,693 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 01:42:09,811 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:42:09,813 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:42:10,017 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:42:10,042 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:42:10,042 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 01:42:10,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:42:10 BoogieIcfgContainer [2022-12-13 01:42:10,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:42:10,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:42:10,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:42:10,049 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:42:10,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:42:09" (1/3) ... [2022-12-13 01:42:10,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367110ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:42:10, skipping insertion in model container [2022-12-13 01:42:10,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:42:09" (2/3) ... [2022-12-13 01:42:10,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367110ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:42:10, skipping insertion in model container [2022-12-13 01:42:10,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:42:10" (3/3) ... [2022-12-13 01:42:10,050 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bluetooth.wvr.c [2022-12-13 01:42:10,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:42:10,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:42:10,063 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:42:10,097 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 01:42:10,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 122 transitions, 260 flow [2022-12-13 01:42:10,175 INFO L130 PetriNetUnfolder]: 9/120 cut-off events. [2022-12-13 01:42:10,175 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:42:10,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 120 events. 9/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 01:42:10,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 122 transitions, 260 flow [2022-12-13 01:42:10,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 112 transitions, 236 flow [2022-12-13 01:42:10,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:10,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 112 transitions, 236 flow [2022-12-13 01:42:10,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 236 flow [2022-12-13 01:42:10,224 INFO L130 PetriNetUnfolder]: 9/112 cut-off events. [2022-12-13 01:42:10,224 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:42:10,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 112 events. 9/112 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-13 01:42:10,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 112 transitions, 236 flow [2022-12-13 01:42:10,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-13 01:42:12,951 INFO L241 LiptonReduction]: Total number of compositions: 92 [2022-12-13 01:42:12,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:42:12,987 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;@67c8bdd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:42:12,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 01:42:12,999 INFO L130 PetriNetUnfolder]: 2/20 cut-off events. [2022-12-13 01:42:13,000 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:42:13,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:13,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:13,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:13,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1352143916, now seen corresponding path program 1 times [2022-12-13 01:42:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:13,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729273271] [2022-12-13 01:42:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:13,329 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 01:42:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:13,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729273271] [2022-12-13 01:42:13,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729273271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:13,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:13,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:42:13,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106608897] [2022-12-13 01:42:13,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:13,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:42:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:13,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:42:13,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:42:13,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:42:13,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 01:42:13,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:13,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:42:13,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:13,488 INFO L130 PetriNetUnfolder]: 165/323 cut-off events. [2022-12-13 01:42:13,488 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 01:42:13,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 323 events. 165/323 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1264 event pairs, 30 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 602. Up to 121 conditions per place. [2022-12-13 01:42:13,491 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 42 selfloop transitions, 10 changer transitions 0/53 dead transitions. [2022-12-13 01:42:13,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 53 transitions, 240 flow [2022-12-13 01:42:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:42:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:42:13,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-12-13 01:42:13,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 01:42:13,502 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 5 states and 60 transitions. [2022-12-13 01:42:13,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 53 transitions, 240 flow [2022-12-13 01:42:13,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:42:13,510 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 115 flow [2022-12-13 01:42:13,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-13 01:42:13,516 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2022-12-13 01:42:13,516 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:13,517 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 115 flow [2022-12-13 01:42:13,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:13,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:13,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 115 flow [2022-12-13 01:42:13,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 115 flow [2022-12-13 01:42:13,529 INFO L130 PetriNetUnfolder]: 9/70 cut-off events. [2022-12-13 01:42:13,530 INFO L131 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2022-12-13 01:42:13,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 70 events. 9/70 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 283 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 84. Up to 17 conditions per place. [2022-12-13 01:42:13,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 115 flow [2022-12-13 01:42:13,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 01:42:13,545 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:13,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-13 01:42:13,547 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 115 flow [2022-12-13 01:42:13,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 01:42:13,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:13,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:13,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:42:13,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:13,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1739565572, now seen corresponding path program 2 times [2022-12-13 01:42:13,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:13,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015695686] [2022-12-13 01:42:13,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:13,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:13,752 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 01:42:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:13,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015695686] [2022-12-13 01:42:13,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015695686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:13,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:13,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:42:13,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452020414] [2022-12-13 01:42:13,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:42:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:42:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:42:13,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:42:13,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 01:42:13,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:13,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:42:13,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:13,840 INFO L130 PetriNetUnfolder]: 126/258 cut-off events. [2022-12-13 01:42:13,840 INFO L131 PetriNetUnfolder]: For 129/131 co-relation queries the response was YES. [2022-12-13 01:42:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 258 events. 126/258 cut-off events. For 129/131 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 978 event pairs, 0 based on Foata normal form. 16/274 useless extension candidates. Maximal degree in co-relation 398. Up to 159 conditions per place. [2022-12-13 01:42:13,857 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 35 selfloop transitions, 17 changer transitions 0/53 dead transitions. [2022-12-13 01:42:13,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 282 flow [2022-12-13 01:42:13,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:42:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:42:13,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-12-13 01:42:13,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2022-12-13 01:42:13,858 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 115 flow. Second operand 7 states and 59 transitions. [2022-12-13 01:42:13,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 282 flow [2022-12-13 01:42:13,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 01:42:13,860 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 193 flow [2022-12-13 01:42:13,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2022-12-13 01:42:13,861 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-13 01:42:13,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:13,861 INFO L89 Accepts]: Start accepts. Operand has 36 places, 34 transitions, 193 flow [2022-12-13 01:42:13,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:13,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:13,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 34 transitions, 193 flow [2022-12-13 01:42:13,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 193 flow [2022-12-13 01:42:13,866 INFO L130 PetriNetUnfolder]: 8/61 cut-off events. [2022-12-13 01:42:13,866 INFO L131 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2022-12-13 01:42:13,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 61 events. 8/61 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 230 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 112. Up to 18 conditions per place. [2022-12-13 01:42:13,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 34 transitions, 193 flow [2022-12-13 01:42:13,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 148 [2022-12-13 01:42:13,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:13,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 01:42:13,912 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 195 flow [2022-12-13 01:42:13,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 01:42:13,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:13,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:13,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:42:13,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1853342508, now seen corresponding path program 3 times [2022-12-13 01:42:13,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:13,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909689550] [2022-12-13 01:42:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:14,114 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 01:42:14,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:14,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909689550] [2022-12-13 01:42:14,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909689550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:14,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:14,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 01:42:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24077478] [2022-12-13 01:42:14,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:14,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:42:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:14,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:42:14,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:42:14,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 01:42:14,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 01:42:14,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:14,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 01:42:14,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:14,230 INFO L130 PetriNetUnfolder]: 215/428 cut-off events. [2022-12-13 01:42:14,230 INFO L131 PetriNetUnfolder]: For 486/486 co-relation queries the response was YES. [2022-12-13 01:42:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 428 events. 215/428 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1860 event pairs, 18 based on Foata normal form. 4/432 useless extension candidates. Maximal degree in co-relation 479. Up to 204 conditions per place. [2022-12-13 01:42:14,234 INFO L137 encePairwiseOnDemand]: 12/22 looper letters, 60 selfloop transitions, 25 changer transitions 0/85 dead transitions. [2022-12-13 01:42:14,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 85 transitions, 597 flow [2022-12-13 01:42:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:42:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:42:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 01:42:14,236 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2022-12-13 01:42:14,236 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 195 flow. Second operand 7 states and 73 transitions. [2022-12-13 01:42:14,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 85 transitions, 597 flow [2022-12-13 01:42:14,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 85 transitions, 576 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 01:42:14,242 INFO L231 Difference]: Finished difference. Result has 46 places, 51 transitions, 431 flow [2022-12-13 01:42:14,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=431, PETRI_PLACES=46, PETRI_TRANSITIONS=51} [2022-12-13 01:42:14,243 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2022-12-13 01:42:14,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:14,248 INFO L89 Accepts]: Start accepts. Operand has 46 places, 51 transitions, 431 flow [2022-12-13 01:42:14,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:14,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:14,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 51 transitions, 431 flow [2022-12-13 01:42:14,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 51 transitions, 431 flow [2022-12-13 01:42:14,261 INFO L130 PetriNetUnfolder]: 17/106 cut-off events. [2022-12-13 01:42:14,261 INFO L131 PetriNetUnfolder]: For 161/165 co-relation queries the response was YES. [2022-12-13 01:42:14,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 106 events. 17/106 cut-off events. For 161/165 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 520 event pairs, 1 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 283. Up to 32 conditions per place. [2022-12-13 01:42:14,262 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 51 transitions, 431 flow [2022-12-13 01:42:14,262 INFO L226 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-13 01:42:14,275 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] $Ultimate##0-->L65: Formula: (= v_~sFlag~0_3 1) InVars {} OutVars{~sFlag~0=v_~sFlag~0_3} AuxVars[] AssignedVars[~sFlag~0] and [450] $Ultimate##0-->L49: Formula: (let ((.cse0 (not (= (mod v_~sFlag~0_92 256) 0)))) (and (= (ite .cse0 v_~count~0_236 (+ v_~count~0_236 1)) (+ v_~count~0_234 1)) (= (ite (= (ite (or .cse0 (= (mod v_~stopped~0_87 256) 0)) 1 0) 0) 0 1) v_~v_assert~0_84))) InVars {~sFlag~0=v_~sFlag~0_92, ~stopped~0=v_~stopped~0_87, ~count~0=v_~count~0_236} OutVars{~v_assert~0=v_~v_assert~0_84, ~sFlag~0=v_~sFlag~0_92, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_13|, ~stopped~0=v_~stopped~0_87, ~count~0=v_~count~0_234} AuxVars[] AssignedVars[~v_assert~0, thread1Thread1of1ForFork1_#t~post1, ~count~0] [2022-12-13 01:42:14,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:42:14,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-13 01:42:14,293 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 51 transitions, 437 flow [2022-12-13 01:42:14,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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 01:42:14,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:14,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:14,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:42:14,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:14,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -37212394, now seen corresponding path program 4 times [2022-12-13 01:42:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:14,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118922767] [2022-12-13 01:42:14,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:14,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:14,410 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 01:42:14,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118922767] [2022-12-13 01:42:14,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118922767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:14,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:14,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:42:14,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850845361] [2022-12-13 01:42:14,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:14,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 01:42:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 01:42:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 01:42:14,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-13 01:42:14,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 51 transitions, 437 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 01:42:14,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:14,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-13 01:42:14,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:14,486 INFO L130 PetriNetUnfolder]: 186/397 cut-off events. [2022-12-13 01:42:14,486 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-13 01:42:14,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 397 events. 186/397 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1830 event pairs, 28 based on Foata normal form. 3/396 useless extension candidates. Maximal degree in co-relation 1021. Up to 283 conditions per place. [2022-12-13 01:42:14,488 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 15 selfloop transitions, 2 changer transitions 54/72 dead transitions. [2022-12-13 01:42:14,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 697 flow [2022-12-13 01:42:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:42:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:42:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-13 01:42:14,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2022-12-13 01:42:14,489 INFO L175 Difference]: Start difference. First operand has 46 places, 51 transitions, 437 flow. Second operand 5 states and 49 transitions. [2022-12-13 01:42:14,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 697 flow [2022-12-13 01:42:14,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 693 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 01:42:14,493 INFO L231 Difference]: Finished difference. Result has 52 places, 17 transitions, 100 flow [2022-12-13 01:42:14,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=52, PETRI_TRANSITIONS=17} [2022-12-13 01:42:14,493 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2022-12-13 01:42:14,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:42:14,494 INFO L89 Accepts]: Start accepts. Operand has 52 places, 17 transitions, 100 flow [2022-12-13 01:42:14,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:42:14,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:14,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 17 transitions, 100 flow [2022-12-13 01:42:14,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 17 transitions, 100 flow [2022-12-13 01:42:14,497 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 01:42:14,497 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 01:42:14,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 17 events. 0/17 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 1 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 01:42:14,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 17 transitions, 100 flow [2022-12-13 01:42:14,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-13 01:42:14,510 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [309] L45-->L49: Formula: (= (+ v_~count~0_26 1) v_~count~0_27) InVars {~count~0=v_~count~0_27} OutVars{~count~0=v_~count~0_26, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~count~0] and [308] $Ultimate##0-->L45: Formula: (let ((.cse0 (not (= (mod v_~sFlag~0_7 256) 0)))) (and (= (ite .cse0 v_~count~0_19 (+ v_~count~0_19 1)) v_~count~0_18) (= (ite (= (ite (or (= (mod v_~stopped~0_6 256) 0) .cse0) 1 0) 0) 0 1) v_~v_assert~0_6))) InVars {~stopped~0=v_~stopped~0_6, ~sFlag~0=v_~sFlag~0_7, ~count~0=v_~count~0_19} OutVars{~v_assert~0=v_~v_assert~0_6, ~stopped~0=v_~stopped~0_6, ~sFlag~0=v_~sFlag~0_7, ~count~0=v_~count~0_18} AuxVars[] AssignedVars[~v_assert~0, ~count~0] [2022-12-13 01:42:14,525 ERROR L806 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-13 01:42:14,540 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [453] L45-->L45: Formula: (let ((.cse0 (not (= (mod v_~sFlag~0_118 256) 0)))) (and (= v_~v_assert~0_106 (ite (= (ite (or .cse0 (= (mod v_~stopped~0_113 256) 0)) 1 0) 0) 0 1)) (= (ite .cse0 (+ (- 1) v_~count~0_299) v_~count~0_299) v_~count~0_297))) InVars {~sFlag~0=v_~sFlag~0_118, ~stopped~0=v_~stopped~0_113, ~count~0=v_~count~0_299} OutVars{~v_assert~0=v_~v_assert~0_106, ~sFlag~0=v_~sFlag~0_118, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_26|, ~stopped~0=v_~stopped~0_113, ~count~0=v_~count~0_297} AuxVars[] AssignedVars[~v_assert~0, thread1Thread1of1ForFork1_#t~post1, ~count~0] and [366] L49-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_7| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_21 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_7| 0) (= (ite (= (ite (= v_~count~0_92 0) 1 0) 0) 0 1) v_thread1Thread1of1ForFork1_~cond~0_21)) InVars {~count~0=v_~count~0_92} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_7|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_7|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_21, ~count~0=v_~count~0_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_~cond~0] [2022-12-13 01:42:14,723 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [458] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.offset_22| 0) (= v_~stopped~0_117 1) (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_65| 256) 0) (= v_~sFlag~0_126 1) (= (+ 2 v_~count~0_321) v_~count~0_322) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37| (mod v_~sEvent~0_107 256)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|) (= |v_thread2Thread1of1ForFork0_~cond~1#1_65| (ite (= (ite (= v_~count~0_321 0) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37| 0)) (= |v_thread2Thread1of1ForFork0_#res#1.base_22| 0)) InVars {~sEvent~0=v_~sEvent~0_107, ~count~0=v_~count~0_322} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_37|, ~sFlag~0=v_~sFlag~0_126, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_22|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_22|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_65|, ~sEvent~0=v_~sEvent~0_107, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_37|, ~stopped~0=v_~stopped~0_117, thread2Thread1of1ForFork0_#t~post2#1=|v_thread2Thread1of1ForFork0_#t~post2#1_27|, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_19|, ~count~0=v_~count~0_321} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~sFlag~0, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~cond~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~stopped~0, thread2Thread1of1ForFork0_#t~post2#1, thread2Thread1of1ForFork0_#t~post3#1, ~count~0] and [308] $Ultimate##0-->L45: Formula: (let ((.cse0 (not (= (mod v_~sFlag~0_7 256) 0)))) (and (= (ite .cse0 v_~count~0_19 (+ v_~count~0_19 1)) v_~count~0_18) (= (ite (= (ite (or (= (mod v_~stopped~0_6 256) 0) .cse0) 1 0) 0) 0 1) v_~v_assert~0_6))) InVars {~stopped~0=v_~stopped~0_6, ~sFlag~0=v_~sFlag~0_7, ~count~0=v_~count~0_19} OutVars{~v_assert~0=v_~v_assert~0_6, ~stopped~0=v_~stopped~0_6, ~sFlag~0=v_~sFlag~0_7, ~count~0=v_~count~0_18} AuxVars[] AssignedVars[~v_assert~0, ~count~0] [2022-12-13 01:42:14,813 INFO L241 LiptonReduction]: Total number of compositions: 7 [2022-12-13 01:42:14,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 321 [2022-12-13 01:42:14,814 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 10 transitions, 54 flow [2022-12-13 01:42:14,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 01:42:14,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:42:14,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:42:14,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:42:14,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:42:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:42:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1739237363, now seen corresponding path program 1 times [2022-12-13 01:42:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:42:14,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645011731] [2022-12-13 01:42:14,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:42:14,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:42:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:42:14,901 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 01:42:14,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:42:14,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645011731] [2022-12-13 01:42:14,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645011731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:42:14,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:42:14,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 01:42:14,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749956502] [2022-12-13 01:42:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:42:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 01:42:14,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:42:14,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 01:42:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 01:42:14,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 10 [2022-12-13 01:42:14,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 10 transitions, 54 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 01:42:14,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:42:14,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 10 [2022-12-13 01:42:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:42:14,911 INFO L130 PetriNetUnfolder]: 1/8 cut-off events. [2022-12-13 01:42:14,911 INFO L131 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-12-13 01:42:14,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 8 events. 1/8 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 1 based on Foata normal form. 0/8 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2022-12-13 01:42:14,912 INFO L137 encePairwiseOnDemand]: 9/10 looper letters, 0 selfloop transitions, 0 changer transitions 6/6 dead transitions. [2022-12-13 01:42:14,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 6 transitions, 54 flow [2022-12-13 01:42:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 01:42:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 01:42:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 2 states and 6 transitions. [2022-12-13 01:42:14,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 01:42:14,913 INFO L175 Difference]: Start difference. First operand has 32 places, 10 transitions, 54 flow. Second operand 2 states and 6 transitions. [2022-12-13 01:42:14,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 6 transitions, 54 flow [2022-12-13 01:42:14,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 6 transitions, 29 flow, removed 3 selfloop flow, removed 14 redundant places. [2022-12-13 01:42:14,913 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2022-12-13 01:42:14,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=10, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2022-12-13 01:42:14,914 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, -11 predicate places. [2022-12-13 01:42:14,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:42:14,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 0 transitions, 0 flow [2022-12-13 01:42:14,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 01:42:14,914 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 01:42:14,914 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 01:42:14,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 01:42:14,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 01:42:14,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 01:42:14,915 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:42:14,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 01:42:14,916 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 01:42:14,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 01:42:14,917 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 01:42:14,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 01:42:14,918 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 01:42:14,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:42:14,918 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 01:42:14,920 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 01:42:14,920 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 01:42:14,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:42:14 BasicIcfg [2022-12-13 01:42:14,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 01:42:14,922 INFO L158 Benchmark]: Toolchain (without parser) took 5586.47ms. Allocated memory was 189.8MB in the beginning and 321.9MB in the end (delta: 132.1MB). Free memory was 167.0MB in the beginning and 250.9MB in the end (delta: -83.9MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2022-12-13 01:42:14,922 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 189.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 01:42:14,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.24ms. Allocated memory is still 189.8MB. Free memory was 166.8MB in the beginning and 153.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 01:42:14,923 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.86ms. Allocated memory is still 189.8MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:42:14,923 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 189.8MB. Free memory was 151.7MB in the beginning and 150.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 01:42:14,923 INFO L158 Benchmark]: RCFGBuilder took 430.51ms. Allocated memory is still 189.8MB. Free memory was 150.2MB in the beginning and 133.9MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-13 01:42:14,923 INFO L158 Benchmark]: TraceAbstraction took 4875.14ms. Allocated memory was 189.8MB in the beginning and 321.9MB in the end (delta: 132.1MB). Free memory was 132.4MB in the beginning and 250.9MB in the end (delta: -118.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. [2022-12-13 01:42:14,924 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.09ms. Allocated memory is still 189.8MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.24ms. Allocated memory is still 189.8MB. Free memory was 166.8MB in the beginning and 153.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.86ms. Allocated memory is still 189.8MB. Free memory was 153.3MB in the beginning and 151.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 189.8MB. Free memory was 151.7MB in the beginning and 150.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 430.51ms. Allocated memory is still 189.8MB. Free memory was 150.2MB in the beginning and 133.9MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4875.14ms. Allocated memory was 189.8MB in the beginning and 321.9MB in the end (delta: 132.1MB). Free memory was 132.4MB in the beginning and 250.9MB in the end (delta: -118.5MB). Peak memory consumption was 14.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 110 PlacesBefore, 26 PlacesAfterwards, 112 TransitionsBefore, 21 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 14 ConcurrentYvCompositions, 7 ChoiceCompositions, 92 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 490, independent: 421, independent conditional: 421, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 490, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 490, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 490, independent: 421, independent conditional: 0, independent unconditional: 421, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 295, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 295, independent: 265, independent conditional: 0, independent unconditional: 265, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 30, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 490, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 295, unknown conditional: 0, unknown unconditional: 295] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 435, Positive conditional cache size: 0, Positive unconditional cache size: 435, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 10, dependent conditional: 7, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 10, dependent conditional: 7, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 10, dependent conditional: 7, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 7, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 13, unknown conditional: 4, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 8, Positive conditional cache size: 1, Positive unconditional cache size: 7, Negative cache size: 5, Negative conditional cache size: 3, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 148 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 62, independent conditional: 62, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 62, independent conditional: 28, independent unconditional: 34, dependent: 25, dependent conditional: 19, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 62, independent conditional: 28, independent unconditional: 34, dependent: 42, dependent conditional: 36, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 62, independent conditional: 28, independent unconditional: 34, dependent: 42, dependent conditional: 36, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, independent: 52, independent conditional: 19, independent unconditional: 33, dependent: 34, dependent conditional: 28, dependent unconditional: 6, unknown: 18, unknown conditional: 17, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 18, Positive conditional cache size: 10, Positive unconditional cache size: 8, Negative cache size: 13, Negative conditional cache size: 11, Negative unconditional cache size: 2, 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, 46 PlacesBefore, 46 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 104, independent: 84, independent conditional: 38, independent unconditional: 46, dependent: 20, dependent conditional: 10, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 84, independent conditional: 36, independent unconditional: 48, dependent: 40, dependent conditional: 30, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 84, independent conditional: 36, independent unconditional: 48, dependent: 40, dependent conditional: 30, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 5, independent unconditional: 4, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 75, independent conditional: 31, independent unconditional: 44, dependent: 38, dependent conditional: 28, dependent unconditional: 10, unknown: 11, unknown conditional: 7, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 27, Positive conditional cache size: 15, Positive unconditional cache size: 12, Negative cache size: 15, Negative conditional cache size: 13, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 32 PlacesAfterwards, 17 TransitionsBefore, 10 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 9, independent: 9, independent conditional: 6, independent unconditional: 3, 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: 7, independent: 7, independent conditional: 6, independent unconditional: 1, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 35, Positive conditional cache size: 21, Positive unconditional cache size: 14, Negative cache size: 15, Negative conditional cache size: 13, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - 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): 50, Positive cache size: 35, Positive conditional cache size: 21, Positive unconditional cache size: 14, Negative cache size: 15, Negative conditional cache size: 13, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 115]: 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 5 procedures, 135 locations, 3 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: 4.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 4 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=3, InterpolantAutomatonStates: 26, 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.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 01:42:14,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...