/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-prod-cons.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 22:32:55,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 22:32:55,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 22:32:55,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 22:32:55,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 22:32:55,812 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 22:32:55,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 22:32:55,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 22:32:55,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 22:32:55,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 22:32:55,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 22:32:55,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 22:32:55,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 22:32:55,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 22:32:55,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 22:32:55,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 22:32:55,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 22:32:55,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 22:32:55,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 22:32:55,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 22:32:55,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 22:32:55,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 22:32:55,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 22:32:55,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 22:32:55,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 22:32:55,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 22:32:55,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 22:32:55,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 22:32:55,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 22:32:55,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 22:32:55,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 22:32:55,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 22:32:55,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 22:32:55,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 22:32:55,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 22:32:55,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 22:32:55,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 22:32:55,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 22:32:55,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 22:32:55,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 22:32:55,857 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 22:32:55,859 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:32:55,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 22:32:55,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 22:32:55,884 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 22:32:55,884 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 22:32:55,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 22:32:55,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 22:32:55,886 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 22:32:55,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 22:32:55,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 22:32:55,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 22:32:55,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 22:32:55,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 22:32:55,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:32:55,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 22:32:55,888 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 22:32:55,889 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:32:56,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 22:32:56,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 22:32:56,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 22:32:56,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 22:32:56,173 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 22:32:56,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-12-11 22:32:57,033 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 22:32:57,191 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 22:32:57,192 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons.wvr.c [2022-12-11 22:32:57,198 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9b17b8a/9385bffebc6c4b7f9b8284a1976bd206/FLAGb67de37b6 [2022-12-11 22:32:57,218 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be9b17b8a/9385bffebc6c4b7f9b8284a1976bd206 [2022-12-11 22:32:57,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 22:32:57,221 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 22:32:57,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 22:32:57,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 22:32:57,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 22:32:57,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2475a0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57, skipping insertion in model container [2022-12-11 22:32:57,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 22:32:57,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 22:32:57,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,391 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-prod-cons.wvr.c[3056,3069] [2022-12-11 22:32:57,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:32:57,409 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 22:32:57,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:32:57,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:32:57,444 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-prod-cons.wvr.c[3056,3069] [2022-12-11 22:32:57,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:32:57,461 INFO L208 MainTranslator]: Completed translation [2022-12-11 22:32:57,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57 WrapperNode [2022-12-11 22:32:57,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 22:32:57,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 22:32:57,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 22:32:57,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 22:32:57,469 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:32:57" (1/1) ... [2022-12-11 22:32:57,481 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:32:57" (1/1) ... [2022-12-11 22:32:57,508 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-12-11 22:32:57,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 22:32:57,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 22:32:57,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 22:32:57,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 22:32:57,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,542 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 22:32:57,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 22:32:57,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 22:32:57,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 22:32:57,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (1/1) ... [2022-12-11 22:32:57,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:32:57,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:32:57,568 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:32:57,570 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:32:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 22:32:57,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 22:32:57,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 22:32:57,595 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 22:32:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 22:32:57,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 22:32:57,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 22:32:57,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 22:32:57,597 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:32:57,702 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 22:32:57,704 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 22:32:57,953 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 22:32:58,011 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 22:32:58,011 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-11 22:32:58,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:32:58 BoogieIcfgContainer [2022-12-11 22:32:58,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 22:32:58,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 22:32:58,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 22:32:58,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 22:32:58,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 10:32:57" (1/3) ... [2022-12-11 22:32:58,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e10e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:32:58, skipping insertion in model container [2022-12-11 22:32:58,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:32:57" (2/3) ... [2022-12-11 22:32:58,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e10e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:32:58, skipping insertion in model container [2022-12-11 22:32:58,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:32:58" (3/3) ... [2022-12-11 22:32:58,025 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-12-11 22:32:58,038 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 22:32:58,039 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 22:32:58,039 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 22:32:58,099 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 22:32:58,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 144 transitions, 312 flow [2022-12-11 22:32:58,201 INFO L130 PetriNetUnfolder]: 11/141 cut-off events. [2022-12-11 22:32:58,202 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 22:32:58,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 11/141 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 112. Up to 3 conditions per place. [2022-12-11 22:32:58,206 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 144 transitions, 312 flow [2022-12-11 22:32:58,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 131 transitions, 280 flow [2022-12-11 22:32:58,223 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 22:32:58,228 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;@2030c060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 22:32:58,229 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 22:32:58,262 INFO L130 PetriNetUnfolder]: 11/130 cut-off events. [2022-12-11 22:32:58,262 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 22:32:58,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:32:58,263 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] [2022-12-11 22:32:58,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:32:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:32:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash -630135818, now seen corresponding path program 1 times [2022-12-11 22:32:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:32:58,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570312374] [2022-12-11 22:32:58,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:32:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:32:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:32:58,740 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:32:58,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:32:58,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570312374] [2022-12-11 22:32:58,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570312374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:32:58,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:32:58,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 22:32:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871592821] [2022-12-11 22:32:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:32:58,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 22:32:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:32:58,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 22:32:58,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 22:32:58,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 144 [2022-12-11 22:32:58,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 131 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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:32:58,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:32:58,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 144 [2022-12-11 22:32:58,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:32:58,930 INFO L130 PetriNetUnfolder]: 108/342 cut-off events. [2022-12-11 22:32:58,930 INFO L131 PetriNetUnfolder]: For 94/95 co-relation queries the response was YES. [2022-12-11 22:32:58,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 342 events. 108/342 cut-off events. For 94/95 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1230 event pairs, 8 based on Foata normal form. 38/354 useless extension candidates. Maximal degree in co-relation 453. Up to 61 conditions per place. [2022-12-11 22:32:58,937 INFO L137 encePairwiseOnDemand]: 132/144 looper letters, 30 selfloop transitions, 5 changer transitions 4/142 dead transitions. [2022-12-11 22:32:58,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 142 transitions, 384 flow [2022-12-11 22:32:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 22:32:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 22:32:58,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2022-12-11 22:32:58,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8944444444444445 [2022-12-11 22:32:58,956 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places. [2022-12-11 22:32:58,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 142 transitions, 384 flow [2022-12-11 22:32:58,960 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 138 transitions, 376 flow [2022-12-11 22:32:58,961 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 138 transitions, 376 flow [2022-12-11 22:32:58,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 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:32:58,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:32:58,961 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] [2022-12-11 22:32:58,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 22:32:58,962 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:32:58,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:32:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash -614742234, now seen corresponding path program 2 times [2022-12-11 22:32:58,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:32:58,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631186875] [2022-12-11 22:32:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:32:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:32:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:32:59,448 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:32:59,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:32:59,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631186875] [2022-12-11 22:32:59,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631186875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:32:59,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:32:59,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 22:32:59,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100213671] [2022-12-11 22:32:59,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:32:59,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 22:32:59,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:32:59,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 22:32:59,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 22:32:59,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 144 [2022-12-11 22:32:59,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 138 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 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:32:59,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:32:59,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 144 [2022-12-11 22:32:59,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:32:59,731 INFO L130 PetriNetUnfolder]: 223/655 cut-off events. [2022-12-11 22:32:59,731 INFO L131 PetriNetUnfolder]: For 254/433 co-relation queries the response was YES. [2022-12-11 22:32:59,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 655 events. 223/655 cut-off events. For 254/433 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3731 event pairs, 32 based on Foata normal form. 8/631 useless extension candidates. Maximal degree in co-relation 1347. Up to 144 conditions per place. [2022-12-11 22:32:59,737 INFO L137 encePairwiseOnDemand]: 133/144 looper letters, 74 selfloop transitions, 11 changer transitions 5/173 dead transitions. [2022-12-11 22:32:59,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 173 transitions, 707 flow [2022-12-11 22:32:59,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 22:32:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 22:32:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1012 transitions. [2022-12-11 22:32:59,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7027777777777777 [2022-12-11 22:32:59,740 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places. [2022-12-11 22:32:59,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 173 transitions, 707 flow [2022-12-11 22:32:59,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 168 transitions, 662 flow [2022-12-11 22:32:59,744 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 168 transitions, 662 flow [2022-12-11 22:32:59,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 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:32:59,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:32:59,744 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] [2022-12-11 22:32:59,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 22:32:59,745 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:32:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:32:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash -798002801, now seen corresponding path program 1 times [2022-12-11 22:32:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:32:59,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355620509] [2022-12-11 22:32:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:32:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:32:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:32:59,906 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:32:59,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:32:59,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355620509] [2022-12-11 22:32:59,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355620509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:32:59,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:32:59,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 22:32:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642026708] [2022-12-11 22:32:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:32:59,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 22:32:59,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:32:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 22:32:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 22:32:59,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144 [2022-12-11 22:32:59,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 168 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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:32:59,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:32:59,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144 [2022-12-11 22:32:59,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:32:59,960 INFO L130 PetriNetUnfolder]: 185/547 cut-off events. [2022-12-11 22:32:59,961 INFO L131 PetriNetUnfolder]: For 418/468 co-relation queries the response was YES. [2022-12-11 22:32:59,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 547 events. 185/547 cut-off events. For 418/468 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2729 event pairs, 9 based on Foata normal form. 16/538 useless extension candidates. Maximal degree in co-relation 1225. Up to 138 conditions per place. [2022-12-11 22:32:59,964 INFO L137 encePairwiseOnDemand]: 139/144 looper letters, 36 selfloop transitions, 8 changer transitions 2/176 dead transitions. [2022-12-11 22:32:59,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 176 transitions, 821 flow [2022-12-11 22:32:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 22:32:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 22:32:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-12-11 22:32:59,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8865740740740741 [2022-12-11 22:32:59,966 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 11 predicate places. [2022-12-11 22:32:59,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 176 transitions, 821 flow [2022-12-11 22:32:59,968 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 174 transitions, 799 flow [2022-12-11 22:32:59,968 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 174 transitions, 799 flow [2022-12-11 22:32:59,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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:32:59,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:32:59,969 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] [2022-12-11 22:32:59,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 22:32:59,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:32:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:32:59,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1386582466, now seen corresponding path program 1 times [2022-12-11 22:32:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:32:59,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442201322] [2022-12-11 22:32:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:32:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:32:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:33:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:33:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:33:00,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442201322] [2022-12-11 22:33:00,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442201322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:33:00,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:33:00,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:33:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272403201] [2022-12-11 22:33:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:33:00,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:33:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:33:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:33:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:33:00,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2022-12-11 22:33:00,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 174 transitions, 799 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:33:00,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:33:00,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2022-12-11 22:33:00,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:33:00,236 INFO L130 PetriNetUnfolder]: 216/661 cut-off events. [2022-12-11 22:33:00,236 INFO L131 PetriNetUnfolder]: For 928/1007 co-relation queries the response was YES. [2022-12-11 22:33:00,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 661 events. 216/661 cut-off events. For 928/1007 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3320 event pairs, 13 based on Foata normal form. 13/633 useless extension candidates. Maximal degree in co-relation 1291. Up to 178 conditions per place. [2022-12-11 22:33:00,240 INFO L137 encePairwiseOnDemand]: 136/144 looper letters, 49 selfloop transitions, 6 changer transitions 5/183 dead transitions. [2022-12-11 22:33:00,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 183 transitions, 973 flow [2022-12-11 22:33:00,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 22:33:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 22:33:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2022-12-11 22:33:00,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8224206349206349 [2022-12-11 22:33:00,244 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 17 predicate places. [2022-12-11 22:33:00,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 183 transitions, 973 flow [2022-12-11 22:33:00,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 178 transitions, 917 flow [2022-12-11 22:33:00,247 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 178 transitions, 917 flow [2022-12-11 22:33:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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:33:00,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:33:00,248 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] [2022-12-11 22:33:00,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 22:33:00,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:33:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:33:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1647166717, now seen corresponding path program 1 times [2022-12-11 22:33:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:33:00,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639441528] [2022-12-11 22:33:00,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:33:00,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:33:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:33:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:01,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:33:01,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639441528] [2022-12-11 22:33:01,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639441528] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:33:01,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288592130] [2022-12-11 22:33:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:33:01,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:33:01,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:33:01,297 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:33:01,323 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:33:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:33:01,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-11 22:33:01,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:33:02,357 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 19 treesize of output 7 [2022-12-11 22:33:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:02,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:33:02,617 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:33:02,617 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 28 treesize of output 24 [2022-12-11 22:33:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:03,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288592130] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:33:03,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:33:03,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 20] total 60 [2022-12-11 22:33:03,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817358468] [2022-12-11 22:33:03,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:33:03,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-11 22:33:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:33:03,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-11 22:33:03,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=3041, Unknown=0, NotChecked=0, Total=3540 [2022-12-11 22:33:03,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 144 [2022-12-11 22:33:03,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 178 transitions, 917 flow. Second operand has 60 states, 60 states have (on average 72.78333333333333) internal successors, (4367), 60 states have internal predecessors, (4367), 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:33:03,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:33:03,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 144 [2022-12-11 22:33:03,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:33:19,638 INFO L130 PetriNetUnfolder]: 10681/21829 cut-off events. [2022-12-11 22:33:19,639 INFO L131 PetriNetUnfolder]: For 23407/23555 co-relation queries the response was YES. [2022-12-11 22:33:19,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63923 conditions, 21829 events. 10681/21829 cut-off events. For 23407/23555 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 213493 event pairs, 317 based on Foata normal form. 43/20290 useless extension candidates. Maximal degree in co-relation 37804. Up to 3360 conditions per place. [2022-12-11 22:33:19,761 INFO L137 encePairwiseOnDemand]: 104/144 looper letters, 774 selfloop transitions, 268 changer transitions 1169/2265 dead transitions. [2022-12-11 22:33:19,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 2265 transitions, 16848 flow [2022-12-11 22:33:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-12-11 22:33:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2022-12-11 22:33:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 18850 transitions. [2022-12-11 22:33:19,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5364867941712204 [2022-12-11 22:33:19,789 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 259 predicate places. [2022-12-11 22:33:19,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 389 places, 2265 transitions, 16848 flow [2022-12-11 22:33:19,836 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 1096 transitions, 7943 flow [2022-12-11 22:33:19,836 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1096 transitions, 7943 flow [2022-12-11 22:33:19,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 72.78333333333333) internal successors, (4367), 60 states have internal predecessors, (4367), 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:33:19,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:33:19,838 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] [2022-12-11 22:33:19,847 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:33:20,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:33:20,057 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:33:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:33:20,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1064689423, now seen corresponding path program 2 times [2022-12-11 22:33:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:33:20,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454302442] [2022-12-11 22:33:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:33:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:33:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:33:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:21,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:33:21,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454302442] [2022-12-11 22:33:21,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454302442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:33:21,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764116811] [2022-12-11 22:33:21,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:33:21,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:33:21,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:33:21,340 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:33:21,342 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:33:21,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:33:21,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:33:21,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-11 22:33:21,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:33:22,040 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:33:22,453 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:33:22,547 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:33:22,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:33:22,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:33:23,031 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:33:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:33:23,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:33:23,289 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_125 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-12-11 22:33:24,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:33:24,582 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 65 treesize of output 53 [2022-12-11 22:33:24,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:33:24,597 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 1504 treesize of output 1436 [2022-12-11 22:33:24,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:33:24,620 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 782 treesize of output 734 [2022-12-11 22:33:24,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:33:24,635 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 1364 treesize of output 1256 [2022-12-11 22:33:24,650 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 1142 treesize of output 950 [2022-12-11 22:33:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-11 22:33:26,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764116811] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:33:26,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:33:26,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31, 30] total 78 [2022-12-11 22:33:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838666428] [2022-12-11 22:33:26,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:33:26,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-11 22:33:26,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:33:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-11 22:33:26,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=5390, Unknown=14, NotChecked=150, Total=6006 [2022-12-11 22:33:26,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 144 [2022-12-11 22:33:26,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1096 transitions, 7943 flow. Second operand has 78 states, 78 states have (on average 59.37179487179487) internal successors, (4631), 78 states have internal predecessors, (4631), 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:33:26,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:33:26,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 144 [2022-12-11 22:33:26,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:33:53,199 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 86 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:33:53,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~front~0 4)) (.cse11 (* c_~back~0 4))) (let ((.cse9 (< c_~d~0 1)) (.cse10 (= .cse12 .cse11)) (.cse8 (+ c_~queue~0.offset .cse12))) (let ((.cse1 (+ c_~front~0 c_~n~0)) (.cse0 (forall ((v_ArrVal_125 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~queue~0.base) .cse8)) (+ c_~W~0 1)))) (.cse5 (and .cse9 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse10)) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)) 1))) (.cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (= (mod c_~v_assert~0 256) 0)) (.cse2 (not (< c_~back~0 c_~n~0))) (.cse4 (not (<= 0 c_~back~0)))) (and .cse0 (<= .cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~back~0)) (= c_~d~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse1 (+ c_~back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~front~0 c_~back~0) (or .cse0 .cse2 .cse3 .cse4) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse5 .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2 .cse4) (or .cse5 .cse7 .cse6 .cse2 .cse4) (or .cse5 (< 0 c_~back~0) .cse4) (or (<= c_~back~0 c_~front~0) (not (<= (+ c_~front~0 1) 0))) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= c_~d~0 0) (<= c_~d~0 c_~W~0) (or .cse6 (forall ((v_ArrVal_125 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~queue~0.base) .cse8)) 2)) .cse2 .cse3 .cse4) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 1 c_~v_assert~0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or .cse7 .cse6 .cse2 .cse4 (and .cse9 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse10)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-12-11 22:33:56,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~front~0 4)) (.cse11 (* c_~back~0 4))) (let ((.cse9 (< c_~d~0 1)) (.cse10 (= .cse12 .cse11)) (.cse8 (+ c_~queue~0.offset .cse12))) (let ((.cse1 (+ c_~front~0 c_~n~0)) (.cse0 (forall ((v_ArrVal_125 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~queue~0.base) .cse8)) (+ c_~W~0 1)))) (.cse5 (and .cse9 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse10)) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)) 1))) (.cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (= (mod c_~v_assert~0 256) 0)) (.cse2 (not (< c_~back~0 c_~n~0))) (.cse4 (not (<= 0 c_~back~0)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) .cse0 (<= .cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~back~0)) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= .cse1 (+ c_~back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~front~0 c_~back~0) (or .cse0 .cse2 .cse3 .cse4) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse5 .cse6 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2 .cse4) (or .cse5 .cse7 .cse6 .cse2 .cse4) (or .cse5 (< 0 c_~back~0) .cse4) (or (<= c_~back~0 c_~front~0) (not (<= (+ c_~front~0 1) 0))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= c_~d~0 0) (= |c_thread2Thread1of1ForFork2_~cond~1#1| c_~v_assert~0) (<= c_~d~0 c_~W~0) (or .cse6 (forall ((v_ArrVal_125 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_125) c_~queue~0.base) .cse8)) 2)) .cse2 .cse3 .cse4) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 1 c_~v_assert~0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or .cse7 .cse6 .cse2 .cse4 (and .cse9 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse10)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-12-11 22:34:23,166 INFO L130 PetriNetUnfolder]: 14594/29912 cut-off events. [2022-12-11 22:34:23,166 INFO L131 PetriNetUnfolder]: For 61031/62935 co-relation queries the response was YES. [2022-12-11 22:34:23,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118446 conditions, 29912 events. 14594/29912 cut-off events. For 61031/62935 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 299393 event pairs, 118 based on Foata normal form. 553/28630 useless extension candidates. Maximal degree in co-relation 50533. Up to 7553 conditions per place. [2022-12-11 22:34:23,360 INFO L137 encePairwiseOnDemand]: 96/144 looper letters, 2796 selfloop transitions, 1389 changer transitions 611/4843 dead transitions. [2022-12-11 22:34:23,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 4843 transitions, 46125 flow [2022-12-11 22:34:23,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2022-12-11 22:34:23,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2022-12-11 22:34:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 12819 transitions. [2022-12-11 22:34:23,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.454187925170068 [2022-12-11 22:34:23,378 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 333 predicate places. [2022-12-11 22:34:23,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 463 places, 4843 transitions, 46125 flow [2022-12-11 22:34:23,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 4232 transitions, 40445 flow [2022-12-11 22:34:23,516 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 4232 transitions, 40445 flow [2022-12-11 22:34:23,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 59.37179487179487) internal successors, (4631), 78 states have internal predecessors, (4631), 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:34:23,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:34:23,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, 1, 1] [2022-12-11 22:34:23,528 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:34:23,726 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:34:23,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:34:23,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:34:23,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1345550729, now seen corresponding path program 3 times [2022-12-11 22:34:23,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:34:23,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982888595] [2022-12-11 22:34:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:34:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:34:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:34:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:34:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:34:24,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982888595] [2022-12-11 22:34:24,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982888595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:34:24,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922711443] [2022-12-11 22:34:24,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:34:24,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:34:24,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:34:24,977 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:34:24,979 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:34:25,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-11 22:34:25,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:34:25,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-11 22:34:25,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:34:25,148 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:34:25,541 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:34:25,542 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:34:25,726 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 15 treesize of output 11 [2022-12-11 22:34:26,180 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:34:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:34:26,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:34:26,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:34:26,854 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 19 treesize of output 7 [2022-12-11 22:34:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:34:26,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:34:27,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) (+ c_~W~0 1))) is different from false [2022-12-11 22:34:28,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:34:28,206 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 62 treesize of output 50 [2022-12-11 22:34:28,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:34:28,225 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 362 treesize of output 350 [2022-12-11 22:34:28,231 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 314 treesize of output 266 [2022-12-11 22:34:28,236 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 266 treesize of output 242 [2022-12-11 22:34:28,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:34:28,245 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 266 treesize of output 260 [2022-12-11 22:34:29,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-11 22:34:29,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-11 22:34:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:34:29,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922711443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:34:29,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:34:29,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 31] total 81 [2022-12-11 22:34:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508657679] [2022-12-11 22:34:29,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:34:29,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-12-11 22:34:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:34:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-12-11 22:34:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=5819, Unknown=13, NotChecked=156, Total=6480 [2022-12-11 22:34:29,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 144 [2022-12-11 22:34:29,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 4232 transitions, 40445 flow. Second operand has 81 states, 81 states have (on average 59.28395061728395) internal successors, (4802), 81 states have internal predecessors, (4802), 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:34:29,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:34:29,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 144 [2022-12-11 22:34:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:34:49,578 WARN L233 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 80 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:34:50,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse6 (< c_~d~0 1)) (.cse7 (= .cse4 (* c_~back~0 4))) (.cse8 (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|))) (let ((.cse0 (let ((.cse10 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_12| Int)) (or (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_12| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_12|) 0)))))) (and (or .cse6 .cse10) (or .cse10 .cse7) (or (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))) (or (not (= .cse8 0)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)))))) (.cse5 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse2 (not (< c_~back~0 c_~n~0))) (.cse3 (not (<= 0 c_~back~0))) (.cse9 (+ |c_#StackHeapBarrier| 1))) (and (= c_~d~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (or .cse0 .cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2 .cse3) (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~queue~0.base) (+ c_~queue~0.offset .cse4))) (+ c_~W~0 1))) (or .cse5 .cse1 (and .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse7 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse2 .cse3) (<= c_~d~0 0) (or .cse0 (< 0 c_~back~0) .cse3) (<= c_~d~0 c_~W~0) (<= 1 c_~v_assert~0) (= .cse8 1) (<= .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse5 (and .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse7) .cse1 .cse2 .cse3) (or .cse0 .cse5 .cse1 .cse2 .cse3) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base|))))) is different from false [2022-12-11 22:35:12,912 WARN L233 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 61 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:35:43,114 INFO L130 PetriNetUnfolder]: 18588/38829 cut-off events. [2022-12-11 22:35:43,114 INFO L131 PetriNetUnfolder]: For 91531/95586 co-relation queries the response was YES. [2022-12-11 22:35:43,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184253 conditions, 38829 events. 18588/38829 cut-off events. For 91531/95586 co-relation queries the response was YES. Maximal size of possible extension queue 1731. Compared 412036 event pairs, 225 based on Foata normal form. 1060/37629 useless extension candidates. Maximal degree in co-relation 82947. Up to 10073 conditions per place. [2022-12-11 22:35:43,367 INFO L137 encePairwiseOnDemand]: 99/144 looper letters, 4473 selfloop transitions, 1526 changer transitions 686/6732 dead transitions. [2022-12-11 22:35:43,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 6732 transitions, 78013 flow [2022-12-11 22:35:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-12-11 22:35:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2022-12-11 22:35:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 11154 transitions. [2022-12-11 22:35:43,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4556372549019608 [2022-12-11 22:35:43,377 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 478 predicate places. [2022-12-11 22:35:43,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 6732 transitions, 78013 flow [2022-12-11 22:35:43,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 584 places, 6046 transitions, 70190 flow [2022-12-11 22:35:43,568 INFO L495 AbstractCegarLoop]: Abstraction has has 584 places, 6046 transitions, 70190 flow [2022-12-11 22:35:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 59.28395061728395) internal successors, (4802), 81 states have internal predecessors, (4802), 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:35:43,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:35:43,570 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:43,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 22:35:43,776 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:35:43,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:35:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:35:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1857676500, now seen corresponding path program 4 times [2022-12-11 22:35:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:35:43,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115858508] [2022-12-11 22:35:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:35:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:35:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:35:43,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:35:43,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:35:43,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115858508] [2022-12-11 22:35:43,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115858508] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:35:43,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111002327] [2022-12-11 22:35:43,886 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 22:35:43,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:35:43,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:35:43,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:35:43,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 22:35:43,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 22:35:43,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:35:43,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 22:35:43,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:35:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:35:44,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:35:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:35:44,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111002327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:35:44,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:35:44,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11, 11] total 21 [2022-12-11 22:35:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534180752] [2022-12-11 22:35:44,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:35:44,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-11 22:35:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:35:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-11 22:35:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-12-11 22:35:44,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 144 [2022-12-11 22:35:44,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 6046 transitions, 70190 flow. Second operand has 21 states, 21 states have (on average 112.28571428571429) internal successors, (2358), 21 states have internal predecessors, (2358), 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:35:44,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:35:44,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 144 [2022-12-11 22:35:44,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:35:56,130 INFO L130 PetriNetUnfolder]: 24868/52773 cut-off events. [2022-12-11 22:35:56,130 INFO L131 PetriNetUnfolder]: For 177507/179868 co-relation queries the response was YES. [2022-12-11 22:35:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258964 conditions, 52773 events. 24868/52773 cut-off events. For 177507/179868 co-relation queries the response was YES. Maximal size of possible extension queue 1996. Compared 576428 event pairs, 907 based on Foata normal form. 987/50660 useless extension candidates. Maximal degree in co-relation 161005. Up to 14559 conditions per place. [2022-12-11 22:35:56,566 INFO L137 encePairwiseOnDemand]: 129/144 looper letters, 1482 selfloop transitions, 280 changer transitions 2473/6780 dead transitions. [2022-12-11 22:35:56,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 6780 transitions, 88994 flow [2022-12-11 22:35:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 22:35:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 22:35:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2028 transitions. [2022-12-11 22:35:56,570 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7824074074074074 [2022-12-11 22:35:56,570 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 471 predicate places. [2022-12-11 22:35:56,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 601 places, 6780 transitions, 88994 flow [2022-12-11 22:35:56,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 450 places, 4307 transitions, 58060 flow [2022-12-11 22:35:56,779 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 4307 transitions, 58060 flow [2022-12-11 22:35:56,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 112.28571428571429) internal successors, (2358), 21 states have internal predecessors, (2358), 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:35:56,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:35:56,780 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:56,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 22:35:56,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:35:56,987 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:35:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:35:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 805279694, now seen corresponding path program 5 times [2022-12-11 22:35:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:35:56,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986041512] [2022-12-11 22:35:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:35:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:35:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:35:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:35:58,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:35:58,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986041512] [2022-12-11 22:35:58,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986041512] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:35:58,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564479624] [2022-12-11 22:35:58,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 22:35:58,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:35:58,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:35:58,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:35:58,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 22:35:58,471 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-11 22:35:58,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:35:58,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-11 22:35:58,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:35:58,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:35:58,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:35:59,030 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:35:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 22:35:59,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:35:59,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_232 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_232) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) is different from false [2022-12-11 22:35:59,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:35:59,237 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 50 treesize of output 46 [2022-12-11 22:35:59,245 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 13 treesize of output 7 [2022-12-11 22:35:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-12-11 22:35:59,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564479624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:35:59,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:35:59,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 18, 18] total 55 [2022-12-11 22:35:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104570888] [2022-12-11 22:35:59,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:35:59,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-11 22:35:59,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:35:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-11 22:35:59,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2626, Unknown=1, NotChecked=104, Total=2970 [2022-12-11 22:35:59,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 144 [2022-12-11 22:35:59,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 4307 transitions, 58060 flow. Second operand has 55 states, 55 states have (on average 69.2) internal successors, (3806), 55 states have internal predecessors, (3806), 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:35:59,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:35:59,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 144 [2022-12-11 22:35:59,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:36:20,550 INFO L130 PetriNetUnfolder]: 25599/54564 cut-off events. [2022-12-11 22:36:20,550 INFO L131 PetriNetUnfolder]: For 210576/216726 co-relation queries the response was YES. [2022-12-11 22:36:20,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306631 conditions, 54564 events. 25599/54564 cut-off events. For 210576/216726 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 606897 event pairs, 937 based on Foata normal form. 1191/52836 useless extension candidates. Maximal degree in co-relation 224534. Up to 13617 conditions per place. [2022-12-11 22:36:20,904 INFO L137 encePairwiseOnDemand]: 112/144 looper letters, 4168 selfloop transitions, 611 changer transitions 1103/6134 dead transitions. [2022-12-11 22:36:20,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 511 places, 6134 transitions, 94412 flow [2022-12-11 22:36:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-11 22:36:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-12-11 22:36:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 4506 transitions. [2022-12-11 22:36:20,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5047043010752689 [2022-12-11 22:36:20,912 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 381 predicate places. [2022-12-11 22:36:20,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 511 places, 6134 transitions, 94412 flow [2022-12-11 22:36:21,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 497 places, 5031 transitions, 77145 flow [2022-12-11 22:36:21,176 INFO L495 AbstractCegarLoop]: Abstraction has has 497 places, 5031 transitions, 77145 flow [2022-12-11 22:36:21,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 69.2) internal successors, (3806), 55 states have internal predecessors, (3806), 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:36:21,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:36:21,177 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:21,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 22:36:21,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:36:21,378 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:36:21,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:36:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash -264474344, now seen corresponding path program 6 times [2022-12-11 22:36:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:36:21,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146095426] [2022-12-11 22:36:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:36:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:36:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:36:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:36:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:36:23,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146095426] [2022-12-11 22:36:23,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146095426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:36:23,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757346725] [2022-12-11 22:36:23,148 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 22:36:23,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:36:23,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:36:23,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:36:23,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 22:36:23,315 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-11 22:36:23,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:36:23,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-11 22:36:23,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:36:23,332 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:36:23,359 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-11 22:36:23,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-11 22:36:23,395 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-11 22:36:23,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-12-11 22:36:23,750 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:36:23,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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:36:24,093 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 15 treesize of output 11 [2022-12-11 22:36:24,523 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:36:24,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:36:24,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:36:24,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:36:24,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:36:24,961 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:36:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:36:25,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:36:26,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:36:26,093 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 62 treesize of output 50 [2022-12-11 22:36:26,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:36:26,104 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 362 treesize of output 350 [2022-12-11 22:36:26,109 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 314 treesize of output 266 [2022-12-11 22:36:26,121 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 266 treesize of output 242 [2022-12-11 22:36:26,130 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:36:26,131 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 266 treesize of output 260 [2022-12-11 22:36:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:36:27,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757346725] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:36:27,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:36:27,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30, 31] total 81 [2022-12-11 22:36:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713136417] [2022-12-11 22:36:27,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:36:27,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-12-11 22:36:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:36:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-12-11 22:36:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=5942, Unknown=28, NotChecked=0, Total=6480 [2022-12-11 22:36:27,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 144 [2022-12-11 22:36:27,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 5031 transitions, 77145 flow. Second operand has 81 states, 81 states have (on average 61.39506172839506) internal successors, (4973), 81 states have internal predecessors, (4973), 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:36:27,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:36:27,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 144 [2022-12-11 22:36:27,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:36:34,765 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:36:43,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~W~0 1)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (or (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276) c_~queue~0.base) .cse0)) .cse1)) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= c_~d~0 0) (= |c_thread2Thread1of1ForFork2_~cond~1#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (forall ((v_ArrVal_276 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_276) c_~queue~0.base) .cse0)) .cse1)) (<= 1 c_~W~0) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (<= .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base|))) is different from false [2022-12-11 22:36:47,179 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:37:17,920 INFO L130 PetriNetUnfolder]: 38891/82602 cut-off events. [2022-12-11 22:37:17,921 INFO L131 PetriNetUnfolder]: For 372969/384652 co-relation queries the response was YES. [2022-12-11 22:37:18,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531568 conditions, 82602 events. 38891/82602 cut-off events. For 372969/384652 co-relation queries the response was YES. Maximal size of possible extension queue 3300. Compared 976316 event pairs, 1557 based on Foata normal form. 1757/80021 useless extension candidates. Maximal degree in co-relation 260753. Up to 23333 conditions per place. [2022-12-11 22:37:18,526 INFO L137 encePairwiseOnDemand]: 102/144 looper letters, 6680 selfloop transitions, 1178 changer transitions 1314/9415 dead transitions. [2022-12-11 22:37:18,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 9415 transitions, 165685 flow [2022-12-11 22:37:18,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-11 22:37:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-12-11 22:37:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 5720 transitions. [2022-12-11 22:37:18,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4565772669220945 [2022-12-11 22:37:18,531 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 453 predicate places. [2022-12-11 22:37:18,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 583 places, 9415 transitions, 165685 flow [2022-12-11 22:37:18,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 8101 transitions, 142000 flow [2022-12-11 22:37:18,957 INFO L495 AbstractCegarLoop]: Abstraction has has 575 places, 8101 transitions, 142000 flow [2022-12-11 22:37:18,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 61.39506172839506) internal successors, (4973), 81 states have internal predecessors, (4973), 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:37:18,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:37:18,959 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:18,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-11 22:37:19,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:37:19,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:37:19,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:37:19,166 INFO L85 PathProgramCache]: Analyzing trace with hash 708906497, now seen corresponding path program 7 times [2022-12-11 22:37:19,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:37:19,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052546938] [2022-12-11 22:37:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:37:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:37:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:37:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:37:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:37:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052546938] [2022-12-11 22:37:21,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052546938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:37:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455879250] [2022-12-11 22:37:21,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 22:37:21,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:37:21,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:37:21,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:37:21,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 22:37:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:37:21,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-11 22:37:21,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:37:21,367 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:37:21,391 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-11 22:37:21,392 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:37:21,588 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-11 22:37:21,589 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 16 treesize of output 18 [2022-12-11 22:37:22,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:37:22,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-11 22:37:22,408 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:37:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-11 22:37:22,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:37:22,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_320 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_320) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) c_~d~0) (+ c_~W~0 1))) is different from false [2022-12-11 22:37:22,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:37:22,765 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 96 treesize of output 92 [2022-12-11 22:37:22,770 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 76 treesize of output 64 [2022-12-11 22:37:22,776 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 34 treesize of output 28 [2022-12-11 22:37:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-11 22:37:24,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455879250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:37:24,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:37:24,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25, 23] total 70 [2022-12-11 22:37:24,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812907020] [2022-12-11 22:37:24,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:37:24,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-11 22:37:24,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:37:24,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-11 22:37:24,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=4348, Unknown=3, NotChecked=134, Total=4830 [2022-12-11 22:37:24,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 144 [2022-12-11 22:37:24,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 8101 transitions, 142000 flow. Second operand has 70 states, 70 states have (on average 60.82857142857143) internal successors, (4258), 70 states have internal predecessors, (4258), 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:37:24,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:37:24,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 144 [2022-12-11 22:37:24,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:37:34,945 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 47 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:37:45,657 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 46 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:38:42,566 INFO L130 PetriNetUnfolder]: 37846/79512 cut-off events. [2022-12-11 22:38:42,566 INFO L131 PetriNetUnfolder]: For 416400/432653 co-relation queries the response was YES. [2022-12-11 22:38:42,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580579 conditions, 79512 events. 37846/79512 cut-off events. For 416400/432653 co-relation queries the response was YES. Maximal size of possible extension queue 3137. Compared 924071 event pairs, 1660 based on Foata normal form. 1926/77244 useless extension candidates. Maximal degree in co-relation 267163. Up to 25151 conditions per place. [2022-12-11 22:38:43,222 INFO L137 encePairwiseOnDemand]: 102/144 looper letters, 8129 selfloop transitions, 1361 changer transitions 54/9591 dead transitions. [2022-12-11 22:38:43,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 9591 transitions, 184413 flow [2022-12-11 22:38:43,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-12-11 22:38:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2022-12-11 22:38:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 5850 transitions. [2022-12-11 22:38:43,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2022-12-11 22:38:43,228 INFO L295 CegarLoopForPetriNet]: 130 programPoint places, 535 predicate places. [2022-12-11 22:38:43,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 665 places, 9591 transitions, 184413 flow [2022-12-11 22:38:43,736 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 664 places, 9537 transitions, 183469 flow [2022-12-11 22:38:43,736 INFO L495 AbstractCegarLoop]: Abstraction has has 664 places, 9537 transitions, 183469 flow [2022-12-11 22:38:43,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 60.82857142857143) internal successors, (4258), 70 states have internal predecessors, (4258), 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:38:43,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:38:43,738 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:43,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-11 22:38:43,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:38:43,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:38:43,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:38:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash -449263570, now seen corresponding path program 8 times [2022-12-11 22:38:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:38:43,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664963201] [2022-12-11 22:38:43,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:38:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:38:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:38:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:38:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:38:46,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664963201] [2022-12-11 22:38:46,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664963201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:38:46,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191902948] [2022-12-11 22:38:46,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:38:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:38:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:38:46,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:38:46,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 22:38:46,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:38:46,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:38:46,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-11 22:38:46,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:38:47,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:38:47,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-11 22:38:48,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:38:48,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-11 22:38:48,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:38:48,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 13 [2022-12-11 22:38:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:38:49,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:38:50,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:38:50,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 420 treesize of output 412 [2022-12-11 22:38:50,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:38:50,351 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 251 treesize of output 237 [2022-12-11 22:38:50,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:38:50,370 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 316 treesize of output 262 [2022-12-11 22:38:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:38:53,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191902948] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:38:53,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:38:53,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 91 [2022-12-11 22:38:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155355911] [2022-12-11 22:38:53,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:38:53,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-12-11 22:38:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:38:53,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-12-11 22:38:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=7555, Unknown=9, NotChecked=0, Total=8190 [2022-12-11 22:38:53,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 144 [2022-12-11 22:38:53,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 9537 transitions, 183469 flow. Second operand has 91 states, 91 states have (on average 65.48351648351648) internal successors, (5959), 91 states have internal predecessors, (5959), 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:38:53,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:38:53,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 144 [2022-12-11 22:38:53,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:39:12,171 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:39:19,211 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:39:21,226 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:39:23,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:34,033 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 151 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:39:41,202 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 149 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:39:43,561 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:39:45,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:39:47,873 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:39:49,896 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:39:57,123 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:39:59,604 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:40:01,641 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:40:04,979 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:40:07,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:10,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:22,078 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification. DAG size of input: 137 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:40:29,411 WARN L233 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 135 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:40:32,895 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:40:34,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:36,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:39,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:41,062 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:40:43,384 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:40:45,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:47,425 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:40:50,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:40:52,657 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:40:55,000 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:41:08,592 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 143 DAG size of output: 125 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:41:24,039 WARN L233 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 129 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:41:44,757 WARN L233 SmtUtils]: Spent 16.73s on a formula simplification. DAG size of input: 141 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:41:59,857 WARN L233 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 127 DAG size of output: 110 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:42:03,241 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:42:08,674 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:42:15,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:42:17,167 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:42:19,634 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:42:24,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:42:27,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:42:40,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:42:44,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:42:51,221 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:42:53,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:43:02,158 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:43:26,404 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 122 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:43:32,040 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:43:34,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:43:36,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:43:38,933 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:43:50,906 WARN L233 SmtUtils]: Spent 10.51s on a formula simplification. DAG size of input: 118 DAG size of output: 101 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:43:53,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:43:55,036 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:44:02,209 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:44:08,966 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:44:15,391 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 101 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:44:18,102 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:44:35,052 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:44:37,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:44:39,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:44:41,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:44:43,543 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:44:46,050 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:45:00,381 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:45:02,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:45:12,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:45:25,130 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:45:31,710 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:45:33,923 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:45:51,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:46:02,120 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:46:14,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:46:16,871 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:46:18,918 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:46:25,958 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] Received shutdown request... [2022-12-11 22:46:40,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:46:40,440 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:46:41,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-11 22:46:41,641 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-11 22:46:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 263 states. [2022-12-11 22:46:41,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 22:46:41,662 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) 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.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) 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) [2022-12-11 22:46:41,663 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 137 [2022-12-11 22:46:41,665 INFO L158 Benchmark]: Toolchain (without parser) took 824444.68ms. Allocated memory was 218.1MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 193.1MB in the beginning and 1.1GB in the end (delta: -952.3MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-11 22:46:41,665 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 218.1MB. Free memory is still 193.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:46:41,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.44ms. Allocated memory is still 218.1MB. Free memory was 192.5MB in the beginning and 179.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-11 22:46:41,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.08ms. Allocated memory is still 218.1MB. Free memory was 179.4MB in the beginning and 177.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:46:41,668 INFO L158 Benchmark]: Boogie Preprocessor took 35.46ms. Allocated memory is still 218.1MB. Free memory was 177.3MB in the beginning and 175.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:46:41,668 INFO L158 Benchmark]: RCFGBuilder took 468.43ms. Allocated memory is still 218.1MB. Free memory was 175.8MB in the beginning and 154.3MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-11 22:46:41,668 INFO L158 Benchmark]: TraceAbstraction took 823650.37ms. Allocated memory was 218.1MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 152.7MB in the beginning and 1.1GB in the end (delta: -992.6MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-11 22:46:41,669 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.09ms. Allocated memory is still 218.1MB. Free memory is still 193.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.44ms. Allocated memory is still 218.1MB. Free memory was 192.5MB in the beginning and 179.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.08ms. Allocated memory is still 218.1MB. Free memory was 179.4MB in the beginning and 177.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.46ms. Allocated memory is still 218.1MB. Free memory was 177.3MB in the beginning and 175.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 468.43ms. Allocated memory is still 218.1MB. Free memory was 175.8MB in the beginning and 154.3MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 823650.37ms. Allocated memory was 218.1MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 152.7MB in the beginning and 1.1GB in the end (delta: -992.6MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown