/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 22:16:38,402 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 22:16:38,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 22:16:38,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 22:16:38,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 22:16:38,452 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 22:16:38,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 22:16:38,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 22:16:38,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 22:16:38,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 22:16:38,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 22:16:38,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 22:16:38,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 22:16:38,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 22:16:38,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 22:16:38,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 22:16:38,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 22:16:38,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 22:16:38,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 22:16:38,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 22:16:38,467 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 22:16:38,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 22:16:38,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 22:16:38,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 22:16:38,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 22:16:38,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 22:16:38,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 22:16:38,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 22:16:38,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 22:16:38,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 22:16:38,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 22:16:38,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 22:16:38,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 22:16:38,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 22:16:38,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 22:16:38,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 22:16:38,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 22:16:38,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 22:16:38,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 22:16:38,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 22:16:38,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 22:16:38,484 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 22:16:38,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 22:16:38,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 22:16:38,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 22:16:38,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 22:16:38,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 22:16:38,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 22:16:38,517 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 22:16:38,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 22:16:38,518 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 22:16:38,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 22:16:38,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 22:16:38,519 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 22:16:38,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 22:16:38,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 22:16:38,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 22:16:38,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 22:16:38,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 22:16:38,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:16:38,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 22:16:38,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 22:16:38,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 22:16:38,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 22:16:38,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 22:16:38,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 22:16:38,887 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 22:16:38,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-11 22:16:39,967 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 22:16:40,159 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 22:16:40,160 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-11 22:16:40,169 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681a83754/9e4ac218287b4310a2b6ff894b6e5791/FLAG1cf889a17 [2022-12-11 22:16:40,191 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/681a83754/9e4ac218287b4310a2b6ff894b6e5791 [2022-12-11 22:16:40,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 22:16:40,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 22:16:40,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 22:16:40,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 22:16:40,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 22:16:40,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a86f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40, skipping insertion in model container [2022-12-11 22:16:40,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 22:16:40,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 22:16:40,330 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-11 22:16:40,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:16:40,383 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 22:16:40,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:16:40,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:16:40,418 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2924,2937] [2022-12-11 22:16:40,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:16:40,437 INFO L208 MainTranslator]: Completed translation [2022-12-11 22:16:40,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40 WrapperNode [2022-12-11 22:16:40,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 22:16:40,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 22:16:40,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 22:16:40,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 22:16:40,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,497 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-11 22:16:40,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 22:16:40,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 22:16:40,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 22:16:40,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 22:16:40,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,529 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 22:16:40,537 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 22:16:40,537 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 22:16:40,537 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 22:16:40,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (1/1) ... [2022-12-11 22:16:40,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:16:40,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:16:40,580 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-11 22:16:40,611 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-11 22:16:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 22:16:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 22:16:40,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 22:16:40,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 22:16:40,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 22:16:40,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 22:16:40,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 22:16:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 22:16:40,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 22:16:40,629 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 22:16:40,757 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 22:16:40,758 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 22:16:41,095 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 22:16:41,204 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 22:16:41,204 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-11 22:16:41,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:16:41 BoogieIcfgContainer [2022-12-11 22:16:41,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 22:16:41,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 22:16:41,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 22:16:41,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 22:16:41,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 10:16:40" (1/3) ... [2022-12-11 22:16:41,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384019d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:16:41, skipping insertion in model container [2022-12-11 22:16:41,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:16:40" (2/3) ... [2022-12-11 22:16:41,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384019d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:16:41, skipping insertion in model container [2022-12-11 22:16:41,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:16:41" (3/3) ... [2022-12-11 22:16:41,216 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-11 22:16:41,231 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 22:16:41,232 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 22:16:41,232 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 22:16:41,298 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 22:16:41,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-11 22:16:41,429 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-11 22:16:41,430 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 22:16:41,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-11 22:16:41,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-11 22:16:41,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-11 22:16:41,460 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 22:16:41,466 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;@6206adb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 22:16:41,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-11 22:16:41,518 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2022-12-11 22:16:41,519 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 22:16:41,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:16:41,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:16:41,520 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:16:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:16:41,524 INFO L85 PathProgramCache]: Analyzing trace with hash 398714232, now seen corresponding path program 1 times [2022-12-11 22:16:41,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:16:41,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076415929] [2022-12-11 22:16:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:16:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:42,268 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-11 22:16:42,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:16:42,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076415929] [2022-12-11 22:16:42,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076415929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:16:42,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:16:42,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 22:16:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145336864] [2022-12-11 22:16:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:16:42,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 22:16:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:16:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 22:16:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 22:16:42,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 173 [2022-12-11 22:16:42,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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-11 22:16:42,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:16:42,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 173 [2022-12-11 22:16:42,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:16:42,574 INFO L130 PetriNetUnfolder]: 24/231 cut-off events. [2022-12-11 22:16:42,574 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-12-11 22:16:42,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 231 events. 24/231 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 425 event pairs, 11 based on Foata normal form. 12/217 useless extension candidates. Maximal degree in co-relation 206. Up to 68 conditions per place. [2022-12-11 22:16:42,577 INFO L137 encePairwiseOnDemand]: 153/173 looper letters, 55 selfloop transitions, 6 changer transitions 11/162 dead transitions. [2022-12-11 22:16:42,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 162 transitions, 480 flow [2022-12-11 22:16:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 22:16:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 22:16:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2022-12-11 22:16:42,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6268464996788696 [2022-12-11 22:16:42,608 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 8 predicate places. [2022-12-11 22:16:42,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 480 flow [2022-12-11 22:16:42,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 151 transitions, 436 flow [2022-12-11 22:16:42,632 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 436 flow [2022-12-11 22:16:42,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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-11 22:16:42,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:16:42,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:16:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 22:16:42,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:16:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:16:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash 52056631, now seen corresponding path program 1 times [2022-12-11 22:16:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:16:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845445033] [2022-12-11 22:16:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:16:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:16:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:16:42,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845445033] [2022-12-11 22:16:42,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845445033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:16:42,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878071125] [2022-12-11 22:16:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:42,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:16:42,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:16:42,952 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-11 22:16:42,976 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-11 22:16:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:43,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 22:16:43,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:16:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:16:43,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:16:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:16:43,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878071125] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 22:16:43,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 22:16:43,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2022-12-11 22:16:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921329067] [2022-12-11 22:16:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:16:43,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 22:16:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:16:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 22:16:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-12-11 22:16:43,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 173 [2022-12-11 22:16:43,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 436 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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-11 22:16:43,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:16:43,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 173 [2022-12-11 22:16:43,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:16:43,909 INFO L130 PetriNetUnfolder]: 56/314 cut-off events. [2022-12-11 22:16:43,909 INFO L131 PetriNetUnfolder]: For 108/134 co-relation queries the response was YES. [2022-12-11 22:16:43,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 314 events. 56/314 cut-off events. For 108/134 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 983 event pairs, 17 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 364. Up to 104 conditions per place. [2022-12-11 22:16:43,917 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 48 selfloop transitions, 10 changer transitions 0/164 dead transitions. [2022-12-11 22:16:43,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 606 flow [2022-12-11 22:16:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 22:16:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 22:16:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1266 transitions. [2022-12-11 22:16:43,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7317919075144509 [2022-12-11 22:16:43,925 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 8 predicate places. [2022-12-11 22:16:43,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 164 transitions, 606 flow [2022-12-11 22:16:43,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 164 transitions, 606 flow [2022-12-11 22:16:43,929 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 164 transitions, 606 flow [2022-12-11 22:16:43,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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-11 22:16:43,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:16:43,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:16:43,942 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-11 22:16:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:16:44,137 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:16:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:16:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash -704392031, now seen corresponding path program 1 times [2022-12-11 22:16:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:16:44,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909093919] [2022-12-11 22:16:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:16:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:16:44,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:16:44,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909093919] [2022-12-11 22:16:44,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909093919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:16:44,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:16:44,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 22:16:44,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470935274] [2022-12-11 22:16:44,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:16:44,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 22:16:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:16:44,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 22:16:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-11 22:16:44,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2022-12-11 22:16:44,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 164 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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-11 22:16:44,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:16:44,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2022-12-11 22:16:44,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:16:44,523 INFO L130 PetriNetUnfolder]: 87/418 cut-off events. [2022-12-11 22:16:44,524 INFO L131 PetriNetUnfolder]: For 322/361 co-relation queries the response was YES. [2022-12-11 22:16:44,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 418 events. 87/418 cut-off events. For 322/361 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1610 event pairs, 24 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 606. Up to 145 conditions per place. [2022-12-11 22:16:44,529 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 47 selfloop transitions, 2 changer transitions 4/177 dead transitions. [2022-12-11 22:16:44,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 786 flow [2022-12-11 22:16:44,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 22:16:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 22:16:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-12-11 22:16:44,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7560693641618497 [2022-12-11 22:16:44,532 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 12 predicate places. [2022-12-11 22:16:44,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 177 transitions, 786 flow [2022-12-11 22:16:44,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 173 transitions, 757 flow [2022-12-11 22:16:44,537 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 173 transitions, 757 flow [2022-12-11 22:16:44,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 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-11 22:16:44,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:16:44,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:16:44,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 22:16:44,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:16:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:16:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash -83941999, now seen corresponding path program 1 times [2022-12-11 22:16:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:16:44,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739508326] [2022-12-11 22:16:44,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:16:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:16:44,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:16:44,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739508326] [2022-12-11 22:16:44,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739508326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:16:44,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:16:44,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 22:16:44,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507636049] [2022-12-11 22:16:44,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:16:44,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 22:16:44,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:16:44,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 22:16:44,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 22:16:44,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2022-12-11 22:16:44,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 173 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-11 22:16:44,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:16:44,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2022-12-11 22:16:44,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:16:44,847 INFO L130 PetriNetUnfolder]: 85/431 cut-off events. [2022-12-11 22:16:44,847 INFO L131 PetriNetUnfolder]: For 673/734 co-relation queries the response was YES. [2022-12-11 22:16:44,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 431 events. 85/431 cut-off events. For 673/734 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1709 event pairs, 17 based on Foata normal form. 9/393 useless extension candidates. Maximal degree in co-relation 727. Up to 151 conditions per place. [2022-12-11 22:16:44,851 INFO L137 encePairwiseOnDemand]: 170/173 looper letters, 36 selfloop transitions, 3 changer transitions 1/182 dead transitions. [2022-12-11 22:16:44,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 915 flow [2022-12-11 22:16:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 22:16:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 22:16:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2022-12-11 22:16:44,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8978805394990366 [2022-12-11 22:16:44,853 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 12 predicate places. [2022-12-11 22:16:44,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 182 transitions, 915 flow [2022-12-11 22:16:44,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 181 transitions, 902 flow [2022-12-11 22:16:44,856 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 181 transitions, 902 flow [2022-12-11 22:16:44,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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-11 22:16:44,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:16:44,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:16:44,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 22:16:44,857 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:16:44,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:16:44,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1460966362, now seen corresponding path program 1 times [2022-12-11 22:16:44,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:16:44,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047491456] [2022-12-11 22:16:44,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:44,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:16:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:45,009 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-11 22:16:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:16:45,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047491456] [2022-12-11 22:16:45,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047491456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:16:45,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:16:45,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:16:45,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540164507] [2022-12-11 22:16:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:16:45,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:16:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:16:45,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:16:45,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:16:45,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 173 [2022-12-11 22:16:45,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 181 transitions, 902 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 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-11 22:16:45,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:16:45,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 173 [2022-12-11 22:16:45,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:16:45,183 INFO L130 PetriNetUnfolder]: 96/560 cut-off events. [2022-12-11 22:16:45,183 INFO L131 PetriNetUnfolder]: For 1207/1314 co-relation queries the response was YES. [2022-12-11 22:16:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 560 events. 96/560 cut-off events. For 1207/1314 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2296 event pairs, 20 based on Foata normal form. 6/509 useless extension candidates. Maximal degree in co-relation 764. Up to 194 conditions per place. [2022-12-11 22:16:45,186 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 52 selfloop transitions, 8 changer transitions 23/208 dead transitions. [2022-12-11 22:16:45,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 208 transitions, 1270 flow [2022-12-11 22:16:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 22:16:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 22:16:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1215 transitions. [2022-12-11 22:16:45,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7803468208092486 [2022-12-11 22:16:45,190 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 20 predicate places. [2022-12-11 22:16:45,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 208 transitions, 1270 flow [2022-12-11 22:16:45,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 185 transitions, 1046 flow [2022-12-11 22:16:45,193 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 1046 flow [2022-12-11 22:16:45,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 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-11 22:16:45,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:16:45,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:16:45,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 22:16:45,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:16:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:16:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1706812709, now seen corresponding path program 1 times [2022-12-11 22:16:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:16:45,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305763399] [2022-12-11 22:16:45,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:45,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:16:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:16:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:16:47,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305763399] [2022-12-11 22:16:47,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305763399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:16:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680407542] [2022-12-11 22:16:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:16:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:16:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:16:47,084 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-11 22:16:47,110 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-11 22:16:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:16:47,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-11 22:16:47,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:16:47,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 22:16:47,254 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-11 22:16:47,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-11 22:16:47,561 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-11 22:16:47,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-12-11 22:16:47,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-11 22:16:48,492 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-11 22:16:48,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-11 22:16:48,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 22:16:48,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 22:16:49,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 22:16:49,552 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-11 22:16:49,553 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 42 treesize of output 10 [2022-12-11 22:16:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:16:49,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:16:53,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:16:53,321 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 126 treesize of output 90 [2022-12-11 22:16:53,375 INFO L321 Elim1Store]: treesize reduction 9, result has 82.4 percent of original size [2022-12-11 22:16:53,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6892 treesize of output 6421 [2022-12-11 22:16:53,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:16:53,473 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:16:53,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 6380 treesize of output 5644 [2022-12-11 22:16:53,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:16:53,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:16:53,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 5612 treesize of output 4108 [2022-12-11 22:16:53,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:16:53,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:16:53,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 4076 treesize of output 3724 [2022-12-11 22:17:02,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:17:02,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680407542] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:17:02,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:17:02,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 31] total 78 [2022-12-11 22:17:02,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706706415] [2022-12-11 22:17:02,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:17:02,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-11 22:17:02,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:17:02,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-11 22:17:02,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=4951, Unknown=87, NotChecked=0, Total=6006 [2022-12-11 22:17:02,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 173 [2022-12-11 22:17:02,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 185 transitions, 1046 flow. Second operand has 78 states, 78 states have (on average 43.62820512820513) internal successors, (3403), 78 states have internal predecessors, (3403), 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-11 22:17:02,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:17:02,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 173 [2022-12-11 22:17:02,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:18:33,765 WARN L233 SmtUtils]: Spent 1.51m on a formula simplification. DAG size of input: 239 DAG size of output: 217 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:19:50,062 WARN L233 SmtUtils]: Spent 1.27m on a formula simplification. DAG size of input: 207 DAG size of output: 197 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:20:24,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:20:30,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:20:38,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:20:40,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:20:42,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:20:44,414 INFO L130 PetriNetUnfolder]: 3589/7238 cut-off events. [2022-12-11 22:20:44,415 INFO L131 PetriNetUnfolder]: For 15728/15766 co-relation queries the response was YES. [2022-12-11 22:20:44,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22251 conditions, 7238 events. 3589/7238 cut-off events. For 15728/15766 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 57896 event pairs, 146 based on Foata normal form. 3/6432 useless extension candidates. Maximal degree in co-relation 14524. Up to 1884 conditions per place. [2022-12-11 22:20:44,465 INFO L137 encePairwiseOnDemand]: 121/173 looper letters, 622 selfloop transitions, 273 changer transitions 175/1105 dead transitions. [2022-12-11 22:20:44,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1105 transitions, 8817 flow [2022-12-11 22:20:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-12-11 22:20:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2022-12-11 22:20:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 5796 transitions. [2022-12-11 22:20:44,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2723812209220358 [2022-12-11 22:20:44,482 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 140 predicate places. [2022-12-11 22:20:44,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 1105 transitions, 8817 flow [2022-12-11 22:20:44,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 266 places, 930 transitions, 7619 flow [2022-12-11 22:20:44,515 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 930 transitions, 7619 flow [2022-12-11 22:20:44,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 43.62820512820513) internal successors, (3403), 78 states have internal predecessors, (3403), 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-11 22:20:44,516 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:20:44,516 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 22:20:44,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-11 22:20:44,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-11 22:20:44,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 22:20:44,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:20:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 600958245, now seen corresponding path program 2 times [2022-12-11 22:20:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:20:44,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843358170] [2022-12-11 22:20:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:20:44,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:20:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:20:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:20:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:20:46,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843358170] [2022-12-11 22:20:46,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843358170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:20:46,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522236601] [2022-12-11 22:20:46,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:20:46,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:20:46,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:20:46,600 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-11 22:20:46,627 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-11 22:20:46,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:20:46,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:20:46,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-11 22:20:46,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:20:47,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 22:20:47,437 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 15 treesize of output 11 [2022-12-11 22:20:48,051 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:20:48,051 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 11 treesize of output 11 [2022-12-11 22:20:48,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 22:20:48,585 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 6 treesize of output 5 [2022-12-11 22:20:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:20:53,067 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-11 22:20:53,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-11 22:20:53,076 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 27 treesize of output 15 [2022-12-11 22:20:53,395 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 23 treesize of output 7 [2022-12-11 22:20:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:20:53,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:20:53,934 WARN L837 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_160 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1))) (not (= (mod c_~ok~0 256) 0))) (< c_~start~0 0) (<= c_~n~0 c_~start~0)) is different from false [2022-12-11 22:20:57,273 WARN L837 $PredicateComparison]: unable to prove that (or (and (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse0 (select (select .cse1 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= .cse0 (select (select .cse1 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)))))))) (not (= (mod c_~ok~0 256) 0))) (< c_~start~0 0) (<= c_~n~0 c_~start~0)) is different from false [2022-12-11 22:20:57,368 WARN L837 $PredicateComparison]: unable to prove that (or (< c_~start~0 0) (and (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse0 (select (select .cse1 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) (+ (* c_~start~0 4) c_~queue~0.offset)) 1)) (not (= (select (select .cse1 c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0))))))) (<= c_~n~0 c_~start~0)) is different from false [2022-12-11 22:20:59,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:20:59,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 117 treesize of output 81 [2022-12-11 22:20:59,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:20:59,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3964 treesize of output 3566 [2022-12-11 22:20:59,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:20:59,193 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 3516 treesize of output 2888 [2022-12-11 22:20:59,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:20:59,242 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 2844 treesize of output 2552 [2022-12-11 22:20:59,276 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 2294 treesize of output 1910 [2022-12-11 22:21:07,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:21:07,561 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 39 treesize of output 44 [2022-12-11 22:21:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-11 22:21:08,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522236601] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:21:08,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:21:08,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 82 [2022-12-11 22:21:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795307119] [2022-12-11 22:21:08,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:21:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-12-11 22:21:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:21:08,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-12-11 22:21:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=5607, Unknown=25, NotChecked=468, Total=6642 [2022-12-11 22:21:08,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 173 [2022-12-11 22:21:08,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 930 transitions, 7619 flow. Second operand has 82 states, 82 states have (on average 42.53658536585366) internal successors, (3488), 82 states have internal predecessors, (3488), 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-11 22:21:08,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:21:08,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 173 [2022-12-11 22:21:08,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:21:19,312 WARN L233 SmtUtils]: Spent 11.03s on a formula simplification. DAG size of input: 194 DAG size of output: 184 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:21:26,273 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 179 DAG size of output: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:21:51,010 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 113 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:22:11,438 WARN L233 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 117 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:22:18,663 WARN L233 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 133 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:22:25,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:22:28,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:22:30,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:22:33,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-11 22:22:43,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:22:50,604 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 229 DAG size of output: 201 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:23:19,477 WARN L233 SmtUtils]: Spent 28.58s on a formula simplification. DAG size of input: 227 DAG size of output: 205 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:23:22,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-11 22:23:36,344 WARN L233 SmtUtils]: Spent 13.27s on a formula simplification. DAG size of input: 215 DAG size of output: 197 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:23:48,034 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 222 DAG size of output: 203 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:23:56,271 WARN L233 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 207 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:24:17,870 WARN L233 SmtUtils]: Spent 17.52s on a formula simplification. DAG size of input: 220 DAG size of output: 201 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:24:29,952 WARN L233 SmtUtils]: Spent 11.56s on a formula simplification. DAG size of input: 205 DAG size of output: 190 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:24:42,921 WARN L233 SmtUtils]: Spent 11.63s on a formula simplification. DAG size of input: 218 DAG size of output: 199 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:24:58,463 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 217 DAG size of output: 198 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:24:59,430 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) (.cse22 (not (= (mod c_~ok~0 256) 0))) (.cse14 (* c_~end~0 4)) (.cse13 (* c_~start~0 4))) (let ((.cse5 (= .cse14 .cse13)) (.cse6 (or .cse4 .cse22))) (let ((.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse10 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse28 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse27 (select (select .cse28 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse27 (+ (select (select (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (= (select (select .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse27)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) .cse6)) (.cse2 (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse22 .cse5)) (.cse9 (+ .cse13 c_~queue~0.offset)) (.cse7 (+ .cse14 c_~queue~0.offset)) (.cse1 (< c_~start~0 0)) (.cse15 (and .cse6 (or .cse4 (and .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))))) (.cse3 (<= c_~n~0 c_~start~0))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 1) (or .cse0 .cse1 .cse2 .cse3) (or (and (or .cse4 (and .cse5 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)))) .cse6) .cse0 .cse1 .cse3) (<= c_~v_old~0 c_~new~0) (or (not (= .cse7 0)) (let ((.cse8 (= .cse9 0))) (and (or .cse8 (and (<= (+ c_~start~0 c_~n~0) (+ c_~end~0 1)) (<= c_~end~0 c_~start~0))) (or (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t2~0#1.base|)) (not .cse8))))) (or .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 .cse3) (or .cse1 (and .cse6 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse12 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse11 (select (select .cse12 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse11 (+ (select (select (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ .cse13 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1)) (not (= .cse11 (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ .cse14 |c_ULTIMATE.start_main_#t~ret12#1.offset|))))))))))) .cse3) (or .cse0 .cse1 .cse15 .cse3) (or .cse1 .cse10 .cse3) (or (< 0 c_~start~0) .cse1 .cse2) (= c_~ok~0 1) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or (and .cse6 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse17 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse16 (select (select .cse17 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse16 (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1)) (not (= (select (select .cse17 c_~queue~0.base) .cse7) .cse16)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0))))) .cse1 .cse3) (or (<= .cse7 0) (<= c_~n~0 1)) (= c_~queue~0.offset 0) (or .cse1 .cse3 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (~A~0.base Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse19 (select (select .cse18 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_160 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1))) (< .cse19 c_~last~0) (not (= (select (select .cse18 c_~queue~0.base) .cse7) .cse19)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (~A~0.base Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse20 (select (select .cse21 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse20 c_~last~0) (not (= (select (select .cse21 c_~queue~0.base) .cse7) .cse20)))))) .cse22))) (or .cse1 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse24 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse23 (select (select .cse24 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse23 (+ (select (select (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) .cse23)))))))) .cse6) .cse3) (or .cse1 (and .cse22 (< c_~v_old~0 (+ (select (select |c_#memory_int| c_~queue~0.base) .cse9) 1))) .cse3) (or (and (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (~A~0.base Int)) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse25 (select (select .cse26 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse25 (+ (select (select (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1)) (not (= (select (select .cse26 c_~queue~0.base) .cse7) .cse25)))))) .cse22) .cse1 .cse3) (or .cse1 .cse15 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3))))) is different from false [2022-12-11 22:25:12,642 WARN L233 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 190 DAG size of output: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:25:30,703 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 223 DAG size of output: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:25:46,567 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 221 DAG size of output: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:25:49,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:26:03,525 WARN L233 SmtUtils]: Spent 13.84s on a formula simplification. DAG size of input: 231 DAG size of output: 203 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:26:31,300 WARN L233 SmtUtils]: Spent 27.38s on a formula simplification. DAG size of input: 229 DAG size of output: 203 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:26:46,566 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 220 DAG size of output: 201 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:26:53,035 WARN L233 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 209 DAG size of output: 194 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:27:04,114 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 218 DAG size of output: 199 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:27:30,373 WARN L233 SmtUtils]: Spent 14.38s on a formula simplification. DAG size of input: 224 DAG size of output: 205 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:27:39,366 WARN L233 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 209 DAG size of output: 194 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:27:48,885 WARN L233 SmtUtils]: Spent 8.99s on a formula simplification. DAG size of input: 194 DAG size of output: 175 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:28:02,825 WARN L233 SmtUtils]: Spent 13.29s on a formula simplification. DAG size of input: 222 DAG size of output: 203 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:28:11,228 WARN L233 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 207 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:28:12,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:28:23,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:28:27,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:28:46,823 WARN L233 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 219 DAG size of output: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:29:36,825 WARN L233 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 225 DAG size of output: 206 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:29:38,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:29:41,054 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-11 22:29:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2022-12-11 22:29:41,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-11 22:29:41,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-11 22:29:41,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:29:41,257 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:491) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 58 more [2022-12-11 22:29:41,261 INFO L158 Benchmark]: Toolchain (without parser) took 781066.20ms. Allocated memory was 183.5MB in the beginning and 494.9MB in the end (delta: 311.4MB). Free memory was 143.7MB in the beginning and 108.6MB in the end (delta: 35.2MB). Peak memory consumption was 348.0MB. Max. memory is 8.0GB. [2022-12-11 22:29:41,261 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 160.4MB in the beginning and 160.3MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:29:41,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.49ms. Allocated memory is still 183.5MB. Free memory was 143.6MB in the beginning and 130.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-11 22:29:41,261 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.93ms. Allocated memory is still 183.5MB. Free memory was 130.4MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:29:41,262 INFO L158 Benchmark]: Boogie Preprocessor took 36.77ms. Allocated memory is still 183.5MB. Free memory was 128.4MB in the beginning and 126.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-11 22:29:41,262 INFO L158 Benchmark]: RCFGBuilder took 670.80ms. Allocated memory is still 183.5MB. Free memory was 126.8MB in the beginning and 102.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 22:29:41,262 INFO L158 Benchmark]: TraceAbstraction took 780049.92ms. Allocated memory was 183.5MB in the beginning and 494.9MB in the end (delta: 311.4MB). Free memory was 101.1MB in the beginning and 108.6MB in the end (delta: -7.5MB). Peak memory consumption was 305.0MB. Max. memory is 8.0GB. [2022-12-11 22:29:41,265 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 160.4MB in the beginning and 160.3MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.49ms. Allocated memory is still 183.5MB. Free memory was 143.6MB in the beginning and 130.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.93ms. Allocated memory is still 183.5MB. Free memory was 130.4MB in the beginning and 128.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.77ms. Allocated memory is still 183.5MB. Free memory was 128.4MB in the beginning and 126.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 670.80ms. Allocated memory is still 183.5MB. Free memory was 126.8MB in the beginning and 102.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 780049.92ms. Allocated memory was 183.5MB in the beginning and 494.9MB in the end (delta: 311.4MB). Free memory was 101.1MB in the beginning and 108.6MB in the end (delta: -7.5MB). Peak memory consumption was 305.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...