/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 21:15:32,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 21:15:32,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 21:15:32,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 21:15:32,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 21:15:32,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 21:15:32,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 21:15:32,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 21:15:32,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 21:15:32,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 21:15:32,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 21:15:32,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 21:15:32,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 21:15:32,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 21:15:32,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 21:15:32,773 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 21:15:32,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 21:15:32,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 21:15:32,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 21:15:32,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 21:15:32,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 21:15:32,786 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 21:15:32,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 21:15:32,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 21:15:32,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 21:15:32,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 21:15:32,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 21:15:32,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 21:15:32,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 21:15:32,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 21:15:32,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 21:15:32,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 21:15:32,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 21:15:32,802 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 21:15:32,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 21:15:32,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 21:15:32,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 21:15:32,803 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 21:15:32,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 21:15:32,804 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 21:15:32,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 21:15:32,805 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-NoLbe.epf [2022-09-20 21:15:32,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 21:15:32,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 21:15:32,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 21:15:32,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 21:15:32,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 21:15:32,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 21:15:32,837 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 21:15:32,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 21:15:32,837 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 21:15:32,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 21:15:32,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 21:15:32,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 21:15:32,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 21:15:32,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 21:15:32,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 21:15:32,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 21:15:32,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 21:15:32,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 21:15:32,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 21:15:32,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 21:15:32,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 21:15:32,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 21:15:32,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 21:15:32,842 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 21:15:32,842 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 21:15:32,842 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 21:15:33,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 21:15:33,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 21:15:33,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 21:15:33,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 21:15:33,071 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 21:15:33,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-09-20 21:15:33,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b479c8e00/066f1ea51e1b48aebc9a6ae06e91b478/FLAG7c302aa76 [2022-09-20 21:15:33,625 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 21:15:33,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2022-09-20 21:15:33,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b479c8e00/066f1ea51e1b48aebc9a6ae06e91b478/FLAG7c302aa76 [2022-09-20 21:15:33,646 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b479c8e00/066f1ea51e1b48aebc9a6ae06e91b478 [2022-09-20 21:15:33,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 21:15:33,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 21:15:33,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 21:15:33,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 21:15:33,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 21:15:33,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ddd62e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33, skipping insertion in model container [2022-09-20 21:15:33,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 21:15:33,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 21:15:33,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-09-20 21:15:33,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 21:15:33,885 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 21:15:33,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2022-09-20 21:15:33,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 21:15:33,922 INFO L208 MainTranslator]: Completed translation [2022-09-20 21:15:33,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33 WrapperNode [2022-09-20 21:15:33,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 21:15:33,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 21:15:33,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 21:15:33,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 21:15:33,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,983 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 280 [2022-09-20 21:15:33,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 21:15:33,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 21:15:33,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 21:15:33,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 21:15:33,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:33,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:34,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:34,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:34,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:34,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 21:15:34,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 21:15:34,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 21:15:34,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 21:15:34,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (1/1) ... [2022-09-20 21:15:34,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 21:15:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 21:15:34,053 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-09-20 21:15:34,070 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-09-20 21:15:34,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 21:15:34,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 21:15:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 21:15:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 21:15:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 21:15:34,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 21:15:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 21:15:34,096 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 21:15:34,096 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 21:15:34,097 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 21:15:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 21:15:34,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 21:15:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 21:15:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 21:15:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 21:15:34,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 21:15:34,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 21:15:34,100 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 21:15:34,243 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 21:15:34,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 21:15:34,663 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 21:15:34,833 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 21:15:34,833 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-09-20 21:15:34,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 09:15:34 BoogieIcfgContainer [2022-09-20 21:15:34,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 21:15:34,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 21:15:34,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 21:15:34,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 21:15:34,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 09:15:33" (1/3) ... [2022-09-20 21:15:34,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72df36b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 09:15:34, skipping insertion in model container [2022-09-20 21:15:34,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 09:15:33" (2/3) ... [2022-09-20 21:15:34,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72df36b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 09:15:34, skipping insertion in model container [2022-09-20 21:15:34,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 09:15:34" (3/3) ... [2022-09-20 21:15:34,849 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2022-09-20 21:15:34,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 21:15:34,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 21:15:34,866 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 21:15:34,936 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 21:15:34,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 196 transitions, 416 flow [2022-09-20 21:15:35,057 INFO L130 PetriNetUnfolder]: 16/193 cut-off events. [2022-09-20 21:15:35,057 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 21:15:35,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 193 events. 16/193 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 110 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2022-09-20 21:15:35,066 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 196 transitions, 416 flow [2022-09-20 21:15:35,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 182 transitions, 382 flow [2022-09-20 21:15:35,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 21:15:35,088 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=PETRI_NET, 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;@4386beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 21:15:35,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 21:15:35,156 INFO L130 PetriNetUnfolder]: 16/181 cut-off events. [2022-09-20 21:15:35,156 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 21:15:35,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 21:15:35,157 INFO L208 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 21:15:35,158 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 21:15:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 21:15:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash 557862033, now seen corresponding path program 1 times [2022-09-20 21:15:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 21:15:35,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004904243] [2022-09-20 21:15:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 21:15:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 21:15:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 21:15:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004904243] [2022-09-20 21:15:35,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004904243] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 21:15:35,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 21:15:35,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 21:15:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813264147] [2022-09-20 21:15:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 21:15:35,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 21:15:35,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 21:15:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 21:15:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 21:15:35,546 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 196 [2022-09-20 21:15:35,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 182 transitions, 382 flow. Second operand has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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-09-20 21:15:35,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 21:15:35,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 196 [2022-09-20 21:15:35,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 21:15:35,664 INFO L130 PetriNetUnfolder]: 42/316 cut-off events. [2022-09-20 21:15:35,664 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-09-20 21:15:35,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 316 events. 42/316 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 802 event pairs, 15 based on Foata normal form. 42/325 useless extension candidates. Maximal degree in co-relation 229. Up to 59 conditions per place. [2022-09-20 21:15:35,672 INFO L137 encePairwiseOnDemand]: 185/196 looper letters, 9 selfloop transitions, 0 changer transitions 6/171 dead transitions. [2022-09-20 21:15:35,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 171 transitions, 378 flow [2022-09-20 21:15:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 21:15:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 21:15:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 370 transitions. [2022-09-20 21:15:35,690 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9438775510204082 [2022-09-20 21:15:35,690 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 370 transitions. [2022-09-20 21:15:35,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 370 transitions. [2022-09-20 21:15:35,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 21:15:35,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 370 transitions. [2022-09-20 21:15:35,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 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-09-20 21:15:35,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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-09-20 21:15:35,711 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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-09-20 21:15:35,712 INFO L175 Difference]: Start difference. First operand has 176 places, 182 transitions, 382 flow. Second operand 2 states and 370 transitions. [2022-09-20 21:15:35,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 171 transitions, 378 flow [2022-09-20 21:15:35,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 171 transitions, 366 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 21:15:35,725 INFO L231 Difference]: Finished difference. Result has 171 places, 165 transitions, 336 flow [2022-09-20 21:15:35,727 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=336, PETRI_PLACES=171, PETRI_TRANSITIONS=165} [2022-09-20 21:15:35,730 INFO L287 CegarLoopForPetriNet]: 176 programPoint places, -5 predicate places. [2022-09-20 21:15:35,731 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 165 transitions, 336 flow [2022-09-20 21:15:35,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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-09-20 21:15:35,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 21:15:35,732 INFO L208 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 21:15:35,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 21:15:35,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 21:15:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 21:15:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2054653840, now seen corresponding path program 1 times [2022-09-20 21:15:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 21:15:35,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912643368] [2022-09-20 21:15:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:35,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 21:15:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:36,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 21:15:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 21:15:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912643368] [2022-09-20 21:15:36,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912643368] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 21:15:36,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 21:15:36,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 21:15:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148913460] [2022-09-20 21:15:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 21:15:36,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 21:15:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 21:15:36,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 21:15:36,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-09-20 21:15:36,096 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 196 [2022-09-20 21:15:36,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 165 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 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-09-20 21:15:36,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 21:15:36,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 196 [2022-09-20 21:15:36,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 21:15:36,477 INFO L130 PetriNetUnfolder]: 298/789 cut-off events. [2022-09-20 21:15:36,477 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-09-20 21:15:36,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 789 events. 298/789 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3398 event pairs, 167 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1286. Up to 438 conditions per place. [2022-09-20 21:15:36,485 INFO L137 encePairwiseOnDemand]: 181/196 looper letters, 62 selfloop transitions, 10 changer transitions 23/196 dead transitions. [2022-09-20 21:15:36,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 196 transitions, 588 flow [2022-09-20 21:15:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 21:15:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 21:15:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2022-09-20 21:15:36,490 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-09-20 21:15:36,490 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2022-09-20 21:15:36,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2022-09-20 21:15:36,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 21:15:36,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2022-09-20 21:15:36,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 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-09-20 21:15:36,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-09-20 21:15:36,498 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-09-20 21:15:36,498 INFO L175 Difference]: Start difference. First operand has 171 places, 165 transitions, 336 flow. Second operand 8 states and 1008 transitions. [2022-09-20 21:15:36,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 196 transitions, 588 flow [2022-09-20 21:15:36,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 196 transitions, 588 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 21:15:36,505 INFO L231 Difference]: Finished difference. Result has 176 places, 167 transitions, 380 flow [2022-09-20 21:15:36,506 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=380, PETRI_PLACES=176, PETRI_TRANSITIONS=167} [2022-09-20 21:15:36,506 INFO L287 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2022-09-20 21:15:36,506 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 167 transitions, 380 flow [2022-09-20 21:15:36,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.25) internal successors, (962), 8 states have internal predecessors, (962), 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-09-20 21:15:36,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 21:15:36,508 INFO L208 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 21:15:36,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 21:15:36,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 21:15:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 21:15:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1466577786, now seen corresponding path program 1 times [2022-09-20 21:15:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 21:15:36,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849027254] [2022-09-20 21:15:36,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 21:15:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 21:15:36,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 21:15:36,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849027254] [2022-09-20 21:15:36,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849027254] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 21:15:36,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140469485] [2022-09-20 21:15:36,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:36,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:15:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 21:15:36,695 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-09-20 21:15:36,701 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-09-20 21:15:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:36,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 21:15:36,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 21:15:37,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 21:15:37,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 21:15:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 21:15:37,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140469485] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 21:15:37,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 21:15:37,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-09-20 21:15:37,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021127757] [2022-09-20 21:15:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 21:15:37,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 21:15:37,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 21:15:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 21:15:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 21:15:37,318 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 196 [2022-09-20 21:15:37,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 167 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 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-09-20 21:15:37,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 21:15:37,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 196 [2022-09-20 21:15:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 21:15:37,530 INFO L130 PetriNetUnfolder]: 182/683 cut-off events. [2022-09-20 21:15:37,530 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-09-20 21:15:37,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 683 events. 182/683 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3320 event pairs, 80 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 1022. Up to 147 conditions per place. [2022-09-20 21:15:37,534 INFO L137 encePairwiseOnDemand]: 188/196 looper letters, 46 selfloop transitions, 7 changer transitions 0/175 dead transitions. [2022-09-20 21:15:37,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 504 flow [2022-09-20 21:15:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 21:15:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 21:15:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1039 transitions. [2022-09-20 21:15:37,537 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7572886297376094 [2022-09-20 21:15:37,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1039 transitions. [2022-09-20 21:15:37,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1039 transitions. [2022-09-20 21:15:37,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 21:15:37,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1039 transitions. [2022-09-20 21:15:37,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.42857142857142) internal successors, (1039), 7 states have internal predecessors, (1039), 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-09-20 21:15:37,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-09-20 21:15:37,543 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 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-09-20 21:15:37,543 INFO L175 Difference]: Start difference. First operand has 176 places, 167 transitions, 380 flow. Second operand 7 states and 1039 transitions. [2022-09-20 21:15:37,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 504 flow [2022-09-20 21:15:37,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 480 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-09-20 21:15:37,550 INFO L231 Difference]: Finished difference. Result has 176 places, 169 transitions, 389 flow [2022-09-20 21:15:37,551 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=176, PETRI_TRANSITIONS=169} [2022-09-20 21:15:37,552 INFO L287 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2022-09-20 21:15:37,553 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 169 transitions, 389 flow [2022-09-20 21:15:37,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 146.14285714285714) internal successors, (1023), 7 states have internal predecessors, (1023), 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-09-20 21:15:37,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 21:15:37,554 INFO L208 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, 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, 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, 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, 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, 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, 1, 1, 1] [2022-09-20 21:15:37,581 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-09-20 21:15:37,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:15:37,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 21:15:37,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 21:15:37,769 INFO L85 PathProgramCache]: Analyzing trace with hash -84754530, now seen corresponding path program 1 times [2022-09-20 21:15:37,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 21:15:37,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263063095] [2022-09-20 21:15:37,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:37,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 21:15:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 21:15:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 21:15:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263063095] [2022-09-20 21:15:37,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263063095] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 21:15:37,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510668768] [2022-09-20 21:15:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:37,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:15:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 21:15:37,961 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-09-20 21:15:37,962 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-09-20 21:15:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:38,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 21:15:38,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 21:15:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 21:15:38,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 21:15:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 21:15:38,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510668768] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 21:15:38,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 21:15:38,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-09-20 21:15:38,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813683577] [2022-09-20 21:15:38,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 21:15:38,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 21:15:38,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 21:15:38,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 21:15:38,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-09-20 21:15:38,501 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 196 [2022-09-20 21:15:38,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 169 transitions, 389 flow. Second operand has 9 states, 9 states have (on average 138.66666666666666) internal successors, (1248), 9 states have internal predecessors, (1248), 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-09-20 21:15:38,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 21:15:38,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 196 [2022-09-20 21:15:38,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 21:15:38,916 INFO L130 PetriNetUnfolder]: 782/1735 cut-off events. [2022-09-20 21:15:38,916 INFO L131 PetriNetUnfolder]: For 599/823 co-relation queries the response was YES. [2022-09-20 21:15:38,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 1735 events. 782/1735 cut-off events. For 599/823 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10265 event pairs, 133 based on Foata normal form. 224/1746 useless extension candidates. Maximal degree in co-relation 3350. Up to 406 conditions per place. [2022-09-20 21:15:38,931 INFO L137 encePairwiseOnDemand]: 183/196 looper letters, 89 selfloop transitions, 18 changer transitions 0/222 dead transitions. [2022-09-20 21:15:38,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 222 transitions, 750 flow [2022-09-20 21:15:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 21:15:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 21:15:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1441 transitions. [2022-09-20 21:15:38,935 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.735204081632653 [2022-09-20 21:15:38,935 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1441 transitions. [2022-09-20 21:15:38,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1441 transitions. [2022-09-20 21:15:38,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 21:15:38,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1441 transitions. [2022-09-20 21:15:38,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.1) internal successors, (1441), 10 states have internal predecessors, (1441), 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-09-20 21:15:38,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 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-09-20 21:15:38,942 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 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-09-20 21:15:38,943 INFO L175 Difference]: Start difference. First operand has 176 places, 169 transitions, 389 flow. Second operand 10 states and 1441 transitions. [2022-09-20 21:15:38,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 222 transitions, 750 flow [2022-09-20 21:15:38,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 222 transitions, 738 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 21:15:38,948 INFO L231 Difference]: Finished difference. Result has 186 places, 181 transitions, 489 flow [2022-09-20 21:15:38,948 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=489, PETRI_PLACES=186, PETRI_TRANSITIONS=181} [2022-09-20 21:15:38,949 INFO L287 CegarLoopForPetriNet]: 176 programPoint places, 10 predicate places. [2022-09-20 21:15:38,949 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 181 transitions, 489 flow [2022-09-20 21:15:38,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.66666666666666) internal successors, (1248), 9 states have internal predecessors, (1248), 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-09-20 21:15:38,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 21:15:38,950 INFO L208 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, 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, 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, 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, 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, 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, 1, 1, 1] [2022-09-20 21:15:38,978 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-09-20 21:15:39,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-09-20 21:15:39,172 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 21:15:39,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 21:15:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash -895989878, now seen corresponding path program 2 times [2022-09-20 21:15:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 21:15:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020173566] [2022-09-20 21:15:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 21:15:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:39,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 21:15:39,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 21:15:39,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020173566] [2022-09-20 21:15:39,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020173566] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 21:15:39,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045138633] [2022-09-20 21:15:39,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 21:15:39,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:15:39,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 21:15:39,312 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-09-20 21:15:39,340 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-09-20 21:15:39,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-20 21:15:39,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 21:15:39,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-20 21:15:39,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 21:15:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 21:15:39,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 21:15:39,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045138633] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 21:15:39,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 21:15:39,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-09-20 21:15:39,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596878742] [2022-09-20 21:15:39,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 21:15:39,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 21:15:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 21:15:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 21:15:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-09-20 21:15:39,605 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 196 [2022-09-20 21:15:39,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 181 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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-09-20 21:15:39,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 21:15:39,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 196 [2022-09-20 21:15:39,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 21:15:39,918 INFO L130 PetriNetUnfolder]: 504/1149 cut-off events. [2022-09-20 21:15:39,919 INFO L131 PetriNetUnfolder]: For 991/1132 co-relation queries the response was YES. [2022-09-20 21:15:39,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2810 conditions, 1149 events. 504/1149 cut-off events. For 991/1132 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5777 event pairs, 136 based on Foata normal form. 161/1266 useless extension candidates. Maximal degree in co-relation 2797. Up to 421 conditions per place. [2022-09-20 21:15:39,929 INFO L137 encePairwiseOnDemand]: 187/196 looper letters, 56 selfloop transitions, 10 changer transitions 0/189 dead transitions. [2022-09-20 21:15:39,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 648 flow [2022-09-20 21:15:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 21:15:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 21:15:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1098 transitions. [2022-09-20 21:15:39,932 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7002551020408163 [2022-09-20 21:15:39,933 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1098 transitions. [2022-09-20 21:15:39,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1098 transitions. [2022-09-20 21:15:39,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 21:15:39,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1098 transitions. [2022-09-20 21:15:39,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.25) internal successors, (1098), 8 states have internal predecessors, (1098), 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-09-20 21:15:39,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-09-20 21:15:39,938 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 196.0) internal successors, (1764), 9 states have internal predecessors, (1764), 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-09-20 21:15:39,938 INFO L175 Difference]: Start difference. First operand has 186 places, 181 transitions, 489 flow. Second operand 8 states and 1098 transitions. [2022-09-20 21:15:39,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 648 flow [2022-09-20 21:15:39,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 189 transitions, 641 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 21:15:39,949 INFO L231 Difference]: Finished difference. Result has 190 places, 181 transitions, 509 flow [2022-09-20 21:15:39,950 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=509, PETRI_PLACES=190, PETRI_TRANSITIONS=181} [2022-09-20 21:15:39,952 INFO L287 CegarLoopForPetriNet]: 176 programPoint places, 14 predicate places. [2022-09-20 21:15:39,952 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 181 transitions, 509 flow [2022-09-20 21:15:39,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 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-09-20 21:15:39,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 21:15:39,953 INFO L208 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 21:15:39,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-20 21:15:40,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:15:40,176 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 21:15:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 21:15:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2125791248, now seen corresponding path program 1 times [2022-09-20 21:15:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 21:15:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677516804] [2022-09-20 21:15:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 21:15:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 21:15:43,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 21:15:43,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677516804] [2022-09-20 21:15:43,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677516804] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 21:15:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993342343] [2022-09-20 21:15:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 21:15:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:15:43,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 21:15:43,056 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-09-20 21:15:43,068 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-09-20 21:15:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 21:15:43,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 90 conjunts are in the unsatisfiable core [2022-09-20 21:15:43,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 21:15:44,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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-09-20 21:15:45,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 21:15:45,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 21:15:45,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 21:15:46,192 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 21:15:46,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 98 [2022-09-20 21:15:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 21:15:46,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 21:16:10,053 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_197 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse0 (select .cse3 ~A~0.base)) (.cse2 (select .cse3 c_~B~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ c_~A~0.offset .cse1)) c_~res2~0 (select .cse2 (+ .cse1 c_~B~0.offset)))) (+ (select .cse0 c_~A~0.offset) (select .cse2 c_~B~0.offset) c_~res1~0 1)))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_197 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse4 (select .cse7 ~A~0.base)) (.cse5 (select .cse7 c_~B~0.base))) (<= (+ (select .cse4 c_~A~0.offset) (select .cse5 c_~B~0.offset) c_~res1~0) (let ((.cse6 (* ~M~0 4))) (+ (select .cse4 (+ c_~A~0.offset .cse6)) c_~res2~0 (select .cse5 (+ .cse6 c_~B~0.offset))))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-09-20 21:16:10,227 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse1 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 ~A~0.base))) (<= (+ (select .cse0 c_~A~0.offset) (select .cse1 c_~B~0.offset) c_~res1~0) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ .cse2 c_~B~0.offset)) (select .cse0 (+ c_~A~0.offset .cse2))))))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse6 (select .cse7 ~A~0.base)) (.cse4 (select .cse7 c_~B~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ .cse5 c_~B~0.offset)) (select .cse6 (+ c_~A~0.offset .cse5)))) (+ (select .cse6 c_~A~0.offset) (select .cse4 c_~B~0.offset) c_~res1~0 1)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-09-20 21:16:10,373 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse0 (select .cse3 c_~B~0.base)) (.cse2 (select .cse3 ~A~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ (select .cse0 c_~B~0.offset) c_~res1~0 (select .cse2 c_~A~0.offset) 1)))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse4 (select .cse7 c_~B~0.base)) (.cse5 (select .cse7 ~A~0.base))) (<= (+ (select .cse4 c_~B~0.offset) c_~res1~0 (select .cse5 c_~A~0.offset)) (let ((.cse6 (* ~M~0 4))) (+ (select .cse4 (+ .cse6 c_~B~0.offset)) c_~res2~0 (select .cse5 (+ c_~A~0.offset .cse6))))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-09-20 21:16:10,628 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_#t~ret19#1.base|)) (.cse1 (select .cse3 ~A~0.base))) (<= (+ (select .cse0 |c_ULTIMATE.start_main_#t~ret19#1.offset|) c_~res1~0 (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ (select .cse0 (+ .cse2 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2))))))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_#t~ret19#1.base|)) (.cse6 (select .cse7 ~A~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ (select .cse4 (+ .cse5 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse5)))) (+ (select .cse4 |c_ULTIMATE.start_main_#t~ret19#1.offset|) c_~res1~0 (select .cse6 c_~A~0.offset) 1)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-09-20 21:16:10,685 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse1 (select .cse3 ~A~0.base)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (<= (+ c_~res1~0 (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse4 (select .cse7 ~A~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (+ c_~res1~0 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (select .cse4 c_~A~0.offset) 1)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-09-20 21:16:10,717 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse1 (select .cse3 ~A~0.base)) (.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (<= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select .cse1 c_~A~0.offset)) (let ((.cse2 (* ~M~0 4))) (+ c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse2)) (select .cse0 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (< (+ ~M~0 1) c_~N~0))) (forall ((~M~0 Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_197 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~A~0.base Int)) (or (not (< ~M~0 c_~N~0)) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_196) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_197))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select .cse7 ~A~0.base))) (< (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse4 (+ c_~A~0.offset .cse5)) (select .cse6 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (+ (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select .cse4 c_~A~0.offset) 1)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-09-20 21:16:10,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 21:16:10,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 82 [2022-09-20 21:16:10,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 21:16:10,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36854 treesize of output 33866 [2022-09-20 21:16:11,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 21:16:11,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33782 treesize of output 31806 [2022-09-20 21:16:11,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 21:16:11,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31734 treesize of output 27710 [2022-09-20 21:16:11,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 21:16:11,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27638 treesize of output 19518 Received shutdown request... [2022-09-20 21:29:57,639 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-09-20 21:29:57,641 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-09-20 21:29:57,643 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-09-20 21:29:57,644 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 21:29:57,662 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-09-20 21:29:57,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 21:29:57,843 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-09-20 21:29:57,844 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-09-20 21:29:57,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-09-20 21:29:57,845 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-09-20 21:29:57,845 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2022-09-20 21:29:57,848 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 21:29:57,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 21:29:57,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 09:29:57 BasicIcfg [2022-09-20 21:29:57,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 21:29:57,853 INFO L158 Benchmark]: Toolchain (without parser) took 864201.36ms. Allocated memory was 181.4MB in the beginning and 503.3MB in the end (delta: 321.9MB). Free memory was 151.0MB in the beginning and 360.3MB in the end (delta: -209.3MB). Peak memory consumption was 316.5MB. Max. memory is 8.0GB. [2022-09-20 21:29:57,854 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 181.4MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 21:29:57,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.26ms. Allocated memory was 181.4MB in the beginning and 240.1MB in the end (delta: 58.7MB). Free memory was 150.8MB in the beginning and 208.1MB in the end (delta: -57.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-09-20 21:29:57,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.20ms. Allocated memory is still 240.1MB. Free memory was 208.1MB in the beginning and 205.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 21:29:57,855 INFO L158 Benchmark]: Boogie Preprocessor took 31.26ms. Allocated memory is still 240.1MB. Free memory was 205.5MB in the beginning and 203.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-09-20 21:29:57,856 INFO L158 Benchmark]: RCFGBuilder took 819.42ms. Allocated memory is still 240.1MB. Free memory was 203.9MB in the beginning and 155.7MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. [2022-09-20 21:29:57,856 INFO L158 Benchmark]: TraceAbstraction took 863013.75ms. Allocated memory was 240.1MB in the beginning and 503.3MB in the end (delta: 263.2MB). Free memory was 154.6MB in the beginning and 360.3MB in the end (delta: -205.7MB). Peak memory consumption was 262.1MB. Max. memory is 8.0GB. [2022-09-20 21:29:57,858 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.15ms. Allocated memory is still 181.4MB. Free memory is still 135.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.26ms. Allocated memory was 181.4MB in the beginning and 240.1MB in the end (delta: 58.7MB). Free memory was 150.8MB in the beginning and 208.1MB in the end (delta: -57.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.20ms. Allocated memory is still 240.1MB. Free memory was 208.1MB in the beginning and 205.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.26ms. Allocated memory is still 240.1MB. Free memory was 205.5MB in the beginning and 203.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 819.42ms. Allocated memory is still 240.1MB. Free memory was 203.9MB in the beginning and 155.7MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 8.0GB. * TraceAbstraction took 863013.75ms. Allocated memory was 240.1MB in the beginning and 503.3MB in the end (delta: 263.2MB). Free memory was 154.6MB in the beginning and 360.3MB in the end (delta: -205.7MB). Peak memory consumption was 262.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 160 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 214 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 862.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 558 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 558 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 450 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 127 mSDtfsCounter, 450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 802 GetRequests, 736 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=5, InterpolantAutomatonStates: 35, 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.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1172 NumberOfCodeBlocks, 1152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1462 ConstructedInterpolants, 0 QuantifiedInterpolants, 3989 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1038 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 16/21 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