/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-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:09:32,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:09:32,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:09:32,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:09:32,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:09:32,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:09:32,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:09:32,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:09:32,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:09:32,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:09:32,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:09:32,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:09:32,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:09:32,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:09:32,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:09:32,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:09:32,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:09:32,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:09:32,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:09:32,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:09:32,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:09:32,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:09:32,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:09:32,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:09:32,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:09:32,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:09:32,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:09:32,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:09:32,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:09:32,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:09:32,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:09:32,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:09:32,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:09:32,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:09:32,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:09:32,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:09:32,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:09:32,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:09:32,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:09:32,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:09:32,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:09:32,673 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:32,693 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:09:32,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:09:32,696 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:09:32,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:09:32,696 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:09:32,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:09:32,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:09:32,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:09:32,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:09:32,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:09:32,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:09:32,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:09:32,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:09:32,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:32,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:09:32,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:09:32,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:09:32,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:09:32,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:09:32,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:09:32,699 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:32,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:09:32,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:09:32,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:09:32,952 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:09:32,953 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:09:32,954 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-06 07:09:33,941 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:09:34,131 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:09:34,131 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-06 07:09:34,136 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e928c4483/e0aa04e0406147b597a7ed761d110470/FLAGa4d45313d [2022-12-06 07:09:34,157 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e928c4483/e0aa04e0406147b597a7ed761d110470 [2022-12-06 07:09:34,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:09:34,160 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:09:34,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:34,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:09:34,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:09:34,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:34" (1/1) ... [2022-12-06 07:09:34,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6432666b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:34, skipping insertion in model container [2022-12-06 07:09:34,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:09:34" (1/1) ... [2022-12-06 07:09:34,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:09:34,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:09:34,321 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-exp2x4.wvr.c[2309,2322] [2022-12-06 07:09:34,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:34,334 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:09:34,364 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-exp2x4.wvr.c[2309,2322] [2022-12-06 07:09:34,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:09:34,375 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:09:34,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:34 WrapperNode [2022-12-06 07:09:34,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:09:34,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:34,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:09:34,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:09:34,382 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:34" (1/1) ... [2022-12-06 07:09:34,395 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:34" (1/1) ... [2022-12-06 07:09:34,415 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-06 07:09:34,416 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:09:34,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:09:34,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:09:34,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:09:34,423 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:34" (1/1) ... [2022-12-06 07:09:34,423 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:34" (1/1) ... [2022-12-06 07:09:34,427 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:34" (1/1) ... [2022-12-06 07:09:34,428 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:34" (1/1) ... [2022-12-06 07:09:34,440 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:34" (1/1) ... [2022-12-06 07:09:34,443 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:34" (1/1) ... [2022-12-06 07:09:34,446 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:34" (1/1) ... [2022-12-06 07:09:34,447 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:34" (1/1) ... [2022-12-06 07:09:34,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:09:34,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:09:34,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:09:34,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:09:34,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:34" (1/1) ... [2022-12-06 07:09:34,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:09:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:34,475 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:34,486 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:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:09:34,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:09:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:09:34,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:09:34,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:09:34,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:09:34,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:09:34,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:09:34,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:09:34,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:09:34,515 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:34,607 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:09:34,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:09:34,878 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:09:34,892 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:09:34,892 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:09:34,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:34 BoogieIcfgContainer [2022-12-06 07:09:34,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:09:34,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:09:34,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:09:34,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:09:34,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:09:34" (1/3) ... [2022-12-06 07:09:34,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ea6d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:34, skipping insertion in model container [2022-12-06 07:09:34,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:09:34" (2/3) ... [2022-12-06 07:09:34,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ea6d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:09:34, skipping insertion in model container [2022-12-06 07:09:34,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:09:34" (3/3) ... [2022-12-06 07:09:34,899 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-12-06 07:09:34,915 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:09:34,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:09:34,916 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:09:34,998 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 07:09:35,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 122 transitions, 276 flow [2022-12-06 07:09:35,099 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-06 07:09:35,099 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:35,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 118 events. 10/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-06 07:09:35,126 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 122 transitions, 276 flow [2022-12-06 07:09:35,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 236 flow [2022-12-06 07:09:35,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:35,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-06 07:09:35,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 236 flow [2022-12-06 07:09:35,185 INFO L130 PetriNetUnfolder]: 10/106 cut-off events. [2022-12-06 07:09:35,186 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:35,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 106 events. 10/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-06 07:09:35,189 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-06 07:09:35,189 INFO L188 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-06 07:09:39,020 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-06 07:09:39,030 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:09:39,035 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;@1938b416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:09:39,035 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 07:09:39,049 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 07:09:39,049 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:09:39,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:39,050 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:39,050 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:39,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2713954, now seen corresponding path program 1 times [2022-12-06 07:09:39,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:39,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218238102] [2022-12-06 07:09:39,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:39,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:39,548 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:39,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:39,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218238102] [2022-12-06 07:09:39,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218238102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:39,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:39,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:09:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035292351] [2022-12-06 07:09:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:39,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:09:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:39,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:09:39,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:09:39,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:39,576 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:39,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:39,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:39,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:39,742 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-06 07:09:39,742 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-06 07:09:39,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1782 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:39,753 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-06 07:09:39,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-06 07:09:39,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:09:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:09:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 07:09:39,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:09:39,765 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:39,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-06 07:09:39,771 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:39,773 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:39,775 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:39,779 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-06 07:09:39,779 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:39,780 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:39,783 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:39,783 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:39,783 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:39,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:39,787 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0][18], [Black: 130#(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)))), 15#L38-1true, 90#L65-1true, 32#L56-1true, 128#true, 103#L47-1true, 95#L89-4true]) [2022-12-06 07:09:39,787 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:09:39,787 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:39,787 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:39,788 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:39,790 INFO L130 PetriNetUnfolder]: 19/55 cut-off events. [2022-12-06 07:09:39,790 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:09:39,790 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 70 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:39,791 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:39,791 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-06 07:09:39,791 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:39,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 07:09:39,793 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-06 07:09:39,793 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:39,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:39,793 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:39,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:09:39,793 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:39,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1247836044, now seen corresponding path program 1 times [2022-12-06 07:09:39,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:39,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219138475] [2022-12-06 07:09:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:40,070 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:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:40,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219138475] [2022-12-06 07:09:40,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219138475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:40,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:40,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987608015] [2022-12-06 07:09:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:40,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:40,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:40,074 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:40,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:40,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:40,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:40,218 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-06 07:09:40,218 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-06 07:09:40,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 647 events. 467/647 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1768 event pairs, 43 based on Foata normal form. 30/677 useless extension candidates. Maximal degree in co-relation 439. Up to 441 conditions per place. [2022-12-06 07:09:40,222 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 9 changer transitions 5/60 dead transitions. [2022-12-06 07:09:40,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2022-12-06 07:09:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 07:09:40,224 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-06 07:09:40,224 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:40,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2022-12-06 07:09:40,225 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:40,226 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:40,226 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:40,227 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-06 07:09:40,227 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:40,227 INFO L89 Accepts]: Start accepts. Operand has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:40,228 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:40,228 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:40,228 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:40,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:40,232 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0][24], [132#true, Black: 130#(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)))), 15#L38-1true, 90#L65-1true, 32#L56-1true, Black: 134#(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)), 103#L47-1true, 95#L89-4true]) [2022-12-06 07:09:40,232 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,232 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,232 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,232 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,233 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base][22], [65#thread4EXITtrue, 132#true, Black: 130#(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)))), 15#L38-1true, 32#L56-1true, Black: 134#(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)), 103#L47-1true, 95#L89-4true]) [2022-12-06 07:09:40,233 INFO L382 tUnfolder$Statistics]: this new event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,233 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,233 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,233 INFO L385 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2022-12-06 07:09:40,236 INFO L130 PetriNetUnfolder]: 34/83 cut-off events. [2022-12-06 07:09:40,236 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 07:09:40,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 83 events. 34/83 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 175 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 106. Up to 32 conditions per place. [2022-12-06 07:09:40,237 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:40,237 INFO L188 LiptonReduction]: Number of co-enabled transitions 270 [2022-12-06 07:09:40,238 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:40,240 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 07:09:40,240 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-06 07:09:40,240 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:40,240 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:40,241 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:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:09:40,241 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:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash 514294809, now seen corresponding path program 1 times [2022-12-06 07:09:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:40,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417060557] [2022-12-06 07:09:40,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:40,417 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:40,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:40,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417060557] [2022-12-06 07:09:40,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417060557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:40,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79480895] [2022-12-06 07:09:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:40,423 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:40,467 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:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:40,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:40,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:40,653 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:40,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:40,732 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:40,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79480895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:40,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:40,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:09:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699945968] [2022-12-06 07:09:40,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:40,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:09:40,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:40,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:09:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:09:40,734 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:40,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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:40,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:40,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:40,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:40,986 INFO L130 PetriNetUnfolder]: 845/1165 cut-off events. [2022-12-06 07:09:40,986 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2022-12-06 07:09:40,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 1165 events. 845/1165 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3643 event pairs, 155 based on Foata normal form. 30/1195 useless extension candidates. Maximal degree in co-relation 853. Up to 458 conditions per place. [2022-12-06 07:09:40,992 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 83 selfloop transitions, 12 changer transitions 3/98 dead transitions. [2022-12-06 07:09:40,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 98 transitions, 508 flow [2022-12-06 07:09:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:09:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:09:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 07:09:40,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:09:40,995 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 6 states and 96 transitions. [2022-12-06 07:09:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 98 transitions, 508 flow [2022-12-06 07:09:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 98 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:09:41,000 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 179 flow [2022-12-06 07:09:41,000 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2022-12-06 07:09:41,001 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-06 07:09:41,001 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:41,002 INFO L89 Accepts]: Start accepts. Operand has 38 places, 38 transitions, 179 flow [2022-12-06 07:09:41,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:41,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:41,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 38 transitions, 179 flow [2022-12-06 07:09:41,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 179 flow [2022-12-06 07:09:41,010 INFO L130 PetriNetUnfolder]: 30/86 cut-off events. [2022-12-06 07:09:41,011 INFO L131 PetriNetUnfolder]: For 55/71 co-relation queries the response was YES. [2022-12-06 07:09:41,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 86 events. 30/86 cut-off events. For 55/71 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 191 event pairs, 2 based on Foata normal form. 1/75 useless extension candidates. Maximal degree in co-relation 148. Up to 33 conditions per place. [2022-12-06 07:09:41,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 38 transitions, 179 flow [2022-12-06 07:09:41,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 07:09:41,015 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:41,016 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 07:09:41,016 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 179 flow [2022-12-06 07:09:41,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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:41,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:41,023 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:41,031 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:41,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:41,231 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:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:41,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1135419108, now seen corresponding path program 2 times [2022-12-06 07:09:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59164092] [2022-12-06 07:09:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:41,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:41,394 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:41,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59164092] [2022-12-06 07:09:41,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59164092] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:41,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904233262] [2022-12-06 07:09:41,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:09:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:41,412 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:41,449 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:41,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:09:41,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:09:41,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:09:41,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:41,647 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:41,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:41,692 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:41,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904233262] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:41,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:41,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:09:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6697525] [2022-12-06 07:09:41,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:41,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:09:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:41,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:09:41,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:09:41,693 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 07:09:41,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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:41,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:41,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 07:09:41,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:41,924 INFO L130 PetriNetUnfolder]: 997/1379 cut-off events. [2022-12-06 07:09:41,924 INFO L131 PetriNetUnfolder]: For 1408/1408 co-relation queries the response was YES. [2022-12-06 07:09:41,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1379 events. 997/1379 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4539 event pairs, 143 based on Foata normal form. 28/1407 useless extension candidates. Maximal degree in co-relation 2423. Up to 605 conditions per place. [2022-12-06 07:09:41,931 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 86 selfloop transitions, 12 changer transitions 3/101 dead transitions. [2022-12-06 07:09:41,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 101 transitions, 580 flow [2022-12-06 07:09:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:09:41,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:09:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-06 07:09:41,933 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-06 07:09:41,933 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 179 flow. Second operand 6 states and 96 transitions. [2022-12-06 07:09:41,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 101 transitions, 580 flow [2022-12-06 07:09:41,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 101 transitions, 571 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 07:09:41,939 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 228 flow [2022-12-06 07:09:41,939 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-06 07:09:41,940 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-06 07:09:41,940 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:41,940 INFO L89 Accepts]: Start accepts. Operand has 44 places, 41 transitions, 228 flow [2022-12-06 07:09:41,940 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:41,941 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:41,941 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 41 transitions, 228 flow [2022-12-06 07:09:41,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 41 transitions, 228 flow [2022-12-06 07:09:41,947 INFO L130 PetriNetUnfolder]: 37/99 cut-off events. [2022-12-06 07:09:41,947 INFO L131 PetriNetUnfolder]: For 133/161 co-relation queries the response was YES. [2022-12-06 07:09:41,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 99 events. 37/99 cut-off events. For 133/161 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 246 event pairs, 2 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 221. Up to 43 conditions per place. [2022-12-06 07:09:41,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 41 transitions, 228 flow [2022-12-06 07:09:41,949 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 07:09:41,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] L65-1-->thread4EXIT: Formula: (and (= |v_thread4Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< (mod v_~x4~0_In_8 4294967296) (mod v_~n~0_In_5 4294967296))) (= |v_thread4Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~n~0=v_~n~0_In_5, ~x4~0=v_~x4~0_In_8} OutVars{thread4Thread1of1ForFork2_#res.offset=|v_thread4Thread1of1ForFork2_#res.offset_Out_4|, ~x4~0=v_~x4~0_In_8, ~n~0=v_~n~0_In_5, thread4Thread1of1ForFork2_#res.base=|v_thread4Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_#res.offset, thread4Thread1of1ForFork2_#res.base] and [339] L56-1-->L56-1: Formula: (and (< (mod v_~x3~0_27 4294967296) (mod v_~n~0_15 4294967296)) (= (* v_~x3~0_27 4) v_~x3~0_25)) InVars {~x3~0=v_~x3~0_27, ~n~0=v_~n~0_15} OutVars{~x3~0=v_~x3~0_25, ~n~0=v_~n~0_15} AuxVars[] AssignedVars[~x3~0] [2022-12-06 07:09:42,018 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:09:42,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-06 07:09:42,019 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 238 flow [2022-12-06 07:09:42,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 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:42,019 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:42,020 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:42,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:09:42,224 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,SelfDestructingSolverStorable3 [2022-12-06 07:09:42,225 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:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1474747795, now seen corresponding path program 1 times [2022-12-06 07:09:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:42,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903849043] [2022-12-06 07:09:42,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:42,364 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:42,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:42,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903849043] [2022-12-06 07:09:42,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903849043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:09:42,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:09:42,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:09:42,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085231974] [2022-12-06 07:09:42,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:09:42,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:09:42,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:42,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:09:42,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:09:42,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:09:42,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 238 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:42,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:42,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:09:42,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:09:42,523 INFO L130 PetriNetUnfolder]: 961/1343 cut-off events. [2022-12-06 07:09:42,523 INFO L131 PetriNetUnfolder]: For 2821/2821 co-relation queries the response was YES. [2022-12-06 07:09:42,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4948 conditions, 1343 events. 961/1343 cut-off events. For 2821/2821 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4547 event pairs, 161 based on Foata normal form. 36/1379 useless extension candidates. Maximal degree in co-relation 2960. Up to 1137 conditions per place. [2022-12-06 07:09:42,530 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 56 selfloop transitions, 11 changer transitions 7/74 dead transitions. [2022-12-06 07:09:42,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 514 flow [2022-12-06 07:09:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:09:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:09:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 07:09:42,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2022-12-06 07:09:42,531 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 238 flow. Second operand 4 states and 63 transitions. [2022-12-06 07:09:42,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 514 flow [2022-12-06 07:09:42,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 473 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:09:42,540 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 254 flow [2022-12-06 07:09:42,540 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-06 07:09:42,540 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-06 07:09:42,540 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:09:42,540 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 254 flow [2022-12-06 07:09:42,541 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:09:42,541 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:09:42,541 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 254 flow [2022-12-06 07:09:42,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 254 flow [2022-12-06 07:09:42,550 INFO L130 PetriNetUnfolder]: 74/159 cut-off events. [2022-12-06 07:09:42,550 INFO L131 PetriNetUnfolder]: For 137/183 co-relation queries the response was YES. [2022-12-06 07:09:42,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 159 events. 74/159 cut-off events. For 137/183 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 455 event pairs, 2 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 406. Up to 76 conditions per place. [2022-12-06 07:09:42,552 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 254 flow [2022-12-06 07:09:42,552 INFO L188 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-06 07:09:42,553 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:09:42,553 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 07:09:42,553 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 254 flow [2022-12-06 07:09:42,553 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:42,553 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:09:42,553 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:42,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:09:42,554 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:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:09:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash 608143865, now seen corresponding path program 1 times [2022-12-06 07:09:42,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:09:42,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286562239] [2022-12-06 07:09:42,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:42,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:09:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:42,890 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:42,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:09:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286562239] [2022-12-06 07:09:42,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286562239] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:09:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922880750] [2022-12-06 07:09:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:09:42,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:09:42,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:09:42,904 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:42,905 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:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:09:43,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 07:09:43,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:09:51,398 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:51,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:09:52,583 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:52,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922880750] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:09:52,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:09:52,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2022-12-06 07:09:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131462255] [2022-12-06 07:09:52,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:09:52,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:09:52,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:09:52,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:09:52,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=74, Unknown=3, NotChecked=0, Total=110 [2022-12-06 07:09:52,586 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 07:09:52,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 254 flow. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 10 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:09:52,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:09:52,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 07:09:52,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:10:05,815 WARN L233 SmtUtils]: Spent 10.82s on a formula simplification. DAG size of input: 63 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:10:08,663 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:10,673 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:10:16,607 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:17,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:10:19,927 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:10:22,557 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:24,997 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:27,044 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:30,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 07:10:31,043 INFO L130 PetriNetUnfolder]: 1535/2131 cut-off events. [2022-12-06 07:10:31,043 INFO L131 PetriNetUnfolder]: For 2997/2997 co-relation queries the response was YES. [2022-12-06 07:10:31,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7836 conditions, 2131 events. 1535/2131 cut-off events. For 2997/2997 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7830 event pairs, 265 based on Foata normal form. 2/2133 useless extension candidates. Maximal degree in co-relation 5269. Up to 1385 conditions per place. [2022-12-06 07:10:31,055 INFO L137 encePairwiseOnDemand]: 18/26 looper letters, 100 selfloop transitions, 31 changer transitions 8/139 dead transitions. [2022-12-06 07:10:31,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 139 transitions, 912 flow [2022-12-06 07:10:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:10:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:10:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-06 07:10:31,068 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5913461538461539 [2022-12-06 07:10:31,068 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 254 flow. Second operand 8 states and 123 transitions. [2022-12-06 07:10:31,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 139 transitions, 912 flow [2022-12-06 07:10:31,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 139 transitions, 903 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:10:31,083 INFO L231 Difference]: Finished difference. Result has 56 places, 67 transitions, 482 flow [2022-12-06 07:10:31,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=482, PETRI_PLACES=56, PETRI_TRANSITIONS=67} [2022-12-06 07:10:31,085 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2022-12-06 07:10:31,085 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:10:31,085 INFO L89 Accepts]: Start accepts. Operand has 56 places, 67 transitions, 482 flow [2022-12-06 07:10:31,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:10:31,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:10:31,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 67 transitions, 482 flow [2022-12-06 07:10:31,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 67 transitions, 482 flow [2022-12-06 07:10:31,105 INFO L130 PetriNetUnfolder]: 130/268 cut-off events. [2022-12-06 07:10:31,105 INFO L131 PetriNetUnfolder]: For 450/523 co-relation queries the response was YES. [2022-12-06 07:10:31,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 268 events. 130/268 cut-off events. For 450/523 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 999 event pairs, 5 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 913. Up to 141 conditions per place. [2022-12-06 07:10:31,108 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 67 transitions, 482 flow [2022-12-06 07:10:31,108 INFO L188 LiptonReduction]: Number of co-enabled transitions 722 [2022-12-06 07:10:31,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [409] L56-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x3~0_In_6 4294967296) (mod v_~n~0_In_1 4294967296))) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {~x3~0=v_~x3~0_In_6, ~n~0=v_~n~0_In_1} OutVars{~x3~0=v_~x3~0_In_6, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~n~0=v_~n~0_In_1, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:10:31,158 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L56-1-->L56-1: Formula: (and (< (mod v_~x3~0_27 4294967296) (mod v_~n~0_15 4294967296)) (= (* v_~x3~0_27 4) v_~x3~0_25)) InVars {~x3~0=v_~x3~0_27, ~n~0=v_~n~0_15} OutVars{~x3~0=v_~x3~0_25, ~n~0=v_~n~0_15} AuxVars[] AssignedVars[~x3~0] and [388] L65-1-->L65-1: Formula: (and (= (* v_~x4~0_47 4) v_~x4~0_45) (< (mod v_~x4~0_47 4294967296) (mod v_~n~0_41 4294967296))) InVars {~x4~0=v_~x4~0_47, ~n~0=v_~n~0_41} OutVars{~x4~0=v_~x4~0_45, ~n~0=v_~n~0_41} AuxVars[] AssignedVars[~x4~0] [2022-12-06 07:10:31,282 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:10:31,283 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:10:31,283 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 67 transitions, 509 flow [2022-12-06 07:10:31,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 10 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:10:31,283 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:10:31,284 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:10:31,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:10:31,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:10:31,489 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:10:31,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:10:31,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1667699092, now seen corresponding path program 1 times [2022-12-06 07:10:31,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:10:31,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748025949] [2022-12-06 07:10:31,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:31,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:10:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:31,598 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:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:10:31,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748025949] [2022-12-06 07:10:31,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748025949] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:10:31,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051749443] [2022-12-06 07:10:31,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:31,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:10:31,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:10:31,600 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:10:31,606 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:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:31,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:10:31,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:10:31,774 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:31,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:10:31,808 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:31,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051749443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:10:31,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:10:31,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-06 07:10:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226475256] [2022-12-06 07:10:31,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:10:31,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 07:10:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:10:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 07:10:31,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 07:10:31,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:10:31,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 67 transitions, 509 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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:31,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:10:31,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:10:31,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:10:32,224 INFO L130 PetriNetUnfolder]: 2443/3371 cut-off events. [2022-12-06 07:10:32,224 INFO L131 PetriNetUnfolder]: For 8326/8326 co-relation queries the response was YES. [2022-12-06 07:10:32,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14434 conditions, 3371 events. 2443/3371 cut-off events. For 8326/8326 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13639 event pairs, 297 based on Foata normal form. 116/3473 useless extension candidates. Maximal degree in co-relation 13388. Up to 1468 conditions per place. [2022-12-06 07:10:32,291 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 130 selfloop transitions, 24 changer transitions 4/158 dead transitions. [2022-12-06 07:10:32,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 158 transitions, 1316 flow [2022-12-06 07:10:32,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:10:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:10:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 07:10:32,293 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 07:10:32,293 INFO L175 Difference]: Start difference. First operand has 56 places, 67 transitions, 509 flow. Second operand 6 states and 108 transitions. [2022-12-06 07:10:32,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 158 transitions, 1316 flow [2022-12-06 07:10:32,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 158 transitions, 1247 flow, removed 30 selfloop flow, removed 1 redundant places. [2022-12-06 07:10:32,309 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 554 flow [2022-12-06 07:10:32,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=554, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2022-12-06 07:10:32,309 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2022-12-06 07:10:32,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:10:32,310 INFO L89 Accepts]: Start accepts. Operand has 63 places, 72 transitions, 554 flow [2022-12-06 07:10:32,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:10:32,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:10:32,312 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 72 transitions, 554 flow [2022-12-06 07:10:32,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 72 transitions, 554 flow [2022-12-06 07:10:32,334 INFO L130 PetriNetUnfolder]: 193/424 cut-off events. [2022-12-06 07:10:32,334 INFO L131 PetriNetUnfolder]: For 840/959 co-relation queries the response was YES. [2022-12-06 07:10:32,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 424 events. 193/424 cut-off events. For 840/959 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2051 event pairs, 9 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 1527. Up to 182 conditions per place. [2022-12-06 07:10:32,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 72 transitions, 554 flow [2022-12-06 07:10:32,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 814 [2022-12-06 07:10:32,472 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:10:32,474 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 07:10:32,474 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 557 flow [2022-12-06 07:10:32,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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:32,474 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:10:32,474 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:10:32,479 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:10:32,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:10:32,680 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:10:32,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:10:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -529785747, now seen corresponding path program 1 times [2022-12-06 07:10:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:10:32,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478240601] [2022-12-06 07:10:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:32,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:10:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:10:32,877 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:32,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:10:32,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478240601] [2022-12-06 07:10:32,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478240601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:10:32,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912383596] [2022-12-06 07:10:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:10:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:10:32,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:10:32,893 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:10:32,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Received shutdown request... [2022-12-06 07:24:20,482 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:24:20,482 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:21,509 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:21,682 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2022-12-06 07:24:21,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-06 07:24:21,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:24:21,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2022-12-06 07:24:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708892681] [2022-12-06 07:24:21,700 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-06 07:24:21,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:21,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:21,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:21,701 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 07:24:21,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 557 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:24:21,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:21,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 07:24:21,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:21,702 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 07:24:21,706 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2022-12-06 07:24:21,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:24:21,706 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 07:24:21,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 07:24:21,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 07:24:21,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 07:24:21,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 07:24:21,708 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:21,710 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:24:21,710 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:24:21,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:24:21 BasicIcfg [2022-12-06 07:24:21,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:24:21,712 INFO L158 Benchmark]: Toolchain (without parser) took 887552.13ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 148.4MB in the beginning and 152.7MB in the end (delta: -4.2MB). Peak memory consumption was 124.2MB. Max. memory is 8.0GB. [2022-12-06 07:24:21,712 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:24:21,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.24ms. Allocated memory is still 174.1MB. Free memory was 148.0MB in the beginning and 136.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 07:24:21,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.10ms. Allocated memory is still 174.1MB. Free memory was 136.9MB in the beginning and 135.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:24:21,712 INFO L158 Benchmark]: Boogie Preprocessor took 33.78ms. Allocated memory is still 174.1MB. Free memory was 135.0MB in the beginning and 133.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:24:21,712 INFO L158 Benchmark]: RCFGBuilder took 441.94ms. Allocated memory is still 174.1MB. Free memory was 133.7MB in the beginning and 119.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:24:21,713 INFO L158 Benchmark]: TraceAbstraction took 886816.19ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 118.7MB in the beginning and 152.7MB in the end (delta: -34.0MB). Peak memory consumption was 93.8MB. Max. memory is 8.0GB. [2022-12-06 07:24:21,713 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-06 07:24:21,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 105.1MB in the beginning and 105.1MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.24ms. Allocated memory is still 174.1MB. Free memory was 148.0MB in the beginning and 136.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.10ms. Allocated memory is still 174.1MB. Free memory was 136.9MB in the beginning and 135.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.78ms. Allocated memory is still 174.1MB. Free memory was 135.0MB in the beginning and 133.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 441.94ms. Allocated memory is still 174.1MB. Free memory was 133.7MB in the beginning and 119.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 886816.19ms. Allocated memory was 174.1MB in the beginning and 302.0MB in the end (delta: 127.9MB). Free memory was 118.7MB in the beginning and 152.7MB in the end (delta: -34.0MB). Peak memory consumption was 93.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 109 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 33 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 763, 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: 763, independent: 763, independent conditional: 0, independent unconditional: 763, 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: 763, independent: 763, independent conditional: 0, independent unconditional: 763, 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: 763, independent: 763, independent conditional: 0, independent unconditional: 763, 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: 763, independent: 763, independent conditional: 0, independent unconditional: 763, 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: 763, independent: 763, independent conditional: 0, independent unconditional: 763, 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: 763, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 763, unknown conditional: 0, unknown unconditional: 763] , Statistics on independence cache: Total cache size (in pairs): 1257, Positive cache size: 1257, Positive conditional cache size: 0, Positive unconditional cache size: 1257, 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, 270 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, 38 PlacesBefore, 38 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 362 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.1s, 44 PlacesBefore, 44 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, 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, 45 PlacesBefore, 45 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 440 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): 11, Positive cache size: 11, Positive conditional cache size: 11, 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.2s, 56 PlacesBefore, 56 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 31, 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: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 31, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 64, 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.1s, 63 PlacesBefore, 63 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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): 64, Positive cache size: 64, Positive conditional cache size: 64, 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: 96]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: 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: 86]: 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: 89]: 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: 87]: 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, 141 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: 886.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 317 SdHoareTripleChecker+Valid, 23.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 23.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1358 IncrementalHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 0 mSDtfsCounter, 1358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 9372 SizeOfPredicates, 23 NumberOfNonLiveVariables, 803 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 2/15 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