/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:09:45,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:09:45,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:09:45,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:09:45,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:09:45,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:09:45,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:09:45,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:09:45,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:09:45,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:09:45,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:09:45,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:09:45,867 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:09:45,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:09:45,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:09:45,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:09:45,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:09:45,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:09:45,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:09:45,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:09:45,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:09:45,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:09:45,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:09:45,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:09:45,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:09:45,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:09:45,877 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:09:45,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:09:45,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:09:45,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:09:45,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:09:45,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:09:45,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:09:45,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:09:45,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:09:45,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:09:45,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:09:45,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:09:45,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:09:45,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:09:45,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:09:45,884 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:09:45,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:09:45,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:09:45,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:09:45,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:09:45,901 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:09:45,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:09:45,901 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:09:45,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:09:45,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:09:45,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:09:45,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:09:45,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:09:45,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:09:45,903 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:09:45,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:09:45,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:45,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:09:45,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:09:45,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:09:45,904 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:09:45,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:09:45,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:09:45,904 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-06 07:09:46,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:09:46,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:09:46,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:09:46,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:09:46,241 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:09:46,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2022-12-06 07:09:47,296 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:09:47,465 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:09:47,465 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2022-12-06 07:09:47,485 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdad0d8b/5ec81f27d11642ec932cafe2fab73a06/FLAGb3a7829a0 [2022-12-06 07:09:47,498 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdad0d8b/5ec81f27d11642ec932cafe2fab73a06 [2022-12-06 07:09:47,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:09:47,500 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:09:47,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:47,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:09:47,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:09:47,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5578a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47, skipping insertion in model container [2022-12-06 07:09:47,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:09:47,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:09:47,644 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/bench-exp2x6.wvr.c[2453,2466] [2022-12-06 07:09:47,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:47,661 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:09:47,692 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/bench-exp2x6.wvr.c[2453,2466] [2022-12-06 07:09:47,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:47,701 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:09:47,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47 WrapperNode [2022-12-06 07:09:47,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:47,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:47,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:09:47,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:09:47,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,741 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-06 07:09:47,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:47,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:09:47,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:09:47,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:09:47,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,767 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:09:47,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:09:47,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:09:47,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:09:47,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (1/1) ... [2022-12-06 07:09:47,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:47,811 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-06 07:09:47,829 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-06 07:09:47,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:09:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:09:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:09:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:09:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:09:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:09:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:09:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:09:47,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:09:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:09:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:09:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:09:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:09:47,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:09:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:09:47,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:09:47,844 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:09:47,931 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:09:47,932 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:09:48,121 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:09:48,134 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:09:48,134 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:09:48,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:48 BoogieIcfgContainer [2022-12-06 07:09:48,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:09:48,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:09:48,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:09:48,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:09:48,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:09:47" (1/3) ... [2022-12-06 07:09:48,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0ca00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:48, skipping insertion in model container [2022-12-06 07:09:48,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:47" (2/3) ... [2022-12-06 07:09:48,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0ca00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:48, skipping insertion in model container [2022-12-06 07:09:48,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:48" (3/3) ... [2022-12-06 07:09:48,143 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2022-12-06 07:09:48,157 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:09:48,157 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:09:48,157 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:09:48,223 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 07:09:48,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 130 transitions, 292 flow [2022-12-06 07:09:48,298 INFO L130 PetriNetUnfolder]: 10/126 cut-off events. [2022-12-06 07:09:48,298 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:48,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 10/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 07:09:48,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 130 transitions, 292 flow [2022-12-06 07:09:48,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2022-12-06 07:09:48,308 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:48,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 114 transitions, 252 flow [2022-12-06 07:09:48,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 114 transitions, 252 flow [2022-12-06 07:09:48,384 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2022-12-06 07:09:48,385 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:48,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 114 events. 10/114 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-12-06 07:09:48,389 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 114 transitions, 252 flow [2022-12-06 07:09:48,389 INFO L188 LiptonReduction]: Number of co-enabled transitions 2160 [2022-12-06 07:09:52,165 INFO L203 LiptonReduction]: Total number of compositions: 89 [2022-12-06 07:09:52,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:09:52,182 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;@13ec7ff2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:09:52,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 07:09:52,187 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 07:09:52,188 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:52,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:52,188 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:52,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash 223304526, now seen corresponding path program 1 times [2022-12-06 07:09:52,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:52,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499174260] [2022-12-06 07:09:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:52,710 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-06 07:09:52,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:52,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499174260] [2022-12-06 07:09:52,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499174260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:52,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:52,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:09:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042127056] [2022-12-06 07:09:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:52,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:52,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:52,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-06 07:09:52,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:52,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:52,865 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-06 07:09:52,865 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2022-12-06 07:09:52,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1772 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-06 07:09:52,874 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-06 07:09:52,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-06 07:09:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 07:09:52,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:09:52,884 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-06 07:09:52,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-06 07:09:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 07:09:52,891 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:52,892 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-06 07:09:52,895 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 07:09:52,895 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:52,895 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:52,897 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:52,897 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:52,898 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:52,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:52,905 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0][18], [136#true, 26#L38-1true, 124#L60-1true, 77#L49-1true, 16#L71-1true, 53#L97-4true, Black: 138#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-12-06 07:09:52,905 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:09:52,905 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:52,905 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:52,905 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:52,908 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-06 07:09:52,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:52,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 55 events. 19/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 52. Up to 22 conditions per place. [2022-12-06 07:09:52,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:52,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 07:09:52,910 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:52,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:09:52,911 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:52,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 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-06 07:09:52,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:52,912 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:52,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:09:52,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:52,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash -965557640, now seen corresponding path program 1 times [2022-12-06 07:09:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:52,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636875914] [2022-12-06 07:09:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:53,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636875914] [2022-12-06 07:09:53,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636875914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:53,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:53,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987306980] [2022-12-06 07:09:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:53,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:53,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:53,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-06 07:09:53,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:53,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:53,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:53,238 INFO L130 PetriNetUnfolder]: 461/641 cut-off events. [2022-12-06 07:09:53,238 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-06 07:09:53,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1833 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2022-12-06 07:09:53,241 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2022-12-06 07:09:53,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2022-12-06 07:09:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 07:09:53,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 07:09:53,243 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 62 transitions. [2022-12-06 07:09:53,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2022-12-06 07:09:53,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:53,245 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:53,246 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-06 07:09:53,246 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-06 07:09:53,246 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:53,246 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:53,247 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:53,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:53,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:53,250 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0][24], [Black: 142#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 26#L38-1true, 124#L60-1true, 140#true, 16#L71-1true, 77#L49-1true, 53#L97-4true, Black: 138#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))))]) [2022-12-06 07:09:53,250 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:09:53,250 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:53,250 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:53,251 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:53,253 INFO L130 PetriNetUnfolder]: 39/88 cut-off events. [2022-12-06 07:09:53,253 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 07:09:53,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 88 events. 39/88 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 160 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 124. Up to 38 conditions per place. [2022-12-06 07:09:53,254 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:53,254 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-06 07:09:53,255 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:53,256 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 07:09:53,256 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:53,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-06 07:09:53,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:53,257 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:53,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:09:53,257 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1782132831, now seen corresponding path program 1 times [2022-12-06 07:09:53,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:53,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439290632] [2022-12-06 07:09:53,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:53,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:53,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:53,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439290632] [2022-12-06 07:09:53,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439290632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:53,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:53,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36898214] [2022-12-06 07:09:53,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:53,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:53,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:53,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-06 07:09:53,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:53,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:53,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:53,579 INFO L130 PetriNetUnfolder]: 657/915 cut-off events. [2022-12-06 07:09:53,580 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-06 07:09:53,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 915 events. 657/915 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2762 event pairs, 55 based on Foata normal form. 32/947 useless extension candidates. Maximal degree in co-relation 841. Up to 349 conditions per place. [2022-12-06 07:09:53,584 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-06 07:09:53,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 85 transitions, 471 flow [2022-12-06 07:09:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 07:09:53,587 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-06 07:09:53,587 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 5 states and 72 transitions. [2022-12-06 07:09:53,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 85 transitions, 471 flow [2022-12-06 07:09:53,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 85 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:53,590 INFO L231 Difference]: Finished difference. Result has 36 places, 41 transitions, 192 flow [2022-12-06 07:09:53,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=36, PETRI_TRANSITIONS=41} [2022-12-06 07:09:53,591 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 07:09:53,591 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:53,591 INFO L89 Accepts]: Start accepts. Operand has 36 places, 41 transitions, 192 flow [2022-12-06 07:09:53,593 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:53,593 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:53,593 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 41 transitions, 192 flow [2022-12-06 07:09:53,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 41 transitions, 192 flow [2022-12-06 07:09:53,601 INFO L130 PetriNetUnfolder]: 53/110 cut-off events. [2022-12-06 07:09:53,601 INFO L131 PetriNetUnfolder]: For 50/74 co-relation queries the response was YES. [2022-12-06 07:09:53,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 110 events. 53/110 cut-off events. For 50/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 240 event pairs, 1 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 231. Up to 50 conditions per place. [2022-12-06 07:09:53,602 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 41 transitions, 192 flow [2022-12-06 07:09:53,603 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 07:09:53,605 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:53,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 07:09:53,606 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 41 transitions, 192 flow [2022-12-06 07:09:53,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-06 07:09:53,607 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:53,607 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:53,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:09:53,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 590342650, now seen corresponding path program 1 times [2022-12-06 07:09:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:53,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408129163] [2022-12-06 07:09:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:53,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408129163] [2022-12-06 07:09:53,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408129163] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089047552] [2022-12-06 07:09:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:53,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:53,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:09:53,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:09:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:53,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:54,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:54,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089047552] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:54,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:54,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:09:54,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798067976] [2022-12-06 07:09:54,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:54,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:09:54,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:09:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:09:54,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:54,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 41 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-06 07:09:54,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:54,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:54,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:54,446 INFO L130 PetriNetUnfolder]: 807/1127 cut-off events. [2022-12-06 07:09:54,447 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2022-12-06 07:09:54,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 1127 events. 807/1127 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3519 event pairs, 223 based on Foata normal form. 30/1127 useless extension candidates. Maximal degree in co-relation 1708. Up to 509 conditions per place. [2022-12-06 07:09:54,452 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-06 07:09:54,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 85 transitions, 512 flow [2022-12-06 07:09:54,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 07:09:54,453 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.592 [2022-12-06 07:09:54,453 INFO L175 Difference]: Start difference. First operand has 36 places, 41 transitions, 192 flow. Second operand 5 states and 74 transitions. [2022-12-06 07:09:54,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 85 transitions, 512 flow [2022-12-06 07:09:54,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 85 transitions, 512 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 07:09:54,456 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 256 flow [2022-12-06 07:09:54,456 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-12-06 07:09:54,456 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-06 07:09:54,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:54,456 INFO L89 Accepts]: Start accepts. Operand has 42 places, 44 transitions, 256 flow [2022-12-06 07:09:54,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:54,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:54,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 44 transitions, 256 flow [2022-12-06 07:09:54,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 44 transitions, 256 flow [2022-12-06 07:09:54,465 INFO L130 PetriNetUnfolder]: 58/130 cut-off events. [2022-12-06 07:09:54,465 INFO L131 PetriNetUnfolder]: For 153/180 co-relation queries the response was YES. [2022-12-06 07:09:54,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 130 events. 58/130 cut-off events. For 153/180 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 339 event pairs, 4 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 331. Up to 58 conditions per place. [2022-12-06 07:09:54,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 44 transitions, 256 flow [2022-12-06 07:09:54,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 436 [2022-12-06 07:09:54,467 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:54,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 07:09:54,468 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 256 flow [2022-12-06 07:09:54,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 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-06 07:09:54,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:54,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:54,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:09:54,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:54,673 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:54,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1133811226, now seen corresponding path program 2 times [2022-12-06 07:09:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:54,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065388419] [2022-12-06 07:09:54,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:54,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:54,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:54,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065388419] [2022-12-06 07:09:54,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065388419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:54,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:54,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:54,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629498789] [2022-12-06 07:09:54,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:54,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:54,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-06 07:09:54,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:54,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:54,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:54,975 INFO L130 PetriNetUnfolder]: 793/1113 cut-off events. [2022-12-06 07:09:54,975 INFO L131 PetriNetUnfolder]: For 1791/1791 co-relation queries the response was YES. [2022-12-06 07:09:54,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4057 conditions, 1113 events. 793/1113 cut-off events. For 1791/1791 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3570 event pairs, 135 based on Foata normal form. 14/1097 useless extension candidates. Maximal degree in co-relation 3069. Up to 907 conditions per place. [2022-12-06 07:09:54,980 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 53 selfloop transitions, 11 changer transitions 11/75 dead transitions. [2022-12-06 07:09:54,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 495 flow [2022-12-06 07:09:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 07:09:54,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-06 07:09:54,982 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 256 flow. Second operand 4 states and 61 transitions. [2022-12-06 07:09:54,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 495 flow [2022-12-06 07:09:54,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 75 transitions, 483 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:54,991 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 280 flow [2022-12-06 07:09:54,991 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2022-12-06 07:09:54,993 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 07:09:54,993 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:54,993 INFO L89 Accepts]: Start accepts. Operand has 45 places, 46 transitions, 280 flow [2022-12-06 07:09:54,994 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:54,994 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:54,994 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 46 transitions, 280 flow [2022-12-06 07:09:54,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 46 transitions, 280 flow [2022-12-06 07:09:55,002 INFO L130 PetriNetUnfolder]: 57/128 cut-off events. [2022-12-06 07:09:55,002 INFO L131 PetriNetUnfolder]: For 137/172 co-relation queries the response was YES. [2022-12-06 07:09:55,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 128 events. 57/128 cut-off events. For 137/172 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 4 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 337. Up to 54 conditions per place. [2022-12-06 07:09:55,003 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 46 transitions, 280 flow [2022-12-06 07:09:55,004 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 07:09:55,005 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:55,007 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:09:55,007 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 280 flow [2022-12-06 07:09:55,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-06 07:09:55,007 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:55,007 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:55,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:09:55,007 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -3755773, now seen corresponding path program 2 times [2022-12-06 07:09:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:55,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491700590] [2022-12-06 07:09:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:55,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491700590] [2022-12-06 07:09:55,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491700590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:55,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499587995] [2022-12-06 07:09:55,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:09:55,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:55,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:09:55,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:09:55,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:09:55,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:09:55,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:55,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:55,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499587995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:55,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:55,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:09:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287473211] [2022-12-06 07:09:55,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:55,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:09:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:09:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:09:55,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:55,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-06 07:09:55,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:55,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:55,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:55,613 INFO L130 PetriNetUnfolder]: 881/1229 cut-off events. [2022-12-06 07:09:55,613 INFO L131 PetriNetUnfolder]: For 1777/1777 co-relation queries the response was YES. [2022-12-06 07:09:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 1229 events. 881/1229 cut-off events. For 1777/1777 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3890 event pairs, 203 based on Foata normal form. 28/1257 useless extension candidates. Maximal degree in co-relation 3347. Up to 605 conditions per place. [2022-12-06 07:09:55,618 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 73 selfloop transitions, 11 changer transitions 0/84 dead transitions. [2022-12-06 07:09:55,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 589 flow [2022-12-06 07:09:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:55,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:55,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 07:09:55,619 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.544 [2022-12-06 07:09:55,620 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 280 flow. Second operand 5 states and 68 transitions. [2022-12-06 07:09:55,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 589 flow [2022-12-06 07:09:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:55,622 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 332 flow [2022-12-06 07:09:55,622 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2022-12-06 07:09:55,623 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-06 07:09:55,623 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:55,623 INFO L89 Accepts]: Start accepts. Operand has 50 places, 49 transitions, 332 flow [2022-12-06 07:09:55,624 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:55,624 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:55,624 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 332 flow [2022-12-06 07:09:55,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 332 flow [2022-12-06 07:09:55,632 INFO L130 PetriNetUnfolder]: 71/146 cut-off events. [2022-12-06 07:09:55,632 INFO L131 PetriNetUnfolder]: For 245/290 co-relation queries the response was YES. [2022-12-06 07:09:55,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 146 events. 71/146 cut-off events. For 245/290 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 381 event pairs, 1 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 450. Up to 71 conditions per place. [2022-12-06 07:09:55,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 49 transitions, 332 flow [2022-12-06 07:09:55,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-06 07:09:55,636 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [441] L71-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork3_#res.offset_Out_4| 0) (= |v_thread4Thread1of1ForFork3_#res.base_Out_4| 0) (not (< (mod v_~x4~0_In_7 4294967296) (mod v_~n~0_In_3 4294967296)))) InVars {~n~0=v_~n~0_In_3, ~x4~0=v_~x4~0_In_7} OutVars{thread4Thread1of1ForFork3_#res.offset=|v_thread4Thread1of1ForFork3_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_7, ~n~0=v_~n~0_In_3, thread4Thread1of1ForFork3_#res.base=|v_thread4Thread1of1ForFork3_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_#res.offset, thread4Thread1of1ForFork3_#res.base] and [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:09:55,679 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:09:55,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 56 [2022-12-06 07:09:55,679 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 48 transitions, 330 flow [2022-12-06 07:09:55,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 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-06 07:09:55,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:55,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:55,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:09:55,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 07:09:55,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1491697753, now seen corresponding path program 1 times [2022-12-06 07:09:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:55,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058152725] [2022-12-06 07:09:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:55,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:55,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058152725] [2022-12-06 07:09:55,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058152725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:55,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133850983] [2022-12-06 07:09:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:55,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:55,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:55,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:09:55,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:09:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:56,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:56,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:56,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:56,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133850983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:56,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:56,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:09:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109455306] [2022-12-06 07:09:56,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:56,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:09:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:09:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:09:56,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:09:56,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 48 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-06 07:09:56,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:56,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:09:56,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:56,367 INFO L130 PetriNetUnfolder]: 1687/2313 cut-off events. [2022-12-06 07:09:56,367 INFO L131 PetriNetUnfolder]: For 8200/8200 co-relation queries the response was YES. [2022-12-06 07:09:56,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 2313 events. 1687/2313 cut-off events. For 8200/8200 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8352 event pairs, 325 based on Foata normal form. 98/2411 useless extension candidates. Maximal degree in co-relation 7853. Up to 1067 conditions per place. [2022-12-06 07:09:56,383 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 121 selfloop transitions, 10 changer transitions 0/131 dead transitions. [2022-12-06 07:09:56,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 131 transitions, 1118 flow [2022-12-06 07:09:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:09:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:09:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-06 07:09:56,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2022-12-06 07:09:56,384 INFO L175 Difference]: Start difference. First operand has 49 places, 48 transitions, 330 flow. Second operand 5 states and 86 transitions. [2022-12-06 07:09:56,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 131 transitions, 1118 flow [2022-12-06 07:09:56,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 131 transitions, 1056 flow, removed 24 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:56,393 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 374 flow [2022-12-06 07:09:56,393 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2022-12-06 07:09:56,393 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-12-06 07:09:56,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:56,393 INFO L89 Accepts]: Start accepts. Operand has 54 places, 53 transitions, 374 flow [2022-12-06 07:09:56,394 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:56,394 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:56,394 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 53 transitions, 374 flow [2022-12-06 07:09:56,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 53 transitions, 374 flow [2022-12-06 07:09:56,410 INFO L130 PetriNetUnfolder]: 144/301 cut-off events. [2022-12-06 07:09:56,410 INFO L131 PetriNetUnfolder]: For 451/537 co-relation queries the response was YES. [2022-12-06 07:09:56,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 301 events. 144/301 cut-off events. For 451/537 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1159 event pairs, 7 based on Foata normal form. 2/280 useless extension candidates. Maximal degree in co-relation 974. Up to 163 conditions per place. [2022-12-06 07:09:56,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 53 transitions, 374 flow [2022-12-06 07:09:56,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 602 [2022-12-06 07:09:56,413 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:56,414 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 07:09:56,414 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 374 flow [2022-12-06 07:09:56,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 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-06 07:09:56,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:56,414 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:09:56,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:09:56,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:56,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:09:56,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash 174140023, now seen corresponding path program 1 times [2022-12-06 07:09:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:56,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402923653] [2022-12-06 07:09:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:56,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:56,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:09:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:56,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402923653] [2022-12-06 07:09:56,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402923653] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:56,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105793207] [2022-12-06 07:09:56,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:56,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:56,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:56,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:09:57,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:10:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:01,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:10:01,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:10:07,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:10:07,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:10:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:10:10,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105793207] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:10:10,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:10:10,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 07:10:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255683916] [2022-12-06 07:10:10,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:10:10,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:10:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:10:10,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:10:10,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=110, Unknown=3, NotChecked=0, Total=156 [2022-12-06 07:10:10,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:10:10,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 374 flow. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06 07:10:10,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:10:10,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:10:10,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:10:55,243 WARN L233 SmtUtils]: Spent 44.48s on a formula simplification. DAG size of input: 73 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:10:57,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:10:59,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:02,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:04,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:06,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:08,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:11,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:13,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:15,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:18,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:21,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:24,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:26,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:30,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:32,357 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 4294967296 (div c_~x3~0 4294967296)))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse4 (mod (div c_~x4~0 16) 4294967296)) (.cse5 (mod c_~x3~0 4294967296)) (.cse3 (mod (div (- c_~x3~0) (- 16)) 4294967296)) (.cse2 (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (.cse1 (+ .cse6 c_~x4~0))) (and (= (mod c_~x4~0 16) 0) (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 .cse2) (= .cse3 .cse4) (not (< (mod c_~x4~0 4294967296) (mod c_~n~0 4294967296))) (< 0 .cse5) (= .cse4 .cse5) (<= (+ .cse6 1) c_~x3~0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (< 0 .cse3) (= (mod (* c_~x3~0 15) 16) 0) (<= .cse2 .cse1)))) is different from false [2022-12-06 07:11:34,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:36,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:38,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:47,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:49,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:54,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:56,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:11:58,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:01,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:04,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:06,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:14,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:16,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:18,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:21,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:24,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:26,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:26,576 INFO L130 PetriNetUnfolder]: 2478/3448 cut-off events. [2022-12-06 07:12:26,576 INFO L131 PetriNetUnfolder]: For 10065/10065 co-relation queries the response was YES. [2022-12-06 07:12:26,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15910 conditions, 3448 events. 2478/3448 cut-off events. For 10065/10065 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13765 event pairs, 381 based on Foata normal form. 4/3452 useless extension candidates. Maximal degree in co-relation 11159. Up to 2342 conditions per place. [2022-12-06 07:12:26,600 INFO L137 encePairwiseOnDemand]: 9/26 looper letters, 130 selfloop transitions, 65 changer transitions 14/209 dead transitions. [2022-12-06 07:12:26,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 209 transitions, 1595 flow [2022-12-06 07:12:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:12:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:12:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 184 transitions. [2022-12-06 07:12:26,602 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5443786982248521 [2022-12-06 07:12:26,602 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 374 flow. Second operand 13 states and 184 transitions. [2022-12-06 07:12:26,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 209 transitions, 1595 flow [2022-12-06 07:12:26,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 209 transitions, 1591 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 07:12:26,613 INFO L231 Difference]: Finished difference. Result has 73 places, 113 transitions, 1080 flow [2022-12-06 07:12:26,613 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1080, PETRI_PLACES=73, PETRI_TRANSITIONS=113} [2022-12-06 07:12:26,614 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2022-12-06 07:12:26,614 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:26,614 INFO L89 Accepts]: Start accepts. Operand has 73 places, 113 transitions, 1080 flow [2022-12-06 07:12:26,615 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:26,615 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:26,615 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 113 transitions, 1080 flow [2022-12-06 07:12:26,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 113 transitions, 1080 flow [2022-12-06 07:12:26,715 INFO L130 PetriNetUnfolder]: 457/875 cut-off events. [2022-12-06 07:12:26,716 INFO L131 PetriNetUnfolder]: For 3641/5167 co-relation queries the response was YES. [2022-12-06 07:12:26,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4205 conditions, 875 events. 457/875 cut-off events. For 3641/5167 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4587 event pairs, 65 based on Foata normal form. 3/796 useless extension candidates. Maximal degree in co-relation 3688. Up to 392 conditions per place. [2022-12-06 07:12:26,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 113 transitions, 1080 flow [2022-12-06 07:12:26,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 968 [2022-12-06 07:12:26,756 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:12:26,779 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [440] L38-1-->thread1EXIT: Formula: (and (not (< (mod v_~x1~0_In_11 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread1Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_11} OutVars{thread1Thread1of1ForFork2_#res.base=|v_thread1Thread1of1ForFork2_#res.base_Out_4|, thread1Thread1of1ForFork2_#res.offset=|v_thread1Thread1of1ForFork2_#res.offset_Out_4|, ~n~0=v_~n~0_In_1, ~x1~0=v_~x1~0_In_11} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#res.base, thread1Thread1of1ForFork2_#res.offset] [2022-12-06 07:12:26,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [378] L97-4-->L98-1: Formula: (= (select (select |v_#memory_int_23| |v_ULTIMATE.start_main_~#t1~0#1.base_15|) |v_ULTIMATE.start_main_~#t1~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem14#1_14|) InVars {#memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_14|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_15|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:12:26,840 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [347] L98-2-->L99-1: Formula: (= |v_ULTIMATE.start_main_#t~mem15#1_6| (select (select |v_#memory_int_15| |v_ULTIMATE.start_main_~#t2~0#1.base_7|) |v_ULTIMATE.start_main_~#t2~0#1.offset_7|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_7|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_7|} OutVars{ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_6|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_6|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_7|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~mem15#1] [2022-12-06 07:12:26,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:12:26,961 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [422] L99-2-->L100-1: Formula: (= (select (select |v_#memory_int_47| |v_ULTIMATE.start_main_~#t3~0#1.base_19|) |v_ULTIMATE.start_main_~#t3~0#1.offset_19|) |v_ULTIMATE.start_main_#t~mem16#1_18|) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_19|, #memory_int=|v_#memory_int_47|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_19|} OutVars{ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_18|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_19|, #memory_int=|v_#memory_int_47|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~mem16#1] [2022-12-06 07:12:26,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [442] L49-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x2~0=v_~x2~0_In_10} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] [2022-12-06 07:12:27,047 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [416] L60-1-->L60-1: Formula: (and (= (* v_~x3~0_63 16) v_~x3~0_61) (< (mod v_~x3~0_63 4294967296) (mod v_~n~0_65 4294967296))) InVars {~x3~0=v_~x3~0_63, ~n~0=v_~n~0_65} OutVars{~x3~0=v_~x3~0_61, ~n~0=v_~n~0_65} AuxVars[] AssignedVars[~x3~0] and [425] L71-1-->L71-1: Formula: (and (= (* v_~x4~0_76 16) v_~x4~0_75) (< (mod v_~x4~0_76 4294967296) (mod v_~n~0_71 4294967296))) InVars {~x4~0=v_~x4~0_76, ~n~0=v_~n~0_71} OutVars{~x4~0=v_~x4~0_75, ~n~0=v_~n~0_71} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:12:27,071 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:12:27,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 458 [2022-12-06 07:12:27,072 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 113 transitions, 1175 flow [2022-12-06 07:12:27,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06 07:12:27,072 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:27,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:27,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:12:27,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:27,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:12:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:27,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1110506624, now seen corresponding path program 2 times [2022-12-06 07:12:27,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:27,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448664620] [2022-12-06 07:12:27,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:27,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:27,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448664620] [2022-12-06 07:12:27,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448664620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:27,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887130773] [2022-12-06 07:12:27,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:12:27,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:27,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:27,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:12:27,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:12:27,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:12:27,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:12:27,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:12:27,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:27,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:27,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:27,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887130773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:12:27,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:12:27,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 07:12:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296438600] [2022-12-06 07:12:27,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:12:27,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:12:27,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:27,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:12:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:12:27,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:12:27,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 113 transitions, 1175 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-06 07:12:27,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:27,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:12:27,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:28,048 INFO L130 PetriNetUnfolder]: 2899/4026 cut-off events. [2022-12-06 07:12:28,048 INFO L131 PetriNetUnfolder]: For 23198/23198 co-relation queries the response was YES. [2022-12-06 07:12:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22951 conditions, 4026 events. 2899/4026 cut-off events. For 23198/23198 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 16487 event pairs, 749 based on Foata normal form. 80/4092 useless extension candidates. Maximal degree in co-relation 22222. Up to 1831 conditions per place. [2022-12-06 07:12:28,072 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 166 selfloop transitions, 31 changer transitions 0/197 dead transitions. [2022-12-06 07:12:28,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 197 transitions, 2207 flow [2022-12-06 07:12:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:12:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:12:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 07:12:28,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5157894736842106 [2022-12-06 07:12:28,073 INFO L175 Difference]: Start difference. First operand has 73 places, 113 transitions, 1175 flow. Second operand 5 states and 98 transitions. [2022-12-06 07:12:28,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 197 transitions, 2207 flow [2022-12-06 07:12:28,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 197 transitions, 1937 flow, removed 135 selfloop flow, removed 0 redundant places. [2022-12-06 07:12:28,103 INFO L231 Difference]: Finished difference. Result has 79 places, 118 transitions, 1064 flow [2022-12-06 07:12:28,104 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1064, PETRI_PLACES=79, PETRI_TRANSITIONS=118} [2022-12-06 07:12:28,104 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 45 predicate places. [2022-12-06 07:12:28,104 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:12:28,104 INFO L89 Accepts]: Start accepts. Operand has 79 places, 118 transitions, 1064 flow [2022-12-06 07:12:28,108 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:12:28,108 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:12:28,108 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 118 transitions, 1064 flow [2022-12-06 07:12:28,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 118 transitions, 1064 flow [2022-12-06 07:12:28,198 INFO L130 PetriNetUnfolder]: 599/1091 cut-off events. [2022-12-06 07:12:28,199 INFO L131 PetriNetUnfolder]: For 5457/5881 co-relation queries the response was YES. [2022-12-06 07:12:28,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5237 conditions, 1091 events. 599/1091 cut-off events. For 5457/5881 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5968 event pairs, 108 based on Foata normal form. 6/937 useless extension candidates. Maximal degree in co-relation 4816. Up to 436 conditions per place. [2022-12-06 07:12:28,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 118 transitions, 1064 flow [2022-12-06 07:12:28,212 INFO L188 LiptonReduction]: Number of co-enabled transitions 1036 [2022-12-06 07:12:28,215 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:12:28,215 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:12:28,215 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 118 transitions, 1064 flow [2022-12-06 07:12:28,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 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-06 07:12:28,216 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:12:28,216 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:12:28,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:12:28,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:28,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:12:28,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:12:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash -603099771, now seen corresponding path program 1 times [2022-12-06 07:12:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:12:28,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104691215] [2022-12-06 07:12:28,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:12:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:28,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:12:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104691215] [2022-12-06 07:12:28,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104691215] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:12:28,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888786346] [2022-12-06 07:12:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:12:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:12:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:12:28,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:12:28,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:12:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:12:29,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 07:12:29,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:12:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:33,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:12:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:12:35,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888786346] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:12:35,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:12:35,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-06 07:12:35,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773863075] [2022-12-06 07:12:35,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:12:35,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:12:35,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:12:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:12:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=98, Unknown=3, NotChecked=0, Total=132 [2022-12-06 07:12:35,965 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 07:12:35,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 118 transitions, 1064 flow. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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-06 07:12:35,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:12:35,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 07:12:35,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:12:37,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:39,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:44,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:45,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:47,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:51,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:53,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:55,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:12:59,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:01,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:04,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:11,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:13,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:16,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:18,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:21,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:23,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:25,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:28,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:30,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:31,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:33,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:34,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:36,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:47,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:50,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:52,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:54,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:13:58,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:00,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:03,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:23,003 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 65 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:14:25,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:30,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:32,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:34,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:36,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:38,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:40,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:42,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:44,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:46,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:48,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:50,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:52,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:55,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:14:57,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:00,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:02,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:05,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:07,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:10,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:12,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:14,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:16,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:19,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:21,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:25,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:29,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:33,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:34,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:37,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:39,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:41,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:44,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:46,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:15:47,056 INFO L130 PetriNetUnfolder]: 3622/5009 cut-off events. [2022-12-06 07:15:47,056 INFO L131 PetriNetUnfolder]: For 32062/32062 co-relation queries the response was YES. [2022-12-06 07:15:47,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28823 conditions, 5009 events. 3622/5009 cut-off events. For 32062/32062 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21418 event pairs, 547 based on Foata normal form. 2/4970 useless extension candidates. Maximal degree in co-relation 28220. Up to 4102 conditions per place. [2022-12-06 07:15:47,089 INFO L137 encePairwiseOnDemand]: 22/38 looper letters, 180 selfloop transitions, 56 changer transitions 5/241 dead transitions. [2022-12-06 07:15:47,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 241 transitions, 2545 flow [2022-12-06 07:15:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:15:47,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:15:47,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2022-12-06 07:15:47,092 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4019138755980861 [2022-12-06 07:15:47,092 INFO L175 Difference]: Start difference. First operand has 79 places, 118 transitions, 1064 flow. Second operand 11 states and 168 transitions. [2022-12-06 07:15:47,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 241 transitions, 2545 flow [2022-12-06 07:15:47,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 241 transitions, 2447 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 07:15:47,152 INFO L231 Difference]: Finished difference. Result has 94 places, 165 transitions, 1681 flow [2022-12-06 07:15:47,152 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1681, PETRI_PLACES=94, PETRI_TRANSITIONS=165} [2022-12-06 07:15:47,153 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 60 predicate places. [2022-12-06 07:15:47,153 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:15:47,153 INFO L89 Accepts]: Start accepts. Operand has 94 places, 165 transitions, 1681 flow [2022-12-06 07:15:47,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:15:47,154 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:15:47,154 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 165 transitions, 1681 flow [2022-12-06 07:15:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 165 transitions, 1681 flow [2022-12-06 07:15:47,284 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L49-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_10 4294967296) (mod v_~n~0_In_5 4294967296)))) InVars {~n~0=v_~n~0_In_5, ~x2~0=v_~x2~0_In_10} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_10, ~n~0=v_~n~0_In_5, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base][13], [Black: 914#(and (= (mod (* ~x4~0 15) 16) 0) (= (mod ~x3~0 16) 0) (= (mod (div ~x3~0 16) 4294967296) (mod (div (- ~x4~0) (- 16)) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (< 0 (mod ~x1~0 4294967296))), 145#true, Black: 138#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), 153#true, Black: 614#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 572#(and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))), Black: 667#(or (and (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)))) (< (mod ~x3~0 4294967296) (mod ~n~0 4294967296))), Black: 569#(and (<= (+ (* (div ~x3~0 4294967296) 4294967296) 1) ~x3~0) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), Black: 142#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 65#thread1EXITtrue, Black: 716#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (< (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296) 1)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296))), Black: 710#(and (< 0 (mod ~x3~0 4294967296)) (= (mod ~x3~0 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (<= (+ (* (div ~x3~0 4294967296) 4294967296) 1) ~x3~0) (= (mod ~x4~0 16) 0) (not (< (mod ~x4~0 4294967296) (mod ~n~0 4294967296))) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 618#(and (= (mod (div (- ~x3~0) (- 16)) 4294967296) (mod (div ~x4~0 16) 4294967296)) (= (mod ~x2~0 4294967296) (mod ~x1~0 4294967296)) (= (mod ~x4~0 16) 0) (< 0 (mod (div (- ~x3~0) (- 16)) 4294967296)) (< 0 (mod ~x1~0 4294967296)) (= (mod (* ~x3~0 15) 16) 0)), Black: 147#(<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))), Black: 150#(and (<= (+ ~n~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~n~0 4294967296) 4294967296))) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 46#thread2EXITtrue, Black: 759#(and (<= (+ (mod ~x1~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x1~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), 430#true, Black: 857#(and (<= (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296)) (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0)) (<= (+ (mod ~x1~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x1~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x1~0 4294967296))), Black: 286#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), 860#true, Black: 206#(and (<= (+ (* (div (+ (- 1) (* (- 1) (mod ~x4~0 4294967296))) 4294967296) 4294967296) (mod ~x4~0 4294967296) 4294967297) (mod ~n~0 4294967296)) (<= (+ (mod ~x4~0 4294967296) (* 4294967296 (div (- (mod ~x4~0 4294967296)) 4294967296)) 1) 0)), Black: 291#(and (= (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296))) (< (* (div ~x3~0 4294967296) 4294967296) ~x3~0) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 16#L71-1true, 14#L98-1true, 80#thread3EXITtrue, 567#true, Black: 347#(and (< 0 (mod ~x3~0 4294967296)) (<= (+ (mod ~x3~0 4294967296) 4294967297 (* (div (+ (- 1) (* (- 1) (mod ~x3~0 4294967296))) 4294967296) 4294967296)) (mod ~n~0 4294967296))), Black: 447#(and (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), Black: 563#(and (<= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (mod ~x2~0 4294967296) 4294967297 (* 4294967296 (div (+ (- 1) (* (mod ~x2~0 4294967296) (- 1))) 4294967296))) (mod ~n~0 4294967296)) (< 0 (mod ~x2~0 4294967296))), 294#true, Black: 1014#(and (= (mod (* ~x4~0 15) 16) 0) (= (mod (div ~x3~0 16) 4294967296) (mod (div (- ~x4~0) (- 16)) 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0))) (< 0 (mod ~x1~0 4294967296))), Black: 1007#(and (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) ~n~0 (* (- 16) ~x4~0) ~x3~0) 4294967296)) (* 16 ~x4~0))) (= (mod ~x4~0 4294967296) (mod (div ~x3~0 16) 4294967296)) (= (mod ~x3~0 16) 0) (<= (+ (* 268435456 (div ~x3~0 4294967296)) 1) (+ (* 268435456 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296)) ~x4~0)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296))), Black: 1005#(and (<= (+ ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) ~n~0 (* (- 16) ~x4~0) ~x3~0) 4294967296)) (* 16 ~x4~0))) (= (mod ~x4~0 4294967296) (mod (div ~x3~0 16) 4294967296)) (= (mod ~x3~0 16) 0) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (or (<= (+ (* 268435456 (div ~x3~0 4294967296)) 1) (+ (* 268435456 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296)) ~x4~0)) (<= (+ 268435457 ~x3~0 (* (div ~n~0 4294967296) 4294967296)) (+ (* ~x4~0 15) (* 268435456 (div ~x3~0 4294967296)) ~n~0 (* 4026531840 (div (+ (* (- 16) ~x4~0) ~x3~0) 4294967296))))) (< 0 (mod ~x1~0 4294967296))), Black: 1010#(and (= (mod (div ~x3~0 16) 4294967296) (mod (div (- ~x4~0) (- 16)) 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296))) (< 0 (mod ~x1~0 4294967296))), Black: 866#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)) (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296) 1)) (<= (+ ~x3~0 (* (div ~x4~0 4294967296) 4294967296)) (+ ~x4~0 (* (div ~x3~0 4294967296) 4294967296)))), 724#true, Black: 1017#(and (< (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0)) (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296) 1)) (= (mod (div ~x3~0 16) 4294967296) (mod (div (- ~x4~0) (- 16)) 4294967296)) (< 0 (mod (div ~x3~0 16) 4294967296)) (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ (* 16 ~x3~0) (* (div (* 16 ~x4~0) 4294967296) 4294967296)) (+ (* (div (* 16 ~x3~0) 4294967296) 4294967296) (* 16 ~x4~0))) (< 0 (mod ~x1~0 4294967296)))]) [2022-12-06 07:15:47,288 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-06 07:15:47,288 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:15:47,288 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:15:47,288 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 07:15:47,332 INFO L130 PetriNetUnfolder]: 1489/2331 cut-off events. [2022-12-06 07:15:47,332 INFO L131 PetriNetUnfolder]: For 21850/24169 co-relation queries the response was YES. [2022-12-06 07:15:47,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14074 conditions, 2331 events. 1489/2331 cut-off events. For 21850/24169 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 12756 event pairs, 333 based on Foata normal form. 63/2018 useless extension candidates. Maximal degree in co-relation 13629. Up to 952 conditions per place. [2022-12-06 07:15:47,357 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 165 transitions, 1681 flow [2022-12-06 07:15:47,357 INFO L188 LiptonReduction]: Number of co-enabled transitions 1254 [2022-12-06 07:15:47,359 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [433] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_81 4294967296) (mod v_~n~0_89 4294967296)) (= (* v_~x1~0_81 16) v_~x1~0_79)) InVars {~n~0=v_~n~0_89, ~x1~0=v_~x1~0_81} OutVars{~n~0=v_~n~0_89, ~x1~0=v_~x1~0_79} AuxVars[] AssignedVars[~x1~0] [2022-12-06 07:15:47,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] L60-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res.base_Out_4| 0) (not (< (mod v_~x3~0_In_11 4294967296) (mod v_~n~0_In_7 4294967296)))) InVars {~x3~0=v_~x3~0_In_11, ~n~0=v_~n~0_In_7} OutVars{~x3~0=v_~x3~0_In_11, thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_Out_4|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_Out_4|, ~n~0=v_~n~0_In_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] and [392] L49-1-->L49-1: Formula: (and (= v_~x2~0_45 (* v_~x2~0_47 16)) (< (mod v_~x2~0_47 4294967296) (mod v_~n~0_45 4294967296))) InVars {~x2~0=v_~x2~0_47, ~n~0=v_~n~0_45} OutVars{~x2~0=v_~x2~0_45, ~n~0=v_~n~0_45} AuxVars[] AssignedVars[~x2~0] [2022-12-06 07:15:47,450 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:15:47,451 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 298 [2022-12-06 07:15:47,451 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 165 transitions, 1701 flow [2022-12-06 07:15:47,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 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-06 07:15:47,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:15:47,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:15:47,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 07:15:47,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:47,652 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:15:47,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:15:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash 402737675, now seen corresponding path program 1 times [2022-12-06 07:15:47,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:15:47,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917520741] [2022-12-06 07:15:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:47,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:15:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:15:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:15:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:15:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917520741] [2022-12-06 07:15:47,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917520741] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:15:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401082508] [2022-12-06 07:15:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:15:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:15:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:15:47,850 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:15:47,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Received shutdown request... [2022-12-06 07:24:27,793 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:24:27,793 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:24:28,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-06 07:24:29,000 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2022-12-06 07:24:29,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-06 07:24:29,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:24:29,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2022-12-06 07:24:29,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007905194] [2022-12-06 07:24:29,007 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-06 07:24:29,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:29,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:29,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:29,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:29,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 07:24:29,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 165 transitions, 1701 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 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-06 07:24:29,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:29,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 07:24:29,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:29,009 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 07:24:29,015 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2022-12-06 07:24:29,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:29,015 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 07:24:29,016 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 07:24:29,016 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 07:24:29,016 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 07:24:29,016 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 07:24:29,016 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1] [2022-12-06 07:24:29,018 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:24:29,019 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:24:29,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:24:29 BasicIcfg [2022-12-06 07:24:29,020 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:24:29,021 INFO L158 Benchmark]: Toolchain (without parser) took 881520.36ms. Allocated memory was 179.3MB in the beginning and 337.6MB in the end (delta: 158.3MB). Free memory was 154.9MB in the beginning and 231.5MB in the end (delta: -76.6MB). Peak memory consumption was 82.4MB. Max. memory is 8.0GB. [2022-12-06 07:24:29,021 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:24:29,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.05ms. Allocated memory is still 179.3MB. Free memory was 154.9MB in the beginning and 143.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 07:24:29,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.26ms. Allocated memory is still 179.3MB. Free memory was 143.6MB in the beginning and 142.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:24:29,021 INFO L158 Benchmark]: Boogie Preprocessor took 27.29ms. Allocated memory is still 179.3MB. Free memory was 142.0MB in the beginning and 140.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:24:29,021 INFO L158 Benchmark]: RCFGBuilder took 367.84ms. Allocated memory is still 179.3MB. Free memory was 140.4MB in the beginning and 125.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:24:29,021 INFO L158 Benchmark]: TraceAbstraction took 880881.00ms. Allocated memory was 179.3MB in the beginning and 337.6MB in the end (delta: 158.3MB). Free memory was 124.2MB in the beginning and 231.5MB in the end (delta: -107.4MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. [2022-12-06 07:24:29,022 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.13ms. Allocated memory is still 179.3MB. Free memory is still 155.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 201.05ms. Allocated memory is still 179.3MB. Free memory was 154.9MB in the beginning and 143.6MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.26ms. Allocated memory is still 179.3MB. Free memory was 143.6MB in the beginning and 142.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.29ms. Allocated memory is still 179.3MB. Free memory was 142.0MB in the beginning and 140.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.84ms. Allocated memory is still 179.3MB. Free memory was 140.4MB in the beginning and 125.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 880881.00ms. Allocated memory was 179.3MB in the beginning and 337.6MB in the end (delta: 158.3MB). Free memory was 124.2MB in the beginning and 231.5MB in the end (delta: -107.4MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 117 PlacesBefore, 34 PlacesAfterwards, 114 TransitionsBefore, 25 TransitionsAfterwards, 2160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 41 ConcurrentYvCompositions, 6 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1129, independent: 1129, independent conditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 1129, independent conditional: 0, independent unconditional: 1129, 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: 1129, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1129, unknown conditional: 0, unknown unconditional: 1129] , Statistics on independence cache: Total cache size (in pairs): 1913, Positive cache size: 1913, Positive conditional cache size: 0, Positive unconditional cache size: 1913, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 49 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 9, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 602 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): 9, Positive cache size: 9, Positive conditional cache size: 9, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 73 PlacesBefore, 73 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 1036 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): 57, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 94 PlacesBefore, 94 PlacesAfterwards, 165 TransitionsBefore, 165 TransitionsAfterwards, 1254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 18, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 18, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 157 locations, 5 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: 880.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 329.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 82 mSolverCounterUnknown, 570 SdHoareTripleChecker+Valid, 230.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 570 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 228.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2224 IncrementalHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 0 mSDtfsCounter, 2224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 234 SyntacticMatches, 15 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 113.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1701occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 376 NumberOfCodeBlocks, 376 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 486 ConstructedInterpolants, 0 QuantifiedInterpolants, 12326 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 4 PerfectInterpolantSequences, 3/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2022-12-06 07:24:29,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 137