/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 04:11:17,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 04:11:17,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 04:11:17,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 04:11:17,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 04:11:17,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 04:11:17,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 04:11:17,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 04:11:17,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 04:11:17,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 04:11:17,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 04:11:17,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 04:11:17,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 04:11:17,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 04:11:17,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 04:11:17,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 04:11:17,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 04:11:17,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 04:11:17,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 04:11:17,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 04:11:17,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 04:11:17,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 04:11:17,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 04:11:17,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 04:11:17,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 04:11:17,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 04:11:17,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 04:11:17,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 04:11:17,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 04:11:17,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 04:11:17,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 04:11:17,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 04:11:17,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 04:11:17,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 04:11:17,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 04:11:17,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 04:11:17,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 04:11:17,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 04:11:17,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 04:11:17,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 04:11:17,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 04:11:17,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 04:11:17,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 04:11:17,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 04:11:17,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 04:11:17,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 04:11:17,786 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 04:11:17,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 04:11:17,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 04:11:17,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 04:11:17,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 04:11:17,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 04:11:17,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 04:11:17,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 04:11:17,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 04:11:17,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:11:17,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 04:11:17,789 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 04:11:17,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 04:11:17,789 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 04:11:17,789 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 04:11:17,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 04:11:17,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 04:11:18,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 04:11:18,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 04:11:18,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 04:11:18,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 04:11:18,064 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 04:11:18,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2022-12-13 04:11:19,627 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 04:11:19,834 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 04:11:19,835 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/loop-tiling-eq.wvr.c [2022-12-13 04:11:19,841 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a160273ef/1cdf60048fc74c958111aab762f5fbc9/FLAG95f759bb8 [2022-12-13 04:11:19,854 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a160273ef/1cdf60048fc74c958111aab762f5fbc9 [2022-12-13 04:11:19,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 04:11:19,858 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 04:11:19,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 04:11:19,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 04:11:19,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 04:11:19,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:11:19" (1/1) ... [2022-12-13 04:11:19,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4468a6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:19, skipping insertion in model container [2022-12-13 04:11:19,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:11:19" (1/1) ... [2022-12-13 04:11:19,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 04:11:19,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 04:11:20,059 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/loop-tiling-eq.wvr.c[2618,2631] [2022-12-13 04:11:20,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:11:20,078 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 04:11:20,110 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/loop-tiling-eq.wvr.c[2618,2631] [2022-12-13 04:11:20,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 04:11:20,124 INFO L208 MainTranslator]: Completed translation [2022-12-13 04:11:20,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20 WrapperNode [2022-12-13 04:11:20,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 04:11:20,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 04:11:20,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 04:11:20,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 04:11:20,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,176 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 186 [2022-12-13 04:11:20,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 04:11:20,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 04:11:20,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 04:11:20,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 04:11:20,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,213 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 04:11:20,218 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 04:11:20,218 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 04:11:20,218 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 04:11:20,219 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (1/1) ... [2022-12-13 04:11:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 04:11:20,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:20,273 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 04:11:20,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 04:11:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 04:11:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 04:11:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 04:11:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 04:11:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 04:11:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 04:11:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 04:11:20,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 04:11:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 04:11:20,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 04:11:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 04:11:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 04:11:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 04:11:20,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 04:11:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 04:11:20,341 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 04:11:20,420 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 04:11:20,422 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 04:11:20,753 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 04:11:20,761 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 04:11:20,761 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-13 04:11:20,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:11:20 BoogieIcfgContainer [2022-12-13 04:11:20,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 04:11:20,765 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 04:11:20,765 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 04:11:20,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 04:11:20,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:11:19" (1/3) ... [2022-12-13 04:11:20,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88e1610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:11:20, skipping insertion in model container [2022-12-13 04:11:20,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:11:20" (2/3) ... [2022-12-13 04:11:20,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88e1610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:11:20, skipping insertion in model container [2022-12-13 04:11:20,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:11:20" (3/3) ... [2022-12-13 04:11:20,769 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-12-13 04:11:20,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 04:11:20,784 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 04:11:20,784 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 04:11:20,840 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 04:11:20,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 250 transitions, 516 flow [2022-12-13 04:11:20,973 INFO L130 PetriNetUnfolder]: 26/248 cut-off events. [2022-12-13 04:11:20,974 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 04:11:20,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 248 events. 26/248 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-12-13 04:11:20,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 250 transitions, 516 flow [2022-12-13 04:11:20,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 221 places, 240 transitions, 492 flow [2022-12-13 04:11:20,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:21,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 240 transitions, 492 flow [2022-12-13 04:11:21,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 240 transitions, 492 flow [2022-12-13 04:11:21,091 INFO L130 PetriNetUnfolder]: 26/240 cut-off events. [2022-12-13 04:11:21,092 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 04:11:21,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 240 events. 26/240 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 186. Up to 2 conditions per place. [2022-12-13 04:11:21,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 240 transitions, 492 flow [2022-12-13 04:11:21,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 972 [2022-12-13 04:11:35,846 INFO L241 LiptonReduction]: Total number of compositions: 212 [2022-12-13 04:11:35,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 04:11:35,862 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;@5e8a0c44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 04:11:35,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 04:11:35,867 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 04:11:35,867 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 04:11:35,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:35,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:35,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1482480724, now seen corresponding path program 1 times [2022-12-13 04:11:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:35,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466067922] [2022-12-13 04:11:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:35,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:35,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:35,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645523342] [2022-12-13 04:11:35,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:35,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:35,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:35,941 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-13 04:11:35,960 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-13 04:11:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:36,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 04:11:36,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:11:36,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:11:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466067922] [2022-12-13 04:11:36,101 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:36,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645523342] [2022-12-13 04:11:36,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645523342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:11:36,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:11:36,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:11:36,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550526480] [2022-12-13 04:11:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:36,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:11:36,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:36,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:11:36,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:11:36,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 04:11:36,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:36,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:36,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 04:11:36,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:36,270 INFO L130 PetriNetUnfolder]: 205/348 cut-off events. [2022-12-13 04:11:36,271 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-13 04:11:36,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 348 events. 205/348 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1356 event pairs, 100 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 278. Up to 166 conditions per place. [2022-12-13 04:11:36,273 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 26 selfloop transitions, 2 changer transitions 16/47 dead transitions. [2022-12-13 04:11:36,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 47 transitions, 206 flow [2022-12-13 04:11:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:11:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:11:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 04:11:36,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2022-12-13 04:11:36,284 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2022-12-13 04:11:36,284 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 47 transitions, 206 flow [2022-12-13 04:11:36,286 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 130 flow [2022-12-13 04:11:36,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:36,288 INFO L89 Accepts]: Start accepts. Operand has 30 places, 31 transitions, 130 flow [2022-12-13 04:11:36,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:36,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:36,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 31 transitions, 130 flow [2022-12-13 04:11:36,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 31 transitions, 130 flow [2022-12-13 04:11:36,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 44 [2022-12-13 04:11:36,297 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:11:36,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 04:11:36,298 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 130 flow [2022-12-13 04:11:36,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:36,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:36,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:36,315 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-13 04:11:36,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-13 04:11:36,505 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:36,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2036660414, now seen corresponding path program 1 times [2022-12-13 04:11:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:36,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97728576] [2022-12-13 04:11:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:36,516 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269800246] [2022-12-13 04:11:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:36,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:36,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:36,518 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-13 04:11:36,519 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-13 04:11:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:36,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 04:11:36,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:36,675 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-13 04:11:36,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:11:36,718 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-13 04:11:36,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:36,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97728576] [2022-12-13 04:11:36,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:36,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269800246] [2022-12-13 04:11:36,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269800246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 04:11:36,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 04:11:36,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-12-13 04:11:36,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424553922] [2022-12-13 04:11:36,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 04:11:36,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 04:11:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:36,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 04:11:36,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 04:11:36,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-13 04:11:36,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:36,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:36,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-13 04:11:36,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:36,832 INFO L130 PetriNetUnfolder]: 194/311 cut-off events. [2022-12-13 04:11:36,832 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-13 04:11:36,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 311 events. 194/311 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 993 event pairs, 32 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 738. Up to 278 conditions per place. [2022-12-13 04:11:36,834 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 41 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2022-12-13 04:11:36,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 296 flow [2022-12-13 04:11:36,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:11:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:11:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-12-13 04:11:36,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2022-12-13 04:11:36,837 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2022-12-13 04:11:36,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 48 transitions, 296 flow [2022-12-13 04:11:36,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 48 transitions, 296 flow [2022-12-13 04:11:36,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:36,840 INFO L89 Accepts]: Start accepts. Operand has 35 places, 48 transitions, 296 flow [2022-12-13 04:11:36,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:36,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:36,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 48 transitions, 296 flow [2022-12-13 04:11:36,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 48 transitions, 296 flow [2022-12-13 04:11:36,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-13 04:11:37,187 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:11:37,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 349 [2022-12-13 04:11:37,189 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 47 transitions, 290 flow [2022-12-13 04:11:37,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:37,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:37,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:37,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 04:11:37,395 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,SelfDestructingSolverStorable1 [2022-12-13 04:11:37,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -731361115, now seen corresponding path program 1 times [2022-12-13 04:11:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:37,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106855383] [2022-12-13 04:11:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:37,406 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:37,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1534584240] [2022-12-13 04:11:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:37,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:37,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:37,408 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-13 04:11:37,410 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-13 04:11:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:37,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 04:11:37,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 04:11:37,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:11:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106855383] [2022-12-13 04:11:37,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534584240] [2022-12-13 04:11:37,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534584240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:11:37,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:11:37,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:11:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871441806] [2022-12-13 04:11:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:37,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:11:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:11:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:11:37,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 04:11:37,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 47 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:37,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:37,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 04:11:37,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:37,701 INFO L130 PetriNetUnfolder]: 576/918 cut-off events. [2022-12-13 04:11:37,701 INFO L131 PetriNetUnfolder]: For 330/334 co-relation queries the response was YES. [2022-12-13 04:11:37,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 918 events. 576/918 cut-off events. For 330/334 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4137 event pairs, 96 based on Foata normal form. 2/689 useless extension candidates. Maximal degree in co-relation 981. Up to 823 conditions per place. [2022-12-13 04:11:37,705 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 43 selfloop transitions, 4 changer transitions 76/125 dead transitions. [2022-12-13 04:11:37,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 125 transitions, 1032 flow [2022-12-13 04:11:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:11:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:11:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-13 04:11:37,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 04:11:37,708 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2022-12-13 04:11:37,708 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 125 transitions, 1032 flow [2022-12-13 04:11:37,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 49 transitions, 396 flow [2022-12-13 04:11:37,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:37,717 INFO L89 Accepts]: Start accepts. Operand has 36 places, 49 transitions, 396 flow [2022-12-13 04:11:37,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:37,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:37,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 49 transitions, 396 flow [2022-12-13 04:11:37,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 49 transitions, 396 flow [2022-12-13 04:11:37,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-13 04:11:37,720 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:11:37,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 04:11:37,721 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 49 transitions, 396 flow [2022-12-13 04:11:37,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:37,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:37,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:37,727 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-13 04:11:37,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:37,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:37,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1037406056, now seen corresponding path program 1 times [2022-12-13 04:11:37,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:37,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755442703] [2022-12-13 04:11:37,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:37,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:37,937 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:37,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524992955] [2022-12-13 04:11:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:37,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:37,939 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-13 04:11:37,941 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-13 04:11:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:38,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 04:11:38,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:38,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:11:38,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:11:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:11:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755442703] [2022-12-13 04:11:38,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:38,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524992955] [2022-12-13 04:11:38,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524992955] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 04:11:38,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 04:11:38,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-12-13 04:11:38,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875972458] [2022-12-13 04:11:38,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:38,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:11:38,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:38,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:11:38,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 04:11:38,071 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 04:11:38,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 49 transitions, 396 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:38,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:38,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 04:11:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:38,225 INFO L130 PetriNetUnfolder]: 228/369 cut-off events. [2022-12-13 04:11:38,225 INFO L131 PetriNetUnfolder]: For 176/176 co-relation queries the response was YES. [2022-12-13 04:11:38,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 369 events. 228/369 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1136 event pairs, 32 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 1444. Up to 356 conditions per place. [2022-12-13 04:11:38,227 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 55 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2022-12-13 04:11:38,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 04:11:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 04:11:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-13 04:11:38,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-13 04:11:38,229 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 12 predicate places. [2022-12-13 04:11:38,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:38,232 INFO L89 Accepts]: Start accepts. Operand has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:38,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:38,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 04:11:38,234 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:11:38,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3 [2022-12-13 04:11:38,235 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 68 transitions, 686 flow [2022-12-13 04:11:38,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:38,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:38,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:38,241 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-13 04:11:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:38,441 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash -263365822, now seen corresponding path program 1 times [2022-12-13 04:11:38,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:38,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399509737] [2022-12-13 04:11:38,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:38,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:38,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1545553936] [2022-12-13 04:11:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:38,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:38,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:38,456 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-13 04:11:38,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 04:11:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 04:11:38,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 04:11:38,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:11:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:38,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399509737] [2022-12-13 04:11:38,691 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:38,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545553936] [2022-12-13 04:11:38,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545553936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:11:38,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:11:38,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 04:11:38,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288580149] [2022-12-13 04:11:38,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:38,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 04:11:38,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:38,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 04:11:38,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 04:11:38,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 04:11:38,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 68 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:38,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:38,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 04:11:38,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:38,982 INFO L130 PetriNetUnfolder]: 228/370 cut-off events. [2022-12-13 04:11:38,982 INFO L131 PetriNetUnfolder]: For 262/262 co-relation queries the response was YES. [2022-12-13 04:11:38,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2186 conditions, 370 events. 228/370 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1125 event pairs, 32 based on Foata normal form. 1/282 useless extension candidates. Maximal degree in co-relation 1731. Up to 356 conditions per place. [2022-12-13 04:11:38,984 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 60 selfloop transitions, 2 changer transitions 5/69 dead transitions. [2022-12-13 04:11:38,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 830 flow [2022-12-13 04:11:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 04:11:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 04:11:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-12-13 04:11:38,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.26785714285714285 [2022-12-13 04:11:38,986 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 17 predicate places. [2022-12-13 04:11:38,986 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 69 transitions, 830 flow [2022-12-13 04:11:38,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 64 transitions, 770 flow [2022-12-13 04:11:38,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:38,989 INFO L89 Accepts]: Start accepts. Operand has 42 places, 64 transitions, 770 flow [2022-12-13 04:11:38,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:38,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:38,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 64 transitions, 770 flow [2022-12-13 04:11:38,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 64 transitions, 770 flow [2022-12-13 04:11:38,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 04:11:39,004 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:11:39,005 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 04:11:39,007 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:11:39,008 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 04:11:44,721 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 152 DAG size of output: 146 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 04:11:49,506 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:11:49,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10518 [2022-12-13 04:11:49,507 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 63 transitions, 758 flow [2022-12-13 04:11:49,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:49,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:49,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:49,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 04:11:49,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:49,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:49,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1952875484, now seen corresponding path program 1 times [2022-12-13 04:11:49,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:49,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649802378] [2022-12-13 04:11:49,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:49,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:49,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1740298187] [2022-12-13 04:11:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:49,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:49,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:49,739 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:11:49,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 04:11:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:49,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 04:11:49,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:11:49,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:11:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:49,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649802378] [2022-12-13 04:11:49,887 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740298187] [2022-12-13 04:11:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740298187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:11:49,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:11:49,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:11:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581135721] [2022-12-13 04:11:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:49,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:11:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:49,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:11:49,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:11:49,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-13 04:11:49,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 63 transitions, 758 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:49,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:49,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-13 04:11:49,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:50,009 INFO L130 PetriNetUnfolder]: 226/365 cut-off events. [2022-12-13 04:11:50,010 INFO L131 PetriNetUnfolder]: For 441/441 co-relation queries the response was YES. [2022-12-13 04:11:50,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 365 events. 226/365 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1112 event pairs, 32 based on Foata normal form. 0/279 useless extension candidates. Maximal degree in co-relation 2002. Up to 355 conditions per place. [2022-12-13 04:11:50,012 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 57 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2022-12-13 04:11:50,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 890 flow [2022-12-13 04:11:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:11:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:11:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-13 04:11:50,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2022-12-13 04:11:50,015 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2022-12-13 04:11:50,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 64 transitions, 890 flow [2022-12-13 04:11:50,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 64 transitions, 890 flow [2022-12-13 04:11:50,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:50,021 INFO L89 Accepts]: Start accepts. Operand has 43 places, 64 transitions, 890 flow [2022-12-13 04:11:50,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:50,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:50,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 64 transitions, 890 flow [2022-12-13 04:11:50,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 64 transitions, 890 flow [2022-12-13 04:11:50,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 04:11:50,030 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:11:50,031 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 04:11:50,032 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:11:50,033 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 04:11:50,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 04:11:50,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 04:11:50,345 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 63 transitions, 876 flow [2022-12-13 04:11:50,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:50,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:50,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:50,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 04:11:50,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:50,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:50,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:50,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1904382376, now seen corresponding path program 1 times [2022-12-13 04:11:50,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:50,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908771197] [2022-12-13 04:11:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:50,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:50,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857486156] [2022-12-13 04:11:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:50,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:50,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:11:50,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 04:11:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:50,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 04:11:50,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 04:11:50,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 04:11:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 04:11:50,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908771197] [2022-12-13 04:11:50,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-13 04:11:50,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857486156] [2022-12-13 04:11:50,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857486156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 04:11:50,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 04:11:50,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 04:11:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829221479] [2022-12-13 04:11:50,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 04:11:50,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 04:11:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 04:11:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 04:11:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 04:11:50,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-13 04:11:50,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 63 transitions, 876 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:50,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 04:11:50,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-13 04:11:50,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 04:11:50,927 INFO L130 PetriNetUnfolder]: 283/470 cut-off events. [2022-12-13 04:11:50,927 INFO L131 PetriNetUnfolder]: For 1672/1678 co-relation queries the response was YES. [2022-12-13 04:11:50,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3533 conditions, 470 events. 283/470 cut-off events. For 1672/1678 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1523 event pairs, 33 based on Foata normal form. 6/403 useless extension candidates. Maximal degree in co-relation 2988. Up to 439 conditions per place. [2022-12-13 04:11:50,930 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 81 selfloop transitions, 7 changer transitions 0/91 dead transitions. [2022-12-13 04:11:50,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 04:11:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 04:11:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-13 04:11:50,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2022-12-13 04:11:50,932 INFO L295 CegarLoopForPetriNet]: 28 programPoint places, 17 predicate places. [2022-12-13 04:11:50,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 04:11:50,939 INFO L89 Accepts]: Start accepts. Operand has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 04:11:50,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 04:11:50,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-13 04:11:50,942 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 04:11:50,943 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 04:11:50,943 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 91 transitions, 1447 flow [2022-12-13 04:11:50,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 04:11:50,943 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 04:11:50,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:11:50,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 04:11:51,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:51,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 04:11:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 04:11:51,152 INFO L85 PathProgramCache]: Analyzing trace with hash -335862706, now seen corresponding path program 1 times [2022-12-13 04:11:51,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 04:11:51,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824113143] [2022-12-13 04:11:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 04:11:51,166 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-13 04:11:51,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826108534] [2022-12-13 04:11:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 04:11:51,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 04:11:51,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 04:11:51,168 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 04:11:51,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 04:11:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 04:11:51,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 104 conjunts are in the unsatisfiable core [2022-12-13 04:11:51,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 04:11:51,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:51,409 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-12-13 04:11:51,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2022-12-13 04:11:51,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:51,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:51,468 INFO L321 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2022-12-13 04:11:51,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 41 [2022-12-13 04:11:51,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:51,582 INFO L321 Elim1Store]: treesize reduction 56, result has 37.1 percent of original size [2022-12-13 04:11:51,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 55 [2022-12-13 04:11:51,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 04:11:51,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 04:11:51,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 04:11:51,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-12-13 04:11:52,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 04:11:52,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-12-13 04:11:52,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 04:11:52,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:52,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 04:11:52,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 04:11:52,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-12-13 04:11:52,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 04:11:52,826 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 04:11:52,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-12-13 04:11:52,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-12-13 04:11:52,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2022-12-13 04:11:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 04:11:53,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 04:12:00,957 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_723 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_728 (Array Int Int)) (v_~b~0_60 Int) (v_~a~0_62 Int)) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_723))) (let ((.cse3 (select (select .cse2 c_~B~0.base) c_~B~0.offset)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_725))) (let ((.cse0 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_724))) (store .cse6 .cse3 (store (select .cse6 .cse3) (select (select .cse5 c_~B~0.base) c_~B~0.offset) (select (select .cse6 c_~F~0.base) c_~F~0.offset))))) (.cse1 (* v_~b~0_60 4))) (= (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* (* v_~a~0_62 c_~M~0) 4) .cse1)) (let ((.cse4 (+ (* v_~a~0_62 4) c_~B~0.offset))) (select (select .cse0 (select (select (store .cse2 .cse3 v_ArrVal_728) c_~B~0.base) .cse4)) (+ .cse1 (select (select (store .cse5 .cse3 v_ArrVal_726) c_~B~0.base) .cse4)))))))) (<= c_~N~0 v_~a~0_62) (< v_~b~0_60 0) (< v_~a~0_62 0) (<= c_~M~0 v_~b~0_60))) is different from false [2022-12-13 04:12:01,175 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-13 04:12:01,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 300 treesize of output 205 [2022-12-13 04:12:01,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:12:01,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 23030 treesize of output 20665 [2022-12-13 04:12:01,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 04:12:01,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26842 treesize of output 22523 Received shutdown request... [2022-12-13 04:25:37,812 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 04:25:37,813 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 04:25:37,819 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-13 04:25:37,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 04:25:37,829 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 04:25:38,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 04:25:38,021 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 20 for 8ms.. [2022-12-13 04:25:38,027 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 04:25:38,027 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 04:25:38,028 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 04:25:38,033 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 04:25:38,033 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 04:25:38,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:25:38 BasicIcfg [2022-12-13 04:25:38,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 04:25:38,037 INFO L158 Benchmark]: Toolchain (without parser) took 858179.30ms. Allocated memory was 205.5MB in the beginning and 669.0MB in the end (delta: 463.5MB). Free memory was 182.1MB in the beginning and 428.2MB in the end (delta: -246.1MB). Peak memory consumption was 422.6MB. Max. memory is 8.0GB. [2022-12-13 04:25:38,037 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 04:25:38,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.87ms. Allocated memory is still 205.5MB. Free memory was 181.5MB in the beginning and 170.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 04:25:38,038 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 205.5MB. Free memory was 170.0MB in the beginning and 167.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:25:38,039 INFO L158 Benchmark]: Boogie Preprocessor took 39.83ms. Allocated memory is still 205.5MB. Free memory was 167.9MB in the beginning and 165.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 04:25:38,039 INFO L158 Benchmark]: RCFGBuilder took 545.34ms. Allocated memory is still 205.5MB. Free memory was 165.8MB in the beginning and 143.8MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-13 04:25:38,040 INFO L158 Benchmark]: TraceAbstraction took 857271.63ms. Allocated memory was 205.5MB in the beginning and 669.0MB in the end (delta: 463.5MB). Free memory was 142.7MB in the beginning and 428.2MB in the end (delta: -285.4MB). Peak memory consumption was 382.7MB. Max. memory is 8.0GB. [2022-12-13 04:25:38,047 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 205.5MB. Free memory is still 182.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.87ms. Allocated memory is still 205.5MB. Free memory was 181.5MB in the beginning and 170.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 205.5MB. Free memory was 170.0MB in the beginning and 167.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.83ms. Allocated memory is still 205.5MB. Free memory was 167.9MB in the beginning and 165.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 545.34ms. Allocated memory is still 205.5MB. Free memory was 165.8MB in the beginning and 143.8MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 857271.63ms. Allocated memory was 205.5MB in the beginning and 669.0MB in the end (delta: 463.5MB). Free memory was 142.7MB in the beginning and 428.2MB in the end (delta: -285.4MB). Peak memory consumption was 382.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.8s, 221 PlacesBefore, 28 PlacesAfterwards, 240 TransitionsBefore, 28 TransitionsAfterwards, 972 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 167 TrivialYvCompositions, 26 ConcurrentYvCompositions, 19 ChoiceCompositions, 212 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 596, independent: 575, independent conditional: 575, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 596, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 596, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 596, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 538, independent: 527, independent conditional: 0, independent unconditional: 527, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 538, independent: 527, independent conditional: 0, independent unconditional: 527, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 596, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 538, unknown conditional: 0, unknown unconditional: 538] , Statistics on independence cache: Total cache size (in pairs): 892, Positive cache size: 881, Positive conditional cache size: 0, Positive unconditional cache size: 881, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 35 PlacesBefore, 34 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 34 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 40 PlacesBefore, 40 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 42 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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: 10.5s, 42 PlacesBefore, 40 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 42 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 6 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): 3, Positive cache size: 2, Positive conditional cache size: 0, Positive unconditional cache size: 2, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 20 for 8ms.. - 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 CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 20 for 8ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 26 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 20 for 8ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 256 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 857.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1447occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 171 ConstructedInterpolants, 1 QuantifiedInterpolants, 400 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2040 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 13/16 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