/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:13:19,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:13:19,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:13:19,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:13:19,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:13:19,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:13:19,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:13:19,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:13:19,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:13:19,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:13:19,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:13:19,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:13:19,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:13:19,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:13:19,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:13:19,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:13:19,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:13:19,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:13:19,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:13:19,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:13:19,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:13:19,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:13:19,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:13:19,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:13:19,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:13:19,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:13:19,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:13:19,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:13:19,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:13:19,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:13:19,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:13:19,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:13:19,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:13:19,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:13:19,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:13:19,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:13:19,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:13:19,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:13:19,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:13:19,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:13:19,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:13:19,588 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-SemanticLbe.epf [2022-12-05 20:13:19,618 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:13:19,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:13:19,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:13:19,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:13:19,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:13:19,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:13:19,620 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:13:19,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:13:19,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:13:19,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:13:19,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:13:19,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:13:19,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:13:19,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:13:19,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:13:19,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:13:19,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:13:19,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:13:19,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:13:19,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:13:19,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:13:19,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:13:19,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:13:19,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:13:19,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:13:19,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:13:19,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:13:19,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:13:19,926 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:13:19,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-05 20:13:20,827 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:13:21,033 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:13:21,034 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-12-05 20:13:21,052 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd78fe23/31f40e201ebe4c93ad93fcc89532104b/FLAG2c7911ef2 [2022-12-05 20:13:21,065 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fd78fe23/31f40e201ebe4c93ad93fcc89532104b [2022-12-05 20:13:21,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:13:21,068 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:13:21,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:13:21,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:13:21,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:13:21,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5972903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21, skipping insertion in model container [2022-12-05 20:13:21,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:13:21,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:13:21,446 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-12-05 20:13:21,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:13:21,481 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:13:21,510 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i[41530,41543] [2022-12-05 20:13:21,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:13:21,583 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:13:21,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21 WrapperNode [2022-12-05 20:13:21,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:13:21,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:13:21,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:13:21,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:13:21,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,638 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-05 20:13:21,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:13:21,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:13:21,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:13:21,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:13:21,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:13:21,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:13:21,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:13:21,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:13:21,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (1/1) ... [2022-12-05 20:13:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:13:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:13:21,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 20:13:21,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-05 20:13:21,761 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-05 20:13:21,761 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:13:21,761 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 20:13:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:13:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:13:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:13:21,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:13:21,763 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:13:21,859 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:13:21,861 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:13:22,096 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:13:22,101 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:13:22,101 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-05 20:13:22,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:13:22 BoogieIcfgContainer [2022-12-05 20:13:22,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:13:22,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:13:22,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:13:22,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:13:22,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:13:21" (1/3) ... [2022-12-05 20:13:22,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4700f288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:13:22, skipping insertion in model container [2022-12-05 20:13:22,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:13:21" (2/3) ... [2022-12-05 20:13:22,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4700f288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:13:22, skipping insertion in model container [2022-12-05 20:13:22,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:13:22" (3/3) ... [2022-12-05 20:13:22,115 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-12-05 20:13:22,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:13:22,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:13:22,127 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:13:22,273 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 20:13:22,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-05 20:13:22,374 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-05 20:13:22,375 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 20:13:22,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-05 20:13:22,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-05 20:13:22,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-05 20:13:22,390 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:13:22,413 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-05 20:13:22,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-05 20:13:22,459 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-05 20:13:22,459 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:13:22,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-05 20:13:22,466 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-05 20:13:22,466 INFO L188 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-05 20:13:25,720 INFO L203 LiptonReduction]: Total number of compositions: 109 [2022-12-05 20:13:25,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:13:25,740 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;@219df42f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:13:25,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:13:25,743 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-05 20:13:25,743 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 20:13:25,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:25,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 20:13:25,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:25,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:25,747 INFO L85 PathProgramCache]: Analyzing trace with hash 973860878, now seen corresponding path program 1 times [2022-12-05 20:13:25,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004202049] [2022-12-05 20:13:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:25,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004202049] [2022-12-05 20:13:25,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004202049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:25,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:25,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:13:25,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404648713] [2022-12-05 20:13:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:25,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:13:25,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:13:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:13:25,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:13:25,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:25,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:25,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:13:25,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:26,158 INFO L130 PetriNetUnfolder]: 828/1410 cut-off events. [2022-12-05 20:13:26,159 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2022-12-05 20:13:26,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 1410 events. 828/1410 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5969 event pairs, 371 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 2635. Up to 880 conditions per place. [2022-12-05 20:13:26,169 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 55 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2022-12-05 20:13:26,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 253 flow [2022-12-05 20:13:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:13:26,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:13:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-05 20:13:26,179 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-05 20:13:26,180 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 89 flow. Second operand 3 states and 73 transitions. [2022-12-05 20:13:26,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 253 flow [2022-12-05 20:13:26,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 61 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:13:26,186 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 97 flow [2022-12-05 20:13:26,187 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-05 20:13:26,191 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-12-05 20:13:26,191 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 97 flow [2022-12-05 20:13:26,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:26,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:26,192 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:26,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:13:26,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:26,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1325177997, now seen corresponding path program 1 times [2022-12-05 20:13:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:26,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969286214] [2022-12-05 20:13:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:26,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969286214] [2022-12-05 20:13:26,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969286214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:26,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:26,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:13:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100084210] [2022-12-05 20:13:26,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:26,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:13:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:13:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:13:26,294 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-05 20:13:26,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:26,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:26,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-05 20:13:26,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:26,406 INFO L130 PetriNetUnfolder]: 686/1260 cut-off events. [2022-12-05 20:13:26,406 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-05 20:13:26,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1260 events. 686/1260 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6454 event pairs, 313 based on Foata normal form. 0/1024 useless extension candidates. Maximal degree in co-relation 2130. Up to 1025 conditions per place. [2022-12-05 20:13:26,411 INFO L137 encePairwiseOnDemand]: 37/40 looper letters, 48 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-05 20:13:26,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 57 transitions, 242 flow [2022-12-05 20:13:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:13:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:13:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-12-05 20:13:26,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.575 [2022-12-05 20:13:26,412 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 97 flow. Second operand 3 states and 69 transitions. [2022-12-05 20:13:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 57 transitions, 242 flow [2022-12-05 20:13:26,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:13:26,413 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2022-12-05 20:13:26,414 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2022-12-05 20:13:26,414 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-05 20:13:26,414 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2022-12-05 20:13:26,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:26,414 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:26,415 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:26,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:13:26,415 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:26,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 963601012, now seen corresponding path program 1 times [2022-12-05 20:13:26,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:26,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465100479] [2022-12-05 20:13:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:26,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:26,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465100479] [2022-12-05 20:13:26,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465100479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:13:26,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295299646] [2022-12-05 20:13:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:13:26,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:13:26,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 20:13:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:26,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-05 20:13:26,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:13:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:26,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:13:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:26,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295299646] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:13:26,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:13:26,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-05 20:13:26,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721900220] [2022-12-05 20:13:26,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:13:26,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:13:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:26,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:13:26,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:13:26,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:13:26,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:26,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:26,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:13:26,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:27,147 INFO L130 PetriNetUnfolder]: 2004/3438 cut-off events. [2022-12-05 20:13:27,147 INFO L131 PetriNetUnfolder]: For 880/880 co-relation queries the response was YES. [2022-12-05 20:13:27,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3438 events. 2004/3438 cut-off events. For 880/880 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 17981 event pairs, 302 based on Foata normal form. 88/2886 useless extension candidates. Maximal degree in co-relation 6886. Up to 999 conditions per place. [2022-12-05 20:13:27,161 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 166 selfloop transitions, 26 changer transitions 5/200 dead transitions. [2022-12-05 20:13:27,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 200 transitions, 913 flow [2022-12-05 20:13:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-05 20:13:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-05 20:13:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2022-12-05 20:13:27,163 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2022-12-05 20:13:27,163 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 12 states and 236 transitions. [2022-12-05 20:13:27,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 200 transitions, 913 flow [2022-12-05 20:13:27,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 200 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:13:27,168 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 321 flow [2022-12-05 20:13:27,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=321, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2022-12-05 20:13:27,169 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2022-12-05 20:13:27,169 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 321 flow [2022-12-05 20:13:27,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:27,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:27,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:27,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 20:13:27,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:27,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:27,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1107267027, now seen corresponding path program 1 times [2022-12-05 20:13:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:27,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419287357] [2022-12-05 20:13:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:27,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:27,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419287357] [2022-12-05 20:13:27,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419287357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:27,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:27,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:13:27,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831986660] [2022-12-05 20:13:27,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:27,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:13:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:27,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:13:27,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:13:27,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 40 [2022-12-05 20:13:27,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:27,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:27,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 40 [2022-12-05 20:13:27,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:27,586 INFO L130 PetriNetUnfolder]: 558/1135 cut-off events. [2022-12-05 20:13:27,586 INFO L131 PetriNetUnfolder]: For 558/558 co-relation queries the response was YES. [2022-12-05 20:13:27,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 1135 events. 558/1135 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5569 event pairs, 98 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 2614. Up to 758 conditions per place. [2022-12-05 20:13:27,591 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 6 changer transitions 3/63 dead transitions. [2022-12-05 20:13:27,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 358 flow [2022-12-05 20:13:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:13:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:13:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-05 20:13:27,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-05 20:13:27,593 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 321 flow. Second operand 3 states and 62 transitions. [2022-12-05 20:13:27,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 358 flow [2022-12-05 20:13:27,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 337 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-05 20:13:27,600 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 222 flow [2022-12-05 20:13:27,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-05 20:13:27,601 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-05 20:13:27,601 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 222 flow [2022-12-05 20:13:27,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:27,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:27,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:27,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:13:27,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1348456744, now seen corresponding path program 1 times [2022-12-05 20:13:27,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:27,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922805314] [2022-12-05 20:13:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:27,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:27,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:27,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922805314] [2022-12-05 20:13:27,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922805314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:27,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:27,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:13:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381426936] [2022-12-05 20:13:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:27,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:13:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:13:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:13:27,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:13:27,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:27,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:27,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:13:27,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:27,783 INFO L130 PetriNetUnfolder]: 624/1197 cut-off events. [2022-12-05 20:13:27,783 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-12-05 20:13:27,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 1197 events. 624/1197 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5266 event pairs, 391 based on Foata normal form. 24/1221 useless extension candidates. Maximal degree in co-relation 2254. Up to 849 conditions per place. [2022-12-05 20:13:27,788 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 56 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-05 20:13:27,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 389 flow [2022-12-05 20:13:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:13:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:13:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-05 20:13:27,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:13:27,789 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 222 flow. Second operand 3 states and 60 transitions. [2022-12-05 20:13:27,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 389 flow [2022-12-05 20:13:27,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:13:27,793 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 254 flow [2022-12-05 20:13:27,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-05 20:13:27,795 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2022-12-05 20:13:27,795 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 254 flow [2022-12-05 20:13:27,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:27,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:27,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:27,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:13:27,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1882915942, now seen corresponding path program 1 times [2022-12-05 20:13:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:27,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657453654] [2022-12-05 20:13:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:28,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657453654] [2022-12-05 20:13:28,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657453654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:28,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:28,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 20:13:28,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812606410] [2022-12-05 20:13:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:28,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:13:28,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:28,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:13:28,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:13:28,275 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2022-12-05 20:13:28,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 254 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:28,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:28,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2022-12-05 20:13:28,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:28,782 INFO L130 PetriNetUnfolder]: 993/2080 cut-off events. [2022-12-05 20:13:28,783 INFO L131 PetriNetUnfolder]: For 1605/1607 co-relation queries the response was YES. [2022-12-05 20:13:28,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 2080 events. 993/2080 cut-off events. For 1605/1607 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 11080 event pairs, 337 based on Foata normal form. 0/2046 useless extension candidates. Maximal degree in co-relation 3282. Up to 835 conditions per place. [2022-12-05 20:13:28,792 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 99 selfloop transitions, 13 changer transitions 15/139 dead transitions. [2022-12-05 20:13:28,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 861 flow [2022-12-05 20:13:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:13:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:13:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2022-12-05 20:13:28,795 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 20:13:28,795 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 254 flow. Second operand 9 states and 153 transitions. [2022-12-05 20:13:28,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 139 transitions, 861 flow [2022-12-05 20:13:28,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 139 transitions, 805 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-05 20:13:28,802 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 339 flow [2022-12-05 20:13:28,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=339, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2022-12-05 20:13:28,804 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2022-12-05 20:13:28,804 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 339 flow [2022-12-05 20:13:28,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:28,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:28,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:28,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:13:28,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash -913865646, now seen corresponding path program 2 times [2022-12-05 20:13:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:28,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581780693] [2022-12-05 20:13:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:29,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:29,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581780693] [2022-12-05 20:13:29,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581780693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:29,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:29,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-05 20:13:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831426468] [2022-12-05 20:13:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:29,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 20:13:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 20:13:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-05 20:13:29,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2022-12-05 20:13:29,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 339 flow. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:29,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:29,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2022-12-05 20:13:29,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:29,948 INFO L130 PetriNetUnfolder]: 1423/2979 cut-off events. [2022-12-05 20:13:29,948 INFO L131 PetriNetUnfolder]: For 2143/2147 co-relation queries the response was YES. [2022-12-05 20:13:29,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7609 conditions, 2979 events. 1423/2979 cut-off events. For 2143/2147 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 17524 event pairs, 336 based on Foata normal form. 6/2961 useless extension candidates. Maximal degree in co-relation 5681. Up to 796 conditions per place. [2022-12-05 20:13:29,963 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 100 selfloop transitions, 21 changer transitions 13/146 dead transitions. [2022-12-05 20:13:29,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 146 transitions, 939 flow [2022-12-05 20:13:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:13:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:13:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2022-12-05 20:13:29,964 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2022-12-05 20:13:29,964 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 339 flow. Second operand 9 states and 151 transitions. [2022-12-05 20:13:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 146 transitions, 939 flow [2022-12-05 20:13:29,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 146 transitions, 939 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:13:29,971 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 478 flow [2022-12-05 20:13:29,971 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=478, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2022-12-05 20:13:29,972 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places. [2022-12-05 20:13:29,972 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 478 flow [2022-12-05 20:13:29,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:29,974 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:29,975 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:29,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:13:29,975 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1306793429, now seen corresponding path program 1 times [2022-12-05 20:13:29,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367204397] [2022-12-05 20:13:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:29,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:30,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367204397] [2022-12-05 20:13:30,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367204397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:13:30,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031173578] [2022-12-05 20:13:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:30,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:30,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:13:30,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:13:30,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 20:13:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:30,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 20:13:30,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:13:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 20:13:30,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-05 20:13:30,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031173578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:30,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-05 20:13:30,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-05 20:13:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035016422] [2022-12-05 20:13:30,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:30,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:13:30,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:30,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:13:30,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:13:30,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:13:30,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:30,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:30,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:13:30,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:30,568 INFO L130 PetriNetUnfolder]: 1834/3536 cut-off events. [2022-12-05 20:13:30,568 INFO L131 PetriNetUnfolder]: For 3388/3388 co-relation queries the response was YES. [2022-12-05 20:13:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9700 conditions, 3536 events. 1834/3536 cut-off events. For 3388/3388 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 19277 event pairs, 613 based on Foata normal form. 42/3562 useless extension candidates. Maximal degree in co-relation 7396. Up to 1234 conditions per place. [2022-12-05 20:13:30,584 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 107 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2022-12-05 20:13:30,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 125 transitions, 922 flow [2022-12-05 20:13:30,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:13:30,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:13:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-05 20:13:30,585 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-05 20:13:30,585 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 478 flow. Second operand 6 states and 102 transitions. [2022-12-05 20:13:30,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 125 transitions, 922 flow [2022-12-05 20:13:30,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 125 transitions, 904 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-05 20:13:30,593 INFO L231 Difference]: Finished difference. Result has 81 places, 75 transitions, 531 flow [2022-12-05 20:13:30,593 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=81, PETRI_TRANSITIONS=75} [2022-12-05 20:13:30,594 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2022-12-05 20:13:30,594 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 75 transitions, 531 flow [2022-12-05 20:13:30,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:30,594 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:30,594 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-05 20:13:30,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 20:13:30,798 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,SelfDestructingSolverStorable7 [2022-12-05 20:13:30,799 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:30,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1220552396, now seen corresponding path program 2 times [2022-12-05 20:13:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:30,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553889840] [2022-12-05 20:13:30,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:30,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:30,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553889840] [2022-12-05 20:13:30,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553889840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:13:30,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221481914] [2022-12-05 20:13:30,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:13:30,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:30,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:13:30,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:13:30,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 20:13:30,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:13:30,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:13:30,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 20:13:30,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:13:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:31,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:13:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:13:31,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221481914] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:13:31,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:13:31,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-05 20:13:31,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139589918] [2022-12-05 20:13:31,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:13:31,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-05 20:13:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-05 20:13:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-05 20:13:31,074 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-05 20:13:31,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 75 transitions, 531 flow. Second operand has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:31,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:31,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-05 20:13:31,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:31,743 INFO L130 PetriNetUnfolder]: 2698/5171 cut-off events. [2022-12-05 20:13:31,744 INFO L131 PetriNetUnfolder]: For 7895/7895 co-relation queries the response was YES. [2022-12-05 20:13:31,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 5171 events. 2698/5171 cut-off events. For 7895/7895 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 27300 event pairs, 633 based on Foata normal form. 64/5219 useless extension candidates. Maximal degree in co-relation 9626. Up to 1536 conditions per place. [2022-12-05 20:13:31,767 INFO L137 encePairwiseOnDemand]: 34/40 looper letters, 233 selfloop transitions, 31 changer transitions 6/272 dead transitions. [2022-12-05 20:13:31,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 272 transitions, 1994 flow [2022-12-05 20:13:31,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 20:13:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 20:13:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 274 transitions. [2022-12-05 20:13:31,768 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2022-12-05 20:13:31,768 INFO L175 Difference]: Start difference. First operand has 81 places, 75 transitions, 531 flow. Second operand 17 states and 274 transitions. [2022-12-05 20:13:31,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 272 transitions, 1994 flow [2022-12-05 20:13:31,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 272 transitions, 1990 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 20:13:31,781 INFO L231 Difference]: Finished difference. Result has 101 places, 91 transitions, 769 flow [2022-12-05 20:13:31,782 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=769, PETRI_PLACES=101, PETRI_TRANSITIONS=91} [2022-12-05 20:13:31,782 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2022-12-05 20:13:31,782 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 91 transitions, 769 flow [2022-12-05 20:13:31,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:31,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:31,783 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:31,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 20:13:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:31,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:31,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 908400452, now seen corresponding path program 3 times [2022-12-05 20:13:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245338344] [2022-12-05 20:13:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 20:13:32,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:32,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245338344] [2022-12-05 20:13:32,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245338344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:13:32,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:13:32,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-05 20:13:32,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400110868] [2022-12-05 20:13:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:13:32,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-05 20:13:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:13:32,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-05 20:13:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-05 20:13:32,476 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:13:32,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 769 flow. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:32,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:13:32,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:13:32,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:13:34,142 INFO L130 PetriNetUnfolder]: 4268/8171 cut-off events. [2022-12-05 20:13:34,143 INFO L131 PetriNetUnfolder]: For 14843/14843 co-relation queries the response was YES. [2022-12-05 20:13:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25477 conditions, 8171 events. 4268/8171 cut-off events. For 14843/14843 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 48406 event pairs, 960 based on Foata normal form. 12/8152 useless extension candidates. Maximal degree in co-relation 19484. Up to 1812 conditions per place. [2022-12-05 20:13:34,189 INFO L137 encePairwiseOnDemand]: 25/40 looper letters, 184 selfloop transitions, 130 changer transitions 4/320 dead transitions. [2022-12-05 20:13:34,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 320 transitions, 2934 flow [2022-12-05 20:13:34,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-05 20:13:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-05 20:13:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 228 transitions. [2022-12-05 20:13:34,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2111111111111111 [2022-12-05 20:13:34,191 INFO L175 Difference]: Start difference. First operand has 101 places, 91 transitions, 769 flow. Second operand 27 states and 228 transitions. [2022-12-05 20:13:34,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 320 transitions, 2934 flow [2022-12-05 20:13:34,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 320 transitions, 2657 flow, removed 96 selfloop flow, removed 7 redundant places. [2022-12-05 20:13:34,220 INFO L231 Difference]: Finished difference. Result has 127 places, 187 transitions, 1787 flow [2022-12-05 20:13:34,221 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1787, PETRI_PLACES=127, PETRI_TRANSITIONS=187} [2022-12-05 20:13:34,221 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2022-12-05 20:13:34,221 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 187 transitions, 1787 flow [2022-12-05 20:13:34,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:13:34,221 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:13:34,221 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:13:34,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:13:34,222 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:13:34,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:13:34,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1998404668, now seen corresponding path program 4 times [2022-12-05 20:13:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:13:34,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167372358] [2022-12-05 20:13:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:13:34,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:13:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:13:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 20:13:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:13:34,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167372358] [2022-12-05 20:13:34,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167372358] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:13:34,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750613700] [2022-12-05 20:13:34,739 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 20:13:34,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:13:34,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:13:34,740 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:13:34,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 20:13:34,832 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 20:13:34,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:13:34,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-05 20:13:34,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:13:34,879 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-05 20:13:34,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2022-12-05 20:13:35,185 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 17 [2022-12-05 20:13:35,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-05 20:13:35,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-05 20:14:00,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:14:00,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:14:00,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_360 (Array Int Int))) (not (= (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_360) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))) is different from false [2022-12-05 20:14:00,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:14:00,603 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2022-12-05 20:14:00,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:14:00,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-12-05 20:14:00,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-05 20:14:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 20:14:00,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750613700] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:14:00,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:14:00,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 41 [2022-12-05 20:14:00,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712848936] [2022-12-05 20:14:00,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:14:00,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-05 20:14:00,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:14:00,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-05 20:14:00,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1573, Unknown=5, NotChecked=80, Total=1806 [2022-12-05 20:14:00,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:14:00,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 187 transitions, 1787 flow. Second operand has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:14:00,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:14:00,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:14:00,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:14:57,281 INFO L130 PetriNetUnfolder]: 6238/11987 cut-off events. [2022-12-05 20:14:57,281 INFO L131 PetriNetUnfolder]: For 28104/28104 co-relation queries the response was YES. [2022-12-05 20:14:57,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39286 conditions, 11987 events. 6238/11987 cut-off events. For 28104/28104 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 76343 event pairs, 885 based on Foata normal form. 76/12008 useless extension candidates. Maximal degree in co-relation 30233. Up to 2620 conditions per place. [2022-12-05 20:14:57,353 INFO L137 encePairwiseOnDemand]: 18/40 looper letters, 326 selfloop transitions, 320 changer transitions 15/663 dead transitions. [2022-12-05 20:14:57,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 663 transitions, 5855 flow [2022-12-05 20:14:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-05 20:14:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-05 20:14:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 543 transitions. [2022-12-05 20:14:57,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20261194029850746 [2022-12-05 20:14:57,357 INFO L175 Difference]: Start difference. First operand has 127 places, 187 transitions, 1787 flow. Second operand 67 states and 543 transitions. [2022-12-05 20:14:57,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 663 transitions, 5855 flow [2022-12-05 20:14:57,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 663 transitions, 5797 flow, removed 26 selfloop flow, removed 3 redundant places. [2022-12-05 20:14:57,436 INFO L231 Difference]: Finished difference. Result has 206 places, 368 transitions, 4222 flow [2022-12-05 20:14:57,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=4222, PETRI_PLACES=206, PETRI_TRANSITIONS=368} [2022-12-05 20:14:57,437 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2022-12-05 20:14:57,437 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 368 transitions, 4222 flow [2022-12-05 20:14:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:14:57,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:14:57,438 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:14:57,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 20:14:57,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:14:57,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:14:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:14:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1499841492, now seen corresponding path program 1 times [2022-12-05 20:14:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:14:57,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638050193] [2022-12-05 20:14:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:14:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:14:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:14:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:14:58,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:14:58,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638050193] [2022-12-05 20:14:58,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638050193] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:14:58,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279593215] [2022-12-05 20:14:58,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:14:58,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:14:58,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:14:58,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:14:58,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 20:14:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:14:58,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-05 20:14:58,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:14:58,743 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 17 [2022-12-05 20:14:59,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 20:14:59,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 43 [2022-12-05 20:14:59,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-05 20:15:01,664 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_div_v_arrayElimCell_10_58 Int) (aux_mod_v_arrayElimCell_10_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_10_58 4294967296))) (and (<= 4294966496 aux_mod_v_arrayElimCell_10_58) (<= (+ aux_mod_v_arrayElimCell_10_58 4294967297 .cse0) 0) (= (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_10_58)) 4294967296) |c_t2Thread1of1ForFork0_pop_#res#1|) (< aux_mod_v_arrayElimCell_10_58 4294967296) (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_10_58 .cse0))))) is different from true [2022-12-05 20:15:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-05 20:15:01,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:15:02,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-05 20:15:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:15:02,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279593215] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:15:02,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:15:02,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2022-12-05 20:15:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768610374] [2022-12-05 20:15:02,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:15:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-05 20:15:02,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:15:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-05 20:15:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2391, Unknown=1, NotChecked=98, Total=2652 [2022-12-05 20:15:02,651 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:15:02,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 368 transitions, 4222 flow. Second operand has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:15:02,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:15:02,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:15:02,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:16:34,628 INFO L130 PetriNetUnfolder]: 11361/21941 cut-off events. [2022-12-05 20:16:34,628 INFO L131 PetriNetUnfolder]: For 201228/201228 co-relation queries the response was YES. [2022-12-05 20:16:34,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121570 conditions, 21941 events. 11361/21941 cut-off events. For 201228/201228 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 162067 event pairs, 1622 based on Foata normal form. 22/21850 useless extension candidates. Maximal degree in co-relation 103833. Up to 7957 conditions per place. [2022-12-05 20:16:34,829 INFO L137 encePairwiseOnDemand]: 20/40 looper letters, 620 selfloop transitions, 601 changer transitions 16/1239 dead transitions. [2022-12-05 20:16:34,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 1239 transitions, 15202 flow [2022-12-05 20:16:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-12-05 20:16:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2022-12-05 20:16:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 812 transitions. [2022-12-05 20:16:34,838 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.200990099009901 [2022-12-05 20:16:34,838 INFO L175 Difference]: Start difference. First operand has 206 places, 368 transitions, 4222 flow. Second operand 101 states and 812 transitions. [2022-12-05 20:16:34,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 1239 transitions, 15202 flow [2022-12-05 20:16:35,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 1239 transitions, 14212 flow, removed 296 selfloop flow, removed 9 redundant places. [2022-12-05 20:16:35,211 INFO L231 Difference]: Finished difference. Result has 309 places, 696 transitions, 8477 flow [2022-12-05 20:16:35,211 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3691, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=101, PETRI_FLOW=8477, PETRI_PLACES=309, PETRI_TRANSITIONS=696} [2022-12-05 20:16:35,212 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 267 predicate places. [2022-12-05 20:16:35,212 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 696 transitions, 8477 flow [2022-12-05 20:16:35,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:16:35,212 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:16:35,212 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:16:35,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-05 20:16:35,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-05 20:16:35,417 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:16:35,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:16:35,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1907527434, now seen corresponding path program 2 times [2022-12-05 20:16:35,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:16:35,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407191454] [2022-12-05 20:16:35,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:16:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:16:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:16:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:16:37,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:16:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407191454] [2022-12-05 20:16:37,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407191454] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:16:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467107851] [2022-12-05 20:16:37,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:16:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:16:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:16:37,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:16:37,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 20:16:37,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:16:37,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:16:37,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-05 20:16:37,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:16:37,665 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 20:16:37,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-05 20:16:37,904 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 17 [2022-12-05 20:16:38,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-12-05 20:16:38,380 INFO L321 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2022-12-05 20:16:38,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2022-12-05 20:16:39,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-05 20:16:41,162 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_16_58 Int) (aux_div_v_arrayElimCell_16_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_16_58 4294967296))) (and (< 0 (+ 8589934593 aux_mod_v_arrayElimCell_16_58 .cse0)) (< aux_mod_v_arrayElimCell_16_58 4294967296) (<= (+ aux_mod_v_arrayElimCell_16_58 4294967297 .cse0) 0) (<= 4294966496 aux_mod_v_arrayElimCell_16_58) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ 4294967295 (* 4294967295 aux_mod_v_arrayElimCell_16_58)) 4294967296))))) is different from true [2022-12-05 20:16:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-05 20:16:41,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:16:42,117 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_497) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-05 20:16:42,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:16:42,124 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2022-12-05 20:16:42,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:16:42,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-12-05 20:16:42,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2022-12-05 20:16:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-05 20:16:42,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467107851] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:16:42,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:16:42,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 55 [2022-12-05 20:16:42,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822422830] [2022-12-05 20:16:42,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:16:42,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-05 20:16:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:16:42,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-05 20:16:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2679, Unknown=6, NotChecked=214, Total=3192 [2022-12-05 20:16:42,352 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:16:42,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 696 transitions, 8477 flow. Second operand has 57 states, 57 states have (on average 3.8947368421052633) internal successors, (222), 57 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:16:42,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:16:42,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:16:42,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:18:35,646 WARN L233 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 170 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:22:14,347 INFO L130 PetriNetUnfolder]: 56104/115860 cut-off events. [2022-12-05 20:22:14,347 INFO L131 PetriNetUnfolder]: For 1692397/1692397 co-relation queries the response was YES. [2022-12-05 20:22:15,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781467 conditions, 115860 events. 56104/115860 cut-off events. For 1692397/1692397 co-relation queries the response was YES. Maximal size of possible extension queue 2136. Compared 1182342 event pairs, 7770 based on Foata normal form. 422/115675 useless extension candidates. Maximal degree in co-relation 707929. Up to 38217 conditions per place. [2022-12-05 20:22:16,651 INFO L137 encePairwiseOnDemand]: 15/40 looper letters, 2272 selfloop transitions, 5119 changer transitions 420/7813 dead transitions. [2022-12-05 20:22:16,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 7813 transitions, 111186 flow [2022-12-05 20:22:16,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 423 states. [2022-12-05 20:22:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2022-12-05 20:22:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 3355 transitions. [2022-12-05 20:22:16,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19828605200945626 [2022-12-05 20:22:16,659 INFO L175 Difference]: Start difference. First operand has 309 places, 696 transitions, 8477 flow. Second operand 423 states and 3355 transitions. [2022-12-05 20:22:16,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 7813 transitions, 111186 flow [2022-12-05 20:22:25,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 7813 transitions, 103922 flow, removed 548 selfloop flow, removed 14 redundant places. [2022-12-05 20:22:25,597 INFO L231 Difference]: Finished difference. Result has 871 places, 5830 transitions, 82234 flow [2022-12-05 20:22:25,598 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7637, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=558, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=423, PETRI_FLOW=82234, PETRI_PLACES=871, PETRI_TRANSITIONS=5830} [2022-12-05 20:22:25,598 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 829 predicate places. [2022-12-05 20:22:25,598 INFO L495 AbstractCegarLoop]: Abstraction has has 871 places, 5830 transitions, 82234 flow [2022-12-05 20:22:25,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.8947368421052633) internal successors, (222), 57 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:25,598 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:25,598 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:25,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 20:22:25,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:22:25,805 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1433783824, now seen corresponding path program 3 times [2022-12-05 20:22:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:25,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433016475] [2022-12-05 20:22:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:22:26,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433016475] [2022-12-05 20:22:26,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433016475] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:22:26,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525927812] [2022-12-05 20:22:26,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 20:22:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:22:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:22:26,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 20:22:26,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 20:22:27,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-05 20:22:27,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:22:27,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 81 conjunts are in the unsatisfiable core [2022-12-05 20:22:27,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:22:27,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 20:22:27,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-05 20:22:27,345 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 17 [2022-12-05 20:22:27,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-12-05 20:22:27,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 20:22:27,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-12-05 20:22:28,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 46 [2022-12-05 20:22:30,660 WARN L859 $PredicateComparison]: unable to prove that (exists ((aux_mod_v_arrayElimCell_24_58 Int) (aux_div_v_arrayElimCell_24_58 Int)) (let ((.cse0 (* aux_div_v_arrayElimCell_24_58 4294967296))) (and (< 0 (+ .cse0 8589934593 aux_mod_v_arrayElimCell_24_58)) (= |c_t2Thread1of1ForFork0_pop_#res#1| (mod (+ (* 4294967295 aux_mod_v_arrayElimCell_24_58) 4294967295) 4294967296)) (< aux_mod_v_arrayElimCell_24_58 4294967296) (<= (+ .cse0 aux_mod_v_arrayElimCell_24_58 4294967297) 0) (<= 4294966496 aux_mod_v_arrayElimCell_24_58)))) is different from true [2022-12-05 20:22:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-05 20:22:30,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:22:31,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (|v_t1Thread1of1ForFork1_get_top_#res#1_65| Int) (v_ArrVal_568 Int)) (or (not (<= c_~top~0 |v_t1Thread1of1ForFork1_get_top_#res#1_65|)) (not (= 4294967294 (mod (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_567))) (store .cse0 |c_t1Thread1of1ForFork1_push_~stack#1.base| (store (select .cse0 |c_t1Thread1of1ForFork1_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork1_push_~stack#1.offset| (* |v_t1Thread1of1ForFork1_get_top_#res#1_65| 4)) v_ArrVal_568))) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) is different from false [2022-12-05 20:22:31,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_85| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_65| Int) (v_ArrVal_568 Int)) (or (not (= 4294967294 (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_567) |c_~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_65| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_85|) v_ArrVal_568) (+ (* |c_t1Thread1of1ForFork1_inc_top_#t~post31#1| 4) |c_~#arr~0.offset|)) 4294967296))) (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_85| |c_~#arr~0.offset|) (not (<= (+ |c_t1Thread1of1ForFork1_inc_top_#t~post31#1| 1) |v_t1Thread1of1ForFork1_get_top_#res#1_65|)))) is different from false [2022-12-05 20:22:31,553 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (|v_t1Thread1of1ForFork1_push_~stack#1.offset_85| Int) (|v_t1Thread1of1ForFork1_get_top_#res#1_65| Int) (v_ArrVal_568 Int)) (or (< |v_t1Thread1of1ForFork1_push_~stack#1.offset_85| |c_~#arr~0.offset|) (not (= (mod (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_567) |c_~#arr~0.base|) (+ (* |v_t1Thread1of1ForFork1_get_top_#res#1_65| 4) |v_t1Thread1of1ForFork1_push_~stack#1.offset_85|) v_ArrVal_568) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (not (<= (+ c_~top~0 1) |v_t1Thread1of1ForFork1_get_top_#res#1_65|)))) is different from false [2022-12-05 20:22:31,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:22:31,565 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 37 [2022-12-05 20:22:31,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:22:31,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-12-05 20:22:31,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 20:22:31,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-12-05 20:22:31,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2022-12-05 20:22:31,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 20:22:31,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 20:22:31,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2022-12-05 20:22:33,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-05 20:22:33,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525927812] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:22:33,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:22:33,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 62 [2022-12-05 20:22:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745025418] [2022-12-05 20:22:33,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:22:33,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-12-05 20:22:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:33,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-12-05 20:22:33,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3260, Unknown=14, NotChecked=476, Total=4032 [2022-12-05 20:22:33,817 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-05 20:22:33,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 871 places, 5830 transitions, 82234 flow. Second operand has 64 states, 64 states have (on average 3.6875) internal successors, (236), 64 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:33,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:33,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-05 20:22:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:23:52,467 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 75 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:24:00,884 WARN L233 SmtUtils]: Spent 7.94s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:24:09,404 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 110 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:24:24,066 WARN L233 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:24:33,030 WARN L233 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 92 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:24:56,686 WARN L233 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 102 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:25:42,785 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 120 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:26:26,998 WARN L233 SmtUtils]: Spent 6.56s on a formula simplification. DAG size of input: 89 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:26:44,804 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 82 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-05 20:27:18,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 20:27:18,467 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 20:27:19,243 WARN L249 SmtUtils]: Removed 5 from assertion stack [2022-12-05 20:27:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2022-12-05 20:27:19,244 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:27:19,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-05 20:27:19,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:27:19,445 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 4069ms.. [2022-12-05 20:27:19,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-05 20:27:19,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:27:19,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-05 20:27:19,446 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-05 20:27:19,447 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:27:19,447 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1] [2022-12-05 20:27:19,450 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:27:19,450 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:27:19,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:27:19 BasicIcfg [2022-12-05 20:27:19,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:27:19,452 INFO L158 Benchmark]: Toolchain (without parser) took 838384.64ms. Allocated memory was 173.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 138.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-05 20:27:19,452 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.0MB in the beginning and 105.0MB in the end (delta: 74.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:27:19,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.46ms. Allocated memory is still 173.0MB. Free memory was 138.4MB in the beginning and 132.7MB in the end (delta: 5.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.66ms. Allocated memory is still 173.0MB. Free memory was 132.2MB in the beginning and 129.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,453 INFO L158 Benchmark]: Boogie Preprocessor took 39.02ms. Allocated memory is still 173.0MB. Free memory was 129.6MB in the beginning and 128.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,453 INFO L158 Benchmark]: RCFGBuilder took 424.49ms. Allocated memory is still 173.0MB. Free memory was 128.0MB in the beginning and 145.1MB in the end (delta: -17.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. [2022-12-05 20:27:19,453 INFO L158 Benchmark]: TraceAbstraction took 837347.91ms. Allocated memory was 173.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 144.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-05 20:27:19,454 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.12ms. Allocated memory is still 127.9MB. Free memory was 105.0MB in the beginning and 105.0MB in the end (delta: 74.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.46ms. Allocated memory is still 173.0MB. Free memory was 138.4MB in the beginning and 132.7MB in the end (delta: 5.8MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.66ms. Allocated memory is still 173.0MB. Free memory was 132.2MB in the beginning and 129.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.02ms. Allocated memory is still 173.0MB. Free memory was 129.6MB in the beginning and 128.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 424.49ms. Allocated memory is still 173.0MB. Free memory was 128.0MB in the beginning and 145.1MB in the end (delta: -17.1MB). Peak memory consumption was 15.3MB. Max. memory is 8.0GB. * TraceAbstraction took 837347.91ms. Allocated memory was 173.0MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 144.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 136 PlacesBefore, 42 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 6382 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 76 ConcurrentYvCompositions, 5 ChoiceCompositions, 109 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 5111, independent unconditional: 0, dependent: 87, dependent conditional: 87, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 0, independent unconditional: 5111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 0, independent unconditional: 5111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5198, independent: 5111, independent conditional: 0, independent unconditional: 5111, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4190, independent: 4131, independent conditional: 0, independent unconditional: 4131, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4190, independent: 4115, independent conditional: 0, independent unconditional: 4115, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5198, independent: 980, independent conditional: 0, independent unconditional: 980, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 4190, unknown conditional: 0, unknown unconditional: 4190] , Statistics on independence cache: Total cache size (in pairs): 7645, Positive cache size: 7586, Positive conditional cache size: 0, Positive unconditional cache size: 7586, Negative cache size: 59, Negative conditional cache size: 0, Negative unconditional cache size: 59, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 4069ms.. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 4069ms.. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 4069ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 71 for 4069ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 234 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 837.2s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 782.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 331 mSolverCounterUnknown, 9205 SdHoareTripleChecker+Valid, 53.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9205 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 49.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2385 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 812 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36380 IncrementalHoareTripleChecker+Invalid, 39908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 812 mSolverCounterUnsat, 4 mSDtfsCounter, 36380 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1389 GetRequests, 252 SyntacticMatches, 49 SemanticMatches, 1087 ConstructedPredicates, 8 IntricatePredicates, 13 DeprecatedPredicates, 130560 ImplicationChecksByTransitivity, 709.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82234occurred in iteration=13, InterpolantAutomatonStates: 683, 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.6s SatisfiabilityAnalysisTime, 47.9s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 668 ConstructedInterpolants, 23 QuantifiedInterpolants, 14771 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1888 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 30/268 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