/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 19:36:32,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 19:36:32,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 19:36:32,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 19:36:32,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 19:36:32,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 19:36:32,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 19:36:32,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 19:36:32,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 19:36:32,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 19:36:32,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 19:36:32,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 19:36:32,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 19:36:32,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 19:36:32,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 19:36:32,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 19:36:32,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 19:36:32,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 19:36:32,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 19:36:32,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 19:36:32,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 19:36:32,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 19:36:32,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 19:36:32,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 19:36:32,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 19:36:32,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 19:36:32,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 19:36:32,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 19:36:32,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 19:36:32,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 19:36:32,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 19:36:32,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 19:36:32,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 19:36:32,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 19:36:32,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 19:36:32,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 19:36:32,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 19:36:32,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 19:36:32,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 19:36:32,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 19:36:32,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 19:36:32,364 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-05 19:36:32,392 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 19:36:32,392 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 19:36:32,394 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 19:36:32,394 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 19:36:32,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 19:36:32,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 19:36:32,405 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 19:36:32,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 19:36:32,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 19:36:32,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 19:36:32,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 19:36:32,407 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 19:36:32,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 19:36:32,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 19:36:32,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 19:36:32,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 19:36:32,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 19:36:32,408 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 19:36:32,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 19:36:32,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 19:36:32,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 19:36:32,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 19:36:32,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 19:36:32,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:36:32,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 19:36:32,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 19:36:32,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 19:36:32,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 19:36:32,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 19:36:32,410 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-05 19:36:32,410 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 19:36:32,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 19:36:32,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 19:36:32,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 19:36:32,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 19:36:32,765 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 19:36:32,766 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 19:36:32,767 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-05 19:36:33,931 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 19:36:34,163 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 19:36:34,163 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-05 19:36:34,168 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f03d8f67/7db058b7012847e2ad1f4f4c197ce2c1/FLAG014ed9c42 [2022-12-05 19:36:34,181 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f03d8f67/7db058b7012847e2ad1f4f4c197ce2c1 [2022-12-05 19:36:34,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 19:36:34,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 19:36:34,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 19:36:34,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 19:36:34,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 19:36:34,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1804dda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34, skipping insertion in model container [2022-12-05 19:36:34,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 19:36:34,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 19:36:34,319 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:36:34,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:36:34,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:36:34,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:36:34,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:36:34,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:36:34,337 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-send-receive-alt.wvr.c[2650,2663] [2022-12-05 19:36:34,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:36:34,351 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 19:36:34,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:36:34,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:36:34,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:36:34,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:36:34,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 19:36:34,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 19:36:34,369 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-send-receive-alt.wvr.c[2650,2663] [2022-12-05 19:36:34,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 19:36:34,383 INFO L208 MainTranslator]: Completed translation [2022-12-05 19:36:34,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34 WrapperNode [2022-12-05 19:36:34,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 19:36:34,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 19:36:34,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 19:36:34,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 19:36:34,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,417 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 142 [2022-12-05 19:36:34,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 19:36:34,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 19:36:34,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 19:36:34,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 19:36:34,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,438 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 19:36:34,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 19:36:34,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 19:36:34,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 19:36:34,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (1/1) ... [2022-12-05 19:36:34,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 19:36:34,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:36:34,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 19:36:34,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 19:36:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 19:36:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 19:36:34,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 19:36:34,520 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 19:36:34,520 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 19:36:34,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 19:36:34,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 19:36:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 19:36:34,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 19:36:34,523 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 19:36:34,667 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 19:36:34,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 19:36:34,915 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 19:36:34,981 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 19:36:34,982 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 19:36:34,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:36:34 BoogieIcfgContainer [2022-12-05 19:36:34,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 19:36:34,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 19:36:34,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 19:36:34,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 19:36:34,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 07:36:34" (1/3) ... [2022-12-05 19:36:34,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1731a508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:36:34, skipping insertion in model container [2022-12-05 19:36:34,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 07:36:34" (2/3) ... [2022-12-05 19:36:34,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1731a508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 07:36:34, skipping insertion in model container [2022-12-05 19:36:34,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 07:36:34" (3/3) ... [2022-12-05 19:36:34,991 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2022-12-05 19:36:35,007 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 19:36:35,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 19:36:35,007 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 19:36:35,060 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 19:36:35,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 122 transitions, 260 flow [2022-12-05 19:36:35,139 INFO L130 PetriNetUnfolder]: 11/120 cut-off events. [2022-12-05 19:36:35,140 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 19:36:35,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 120 events. 11/120 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-05 19:36:35,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 122 transitions, 260 flow [2022-12-05 19:36:35,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 112 transitions, 236 flow [2022-12-05 19:36:35,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 19:36:35,162 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;@64f2fea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 19:36:35,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 19:36:35,213 INFO L130 PetriNetUnfolder]: 11/111 cut-off events. [2022-12-05 19:36:35,213 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 19:36:35,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:36:35,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:36:35,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:36:35,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:36:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1056395966, now seen corresponding path program 1 times [2022-12-05 19:36:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:36:35,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760206158] [2022-12-05 19:36:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:36:35,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:36:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:36:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:36:35,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:36:35,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760206158] [2022-12-05 19:36:35,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760206158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:36:35,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:36:35,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 19:36:35,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110293533] [2022-12-05 19:36:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:36:35,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 19:36:35,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:36:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 19:36:35,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 19:36:35,553 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 122 [2022-12-05 19:36:35,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 112 transitions, 236 flow. Second operand has 2 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:35,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:36:35,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 122 [2022-12-05 19:36:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:36:35,611 INFO L130 PetriNetUnfolder]: 8/112 cut-off events. [2022-12-05 19:36:35,611 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 19:36:35,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 112 events. 8/112 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 1 based on Foata normal form. 11/113 useless extension candidates. Maximal degree in co-relation 75. Up to 13 conditions per place. [2022-12-05 19:36:35,613 INFO L137 encePairwiseOnDemand]: 115/122 looper letters, 7 selfloop transitions, 0 changer transitions 3/105 dead transitions. [2022-12-05 19:36:35,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 236 flow [2022-12-05 19:36:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 19:36:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 19:36:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2022-12-05 19:36:35,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2022-12-05 19:36:35,626 INFO L175 Difference]: Start difference. First operand has 108 places, 112 transitions, 236 flow. Second operand 2 states and 228 transitions. [2022-12-05 19:36:35,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 236 flow [2022-12-05 19:36:35,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 19:36:35,632 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 208 flow [2022-12-05 19:36:35,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=208, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2022-12-05 19:36:35,637 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, -3 predicate places. [2022-12-05 19:36:35,637 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 208 flow [2022-12-05 19:36:35,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:35,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:36:35,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:36:35,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 19:36:35,638 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:36:35,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:36:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1130460435, now seen corresponding path program 1 times [2022-12-05 19:36:35,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:36:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868129243] [2022-12-05 19:36:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:36:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:36:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:36:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:36:36,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:36:36,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868129243] [2022-12-05 19:36:36,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868129243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:36:36,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:36:36,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 19:36:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319493642] [2022-12-05 19:36:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:36:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 19:36:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:36:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 19:36:36,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 19:36:36,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2022-12-05 19:36:36,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:36,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:36:36,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2022-12-05 19:36:36,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:36:36,189 INFO L130 PetriNetUnfolder]: 14/153 cut-off events. [2022-12-05 19:36:36,190 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 19:36:36,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 153 events. 14/153 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 296 event pairs, 2 based on Foata normal form. 1/141 useless extension candidates. Maximal degree in co-relation 195. Up to 19 conditions per place. [2022-12-05 19:36:36,191 INFO L137 encePairwiseOnDemand]: 117/122 looper letters, 23 selfloop transitions, 2 changer transitions 4/111 dead transitions. [2022-12-05 19:36:36,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 111 transitions, 287 flow [2022-12-05 19:36:36,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 19:36:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 19:36:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2022-12-05 19:36:36,196 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7950819672131147 [2022-12-05 19:36:36,196 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 208 flow. Second operand 5 states and 485 transitions. [2022-12-05 19:36:36,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 111 transitions, 287 flow [2022-12-05 19:36:36,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 111 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 19:36:36,200 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 224 flow [2022-12-05 19:36:36,200 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2022-12-05 19:36:36,201 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 1 predicate places. [2022-12-05 19:36:36,201 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 224 flow [2022-12-05 19:36:36,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:36,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:36:36,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:36:36,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 19:36:36,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:36:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:36:36,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1540366149, now seen corresponding path program 1 times [2022-12-05 19:36:36,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:36:36,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961414553] [2022-12-05 19:36:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:36:36,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:36:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:36:36,391 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-05 19:36:36,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:36:36,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961414553] [2022-12-05 19:36:36,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961414553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:36:36,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:36:36,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:36:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397557053] [2022-12-05 19:36:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:36:36,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:36:36,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:36:36,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:36:36,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:36:36,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 122 [2022-12-05 19:36:36,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:36,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:36:36,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 122 [2022-12-05 19:36:36,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:36:36,491 INFO L130 PetriNetUnfolder]: 18/174 cut-off events. [2022-12-05 19:36:36,491 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-05 19:36:36,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 174 events. 18/174 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 344 event pairs, 3 based on Foata normal form. 3/161 useless extension candidates. Maximal degree in co-relation 223. Up to 30 conditions per place. [2022-12-05 19:36:36,495 INFO L137 encePairwiseOnDemand]: 118/122 looper letters, 13 selfloop transitions, 3 changer transitions 2/108 dead transitions. [2022-12-05 19:36:36,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 272 flow [2022-12-05 19:36:36,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:36:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:36:36,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-12-05 19:36:36,503 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2022-12-05 19:36:36,504 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 224 flow. Second operand 3 states and 324 transitions. [2022-12-05 19:36:36,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 108 transitions, 272 flow [2022-12-05 19:36:36,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 108 transitions, 266 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 19:36:36,510 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 237 flow [2022-12-05 19:36:36,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2022-12-05 19:36:36,512 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, -1 predicate places. [2022-12-05 19:36:36,512 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 237 flow [2022-12-05 19:36:36,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:36,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:36:36,513 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:36:36,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 19:36:36,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:36:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:36:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 172962165, now seen corresponding path program 1 times [2022-12-05 19:36:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:36:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397116604] [2022-12-05 19:36:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:36:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:36:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:36:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:36:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:36:36,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397116604] [2022-12-05 19:36:36,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397116604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:36:36,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:36:36,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 19:36:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429314771] [2022-12-05 19:36:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:36:36,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 19:36:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:36:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 19:36:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 19:36:36,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 122 [2022-12-05 19:36:36,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:36,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:36:36,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 122 [2022-12-05 19:36:36,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:36:36,961 INFO L130 PetriNetUnfolder]: 27/250 cut-off events. [2022-12-05 19:36:36,962 INFO L131 PetriNetUnfolder]: For 46/50 co-relation queries the response was YES. [2022-12-05 19:36:36,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 250 events. 27/250 cut-off events. For 46/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 759 event pairs, 8 based on Foata normal form. 2/231 useless extension candidates. Maximal degree in co-relation 363. Up to 43 conditions per place. [2022-12-05 19:36:36,966 INFO L137 encePairwiseOnDemand]: 114/122 looper letters, 23 selfloop transitions, 6 changer transitions 10/119 dead transitions. [2022-12-05 19:36:36,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 119 transitions, 357 flow [2022-12-05 19:36:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 19:36:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 19:36:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 679 transitions. [2022-12-05 19:36:36,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7950819672131147 [2022-12-05 19:36:36,970 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 237 flow. Second operand 7 states and 679 transitions. [2022-12-05 19:36:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 119 transitions, 357 flow [2022-12-05 19:36:36,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 119 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 19:36:36,978 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 256 flow [2022-12-05 19:36:36,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2022-12-05 19:36:36,980 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 6 predicate places. [2022-12-05 19:36:36,980 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 256 flow [2022-12-05 19:36:36,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:36,981 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:36:36,981 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:36:36,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 19:36:36,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:36:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:36:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash 706141367, now seen corresponding path program 1 times [2022-12-05 19:36:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:36:36,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645946835] [2022-12-05 19:36:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:36:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:36:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:36:38,485 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-05 19:36:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:36:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645946835] [2022-12-05 19:36:38,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645946835] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:36:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354798310] [2022-12-05 19:36:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:36:38,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:36:38,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:36:38,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:36:38,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-05 19:36:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:36:38,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-05 19:36:38,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:36:39,479 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-05 19:36:39,891 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-05 19:36:39,969 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-05 19:36:40,184 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 25 treesize of output 7 [2022-12-05 19:36:40,240 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-05 19:36:40,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:36:40,939 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (not (< (+ c_~sum~0 (select .cse0 .cse2)) 0))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse3 .cse1) 1)) (not (< 1 (+ c_~sum~0 (select .cse3 .cse2))))))))) (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0)) is different from false [2022-12-05 19:36:41,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:36:41,813 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 63 treesize of output 51 [2022-12-05 19:36:41,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:36:41,825 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 325 treesize of output 305 [2022-12-05 19:36:41,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:36:41,837 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 293 treesize of output 281 [2022-12-05 19:36:41,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:36:41,849 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 269 treesize of output 233 [2022-12-05 19:36:42,049 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:36:42,050 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 63 treesize of output 51 [2022-12-05 19:36:42,063 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-05 19:36:42,063 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 153 treesize of output 141 [2022-12-05 19:36:42,074 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-05 19:36:42,075 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 137 treesize of output 117 [2022-12-05 19:36:42,089 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-05 19:36:42,090 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 113 treesize of output 105 [2022-12-05 19:36:43,026 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-05 19:36:43,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354798310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:36:43,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:36:43,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 23] total 63 [2022-12-05 19:36:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248219062] [2022-12-05 19:36:43,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:36:43,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-05 19:36:43,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:36:43,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-05 19:36:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=611, Invalid=3126, Unknown=49, NotChecked=120, Total=3906 [2022-12-05 19:36:43,035 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2022-12-05 19:36:43,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 256 flow. Second operand has 63 states, 63 states have (on average 49.36507936507937) internal successors, (3110), 63 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:36:43,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:36:43,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2022-12-05 19:36:43,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:36:52,774 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~front~0 4))) (let ((.cse26 (select |c_#memory_int| c_~queue~0.base)) (.cse24 (+ c_~queue~0.offset .cse12)) (.cse13 (* c_~back~0 4))) (let ((.cse15 (+ c_~back~0 1)) (.cse23 (+ c_~queue~0.offset .cse13)) (.cse2 (select .cse26 .cse24))) (let ((.cse0 (<= .cse24 0)) (.cse5 (= c_~queue~0.offset 0)) (.cse21 (let ((.cse31 (+ c_~sum~0 .cse2))) (and (not (< .cse31 0)) (not (< 1 .cse31))))) (.cse1 (not (= .cse24 0))) (.cse3 (= c_~sum~0 0)) (.cse4 (= .cse23 0)) (.cse16 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse12 .cse13))) (.cse6 (<= c_~n~0 c_~front~0)) (.cse7 (<= .cse15 c_~front~0)) (.cse14 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or (and .cse0 (or .cse1 (and (or (not (= .cse2 1)) .cse3) .cse4)) .cse5) (and (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0))) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (or .cse6 .cse7 (let ((.cse10 (+ .cse13 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse9 (+ .cse12 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< (+ c_~sum~0 (select .cse8 .cse9)) 0)) (not (= (select .cse8 .cse10) 1))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse11 .cse10) 1)) (not (< 1 (+ c_~sum~0 (select .cse11 .cse9))))))))) .cse14) (or .cse0 (<= (+ c_~front~0 c_~n~0) .cse15)) (or .cse16 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7 .cse14) (or .cse6 .cse7 (let ((.cse18 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse19 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse17 .cse18) 1)) (not (< 1 (+ (select .cse17 .cse19) c_~sum~0)))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse20 .cse18) 1)) (not (< (+ (select .cse20 .cse19) c_~sum~0) 0))))))) .cse14) (or .cse6 (<= c_~back~0 c_~front~0) .cse14 .cse21) (or .cse16 (< 0 c_~front~0) .cse7 .cse14) (or .cse16 .cse6 .cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse14) .cse5 (<= c_~sum~0 1) (or (and (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse22 .cse23) 1)) (not (< (+ c_~sum~0 (select .cse22 .cse24)) 0))))) (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse25 .cse23) 1)) (not (< 1 (+ c_~sum~0 (select .cse25 .cse24)))))))) .cse6 .cse7 .cse14) (or .cse6 .cse7 .cse14 .cse21 (not (= (select .cse26 .cse23) 1))) (or (let ((.cse28 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse27 .cse28) 1)) (not (< (+ c_~sum~0 (select .cse27 .cse29)) 0))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse30 .cse28) 1)) (not (< 1 (+ c_~sum~0 (select .cse30 .cse29))))))))) .cse6 .cse7 .cse14) (or .cse1 (and (or (not .cse4) .cse3) (or (and (not (<= (+ c_~queue~0.offset .cse13 1) 0)) (<= c_~n~0 1)) .cse4))) (or .cse16 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7 .cse14 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))))) is different from false [2022-12-05 19:36:55,464 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse21 (+ c_~queue~0.offset .cse9)) (.cse24 (select |c_#memory_int| c_~queue~0.base)) (.cse22 (+ c_~queue~0.offset .cse8))) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (<= .cse22 0)) (.cse29 (not (= .cse22 0))) (.cse33 (select .cse24 .cse22)) (.cse31 (= c_~sum~0 0)) (.cse30 (= .cse21 0)) (.cse19 (= c_~queue~0.offset 0))) (let ((.cse0 (and .cse11 (or .cse29 (and (or (not (= .cse33 1)) .cse31) .cse30)) .cse19)) (.cse1 (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0)))) (.cse18 (let ((.cse32 (+ c_~sum~0 .cse33))) (and (not (< .cse32 0)) (not (< 1 .cse32))))) (.cse13 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 .cse9))) (.cse2 (<= c_~n~0 c_~front~0)) (.cse3 (<= .cse12 c_~front~0)) (.cse10 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or .cse0 (and .cse1 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (or .cse2 .cse3 (let ((.cse6 (+ .cse9 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse5 (+ .cse8 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< (+ c_~sum~0 (select .cse4 .cse5)) 0)) (not (= (select .cse4 .cse6) 1))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse7 .cse6) 1)) (not (< 1 (+ c_~sum~0 (select .cse7 .cse5))))))))) .cse10) (or .cse11 (<= (+ c_~front~0 c_~n~0) .cse12)) (or .cse13 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 .cse10) (or .cse2 .cse3 (let ((.cse15 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse16 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse14 .cse15) 1)) (not (< 1 (+ (select .cse14 .cse16) c_~sum~0)))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse17 .cse15) 1)) (not (< (+ (select .cse17 .cse16) c_~sum~0) 0))))))) .cse10) (or .cse2 (<= c_~back~0 c_~front~0) .cse10 .cse18) (or .cse13 (< 0 c_~front~0) .cse3 .cse10) (or .cse0 (and .cse1 (= 0 |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|))) (or .cse13 .cse2 .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse10) .cse19 (<= c_~sum~0 1) (or (and (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse20 .cse21) 1)) (not (< (+ c_~sum~0 (select .cse20 .cse22)) 0))))) (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse23 .cse21) 1)) (not (< 1 (+ c_~sum~0 (select .cse23 .cse22)))))))) .cse2 .cse3 .cse10) (or .cse2 .cse3 .cse10 .cse18 (not (= (select .cse24 .cse21) 1))) (or (let ((.cse26 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse25 .cse26) 1)) (not (< (+ c_~sum~0 (select .cse25 .cse27)) 0))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse28 .cse26) 1)) (not (< 1 (+ c_~sum~0 (select .cse28 .cse27))))))))) .cse2 .cse3 .cse10) (or .cse29 (and (or (not .cse30) .cse31) (or (and (not (<= (+ c_~queue~0.offset .cse9 1) 0)) (<= c_~n~0 1)) .cse30))) (or .cse13 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 .cse10 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))))) is different from false [2022-12-05 19:36:55,680 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse21 (+ c_~queue~0.offset .cse9)) (.cse24 (select |c_#memory_int| c_~queue~0.base)) (.cse22 (+ c_~queue~0.offset .cse8))) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (<= .cse22 0)) (.cse29 (not (= .cse22 0))) (.cse33 (select .cse24 .cse22)) (.cse31 (= c_~sum~0 0)) (.cse30 (= .cse21 0)) (.cse19 (= c_~queue~0.offset 0))) (let ((.cse0 (and .cse11 (or .cse29 (and (or (not (= .cse33 1)) .cse31) .cse30)) .cse19)) (.cse1 (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0)))) (.cse18 (let ((.cse32 (+ c_~sum~0 .cse33))) (and (not (< .cse32 0)) (not (< 1 .cse32))))) (.cse13 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 .cse9))) (.cse2 (<= c_~n~0 c_~front~0)) (.cse3 (<= .cse12 c_~front~0)) (.cse10 (< c_~front~0 0))) (and (or .cse0 (and .cse1 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (or .cse2 .cse3 (let ((.cse6 (+ .cse9 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse5 (+ .cse8 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< (+ c_~sum~0 (select .cse4 .cse5)) 0)) (not (= (select .cse4 .cse6) 1))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse7 .cse6) 1)) (not (< 1 (+ c_~sum~0 (select .cse7 .cse5))))))))) .cse10) (or .cse11 (<= (+ c_~front~0 c_~n~0) .cse12)) (or .cse13 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 .cse10) (or .cse2 .cse3 (let ((.cse15 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse16 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse14 .cse15) 1)) (not (< 1 (+ (select .cse14 .cse16) c_~sum~0)))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse17 .cse15) 1)) (not (< (+ (select .cse17 .cse16) c_~sum~0) 0))))))) .cse10) (or .cse2 (<= c_~back~0 c_~front~0) .cse10 .cse18) (or .cse13 (< 0 c_~front~0) .cse3 .cse10) (or .cse0 (and .cse1 (= 0 |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|))) (or .cse13 .cse2 .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse10) .cse19 (or (and (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse20 .cse21) 1)) (not (< (+ c_~sum~0 (select .cse20 .cse22)) 0))))) (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse23 .cse21) 1)) (not (< 1 (+ c_~sum~0 (select .cse23 .cse22)))))))) .cse2 .cse3 .cse10) (or .cse2 .cse3 .cse10 .cse18 (not (= (select .cse24 .cse21) 1))) (or (let ((.cse26 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse25 .cse26) 1)) (not (< (+ c_~sum~0 (select .cse25 .cse27)) 0))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse28 .cse26) 1)) (not (< 1 (+ c_~sum~0 (select .cse28 .cse27))))))))) .cse2 .cse3 .cse10) (or .cse29 (and (or (not .cse30) .cse31) (or (and (not (<= (+ c_~queue~0.offset .cse9 1) 0)) (<= c_~n~0 1)) .cse30))) (or .cse13 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 .cse10 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))))) is different from false [2022-12-05 19:36:57,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~front~0 4))) (let ((.cse26 (select |c_#memory_int| c_~queue~0.base)) (.cse24 (+ c_~queue~0.offset .cse12)) (.cse13 (* c_~back~0 4))) (let ((.cse15 (+ c_~back~0 1)) (.cse23 (+ c_~queue~0.offset .cse13)) (.cse2 (select .cse26 .cse24))) (let ((.cse0 (<= .cse24 0)) (.cse5 (= c_~queue~0.offset 0)) (.cse21 (let ((.cse31 (+ c_~sum~0 .cse2))) (and (not (< .cse31 0)) (not (< 1 .cse31))))) (.cse1 (not (= .cse24 0))) (.cse3 (= c_~sum~0 0)) (.cse4 (= .cse23 0)) (.cse16 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse12 .cse13))) (.cse6 (<= c_~n~0 c_~front~0)) (.cse7 (<= .cse15 c_~front~0)) (.cse14 (< c_~front~0 0))) (and (or (and .cse0 (or .cse1 (and (or (not (= .cse2 1)) .cse3) .cse4)) .cse5) (and (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0))) (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0))) (or .cse6 .cse7 (let ((.cse10 (+ .cse13 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse9 (+ .cse12 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< (+ c_~sum~0 (select .cse8 .cse9)) 0)) (not (= (select .cse8 .cse10) 1))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse11 .cse10) 1)) (not (< 1 (+ c_~sum~0 (select .cse11 .cse9))))))))) .cse14) (or .cse0 (<= (+ c_~front~0 c_~n~0) .cse15)) (or .cse16 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7 .cse14) (or .cse6 .cse7 (let ((.cse18 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse19 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse17 .cse18) 1)) (not (< 1 (+ (select .cse17 .cse19) c_~sum~0)))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse20 .cse18) 1)) (not (< (+ (select .cse20 .cse19) c_~sum~0) 0))))))) .cse14) (or .cse6 (<= c_~back~0 c_~front~0) .cse14 .cse21) (or .cse16 .cse6 .cse7 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse14) .cse5 (or (and (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse22 .cse23) 1)) (not (< (+ c_~sum~0 (select .cse22 .cse24)) 0))))) (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse25 .cse23) 1)) (not (< 1 (+ c_~sum~0 (select .cse25 .cse24)))))))) .cse6 .cse7 .cse14) (or .cse6 .cse7 .cse14 .cse21 (not (= (select .cse26 .cse23) 1))) (or (let ((.cse28 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse27 .cse28) 1)) (not (< (+ c_~sum~0 (select .cse27 .cse29)) 0))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse30 .cse28) 1)) (not (< 1 (+ c_~sum~0 (select .cse30 .cse29))))))))) .cse6 .cse7 .cse14) (or .cse1 (and (or (not .cse4) .cse3) (or (and (not (<= (+ c_~queue~0.offset .cse13 1) 0)) (<= c_~n~0 1)) .cse4))) (or .cse16 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7 .cse14 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))))) is different from false [2022-12-05 19:36:57,462 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse15 (+ c_~queue~0.offset .cse8)) (.cse0 (+ c_~queue~0.offset .cse7)) (.cse10 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse7 .cse8))) (.cse1 (<= c_~n~0 c_~front~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse9 (< c_~front~0 0))) (and (<= .cse0 0) (or .cse1 .cse2 (let ((.cse5 (+ .cse8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse4 (+ .cse7 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< (+ c_~sum~0 (select .cse3 .cse4)) 0)) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse6 .cse5) 1)) (not (< 1 (+ c_~sum~0 (select .cse6 .cse4))))))))) .cse9) (or .cse10 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse9) (or .cse1 .cse2 (let ((.cse12 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse13 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse11 .cse12) 1)) (not (< 1 (+ (select .cse11 .cse13) c_~sum~0)))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse14 .cse12) 1)) (not (< (+ (select .cse14 .cse13) c_~sum~0) 0))))))) .cse9) (or .cse10 (< 0 c_~front~0) .cse2 .cse9) (or .cse10 .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse9) (or (not (= .cse0 0)) (and (or (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse0) 1)) (= c_~sum~0 0)) (= .cse15 0))) (= c_~queue~0.offset 0) (or (and (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse16 .cse15) 1)) (not (< (+ c_~sum~0 (select .cse16 .cse0)) 0))))) (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse17 .cse15) 1)) (not (< 1 (+ c_~sum~0 (select .cse17 .cse0)))))))) .cse1 .cse2 .cse9) (or (let ((.cse19 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse18 .cse19) 1)) (not (< (+ c_~sum~0 (select .cse18 .cse20)) 0))))) (forall ((v_ArrVal_67 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_67) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse21 .cse19) 1)) (not (< 1 (+ c_~sum~0 (select .cse21 .cse20))))))))) .cse1 .cse2 .cse9) (or .cse10 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse9 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) is different from false [2022-12-05 19:37:00,872 INFO L130 PetriNetUnfolder]: 761/2571 cut-off events. [2022-12-05 19:37:00,872 INFO L131 PetriNetUnfolder]: For 918/924 co-relation queries the response was YES. [2022-12-05 19:37:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4609 conditions, 2571 events. 761/2571 cut-off events. For 918/924 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 21960 event pairs, 56 based on Foata normal form. 31/2299 useless extension candidates. Maximal degree in co-relation 4601. Up to 251 conditions per place. [2022-12-05 19:37:00,884 INFO L137 encePairwiseOnDemand]: 79/122 looper letters, 230 selfloop transitions, 150 changer transitions 128/550 dead transitions. [2022-12-05 19:37:00,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 550 transitions, 2468 flow [2022-12-05 19:37:00,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-12-05 19:37:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2022-12-05 19:37:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 4984 transitions. [2022-12-05 19:37:00,898 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43002588438308886 [2022-12-05 19:37:00,898 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 256 flow. Second operand 95 states and 4984 transitions. [2022-12-05 19:37:00,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 550 transitions, 2468 flow [2022-12-05 19:37:00,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 550 transitions, 2436 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-05 19:37:00,910 INFO L231 Difference]: Finished difference. Result has 262 places, 241 transitions, 1364 flow [2022-12-05 19:37:00,910 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=1364, PETRI_PLACES=262, PETRI_TRANSITIONS=241} [2022-12-05 19:37:00,911 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 154 predicate places. [2022-12-05 19:37:00,911 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 241 transitions, 1364 flow [2022-12-05 19:37:00,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 49.36507936507937) internal successors, (3110), 63 states have internal predecessors, (3110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:00,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:00,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:37:00,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-05 19:37:01,119 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-05 19:37:01,120 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:01,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash 26618805, now seen corresponding path program 1 times [2022-12-05 19:37:01,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:01,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196847067] [2022-12-05 19:37:01,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:01,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:37:01,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:01,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196847067] [2022-12-05 19:37:01,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196847067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 19:37:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 19:37:01,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 19:37:01,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020470691] [2022-12-05 19:37:01,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 19:37:01,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 19:37:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:01,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 19:37:01,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 19:37:01,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 122 [2022-12-05 19:37:01,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 241 transitions, 1364 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:01,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:01,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 122 [2022-12-05 19:37:01,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:01,582 INFO L130 PetriNetUnfolder]: 513/1968 cut-off events. [2022-12-05 19:37:01,582 INFO L131 PetriNetUnfolder]: For 12369/12501 co-relation queries the response was YES. [2022-12-05 19:37:01,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6923 conditions, 1968 events. 513/1968 cut-off events. For 12369/12501 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 15975 event pairs, 172 based on Foata normal form. 18/1783 useless extension candidates. Maximal degree in co-relation 6856. Up to 621 conditions per place. [2022-12-05 19:37:01,602 INFO L137 encePairwiseOnDemand]: 119/122 looper letters, 86 selfloop transitions, 2 changer transitions 1/220 dead transitions. [2022-12-05 19:37:01,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 220 transitions, 1403 flow [2022-12-05 19:37:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 19:37:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 19:37:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-12-05 19:37:01,603 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8934426229508197 [2022-12-05 19:37:01,604 INFO L175 Difference]: Start difference. First operand has 262 places, 241 transitions, 1364 flow. Second operand 3 states and 327 transitions. [2022-12-05 19:37:01,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 220 transitions, 1403 flow [2022-12-05 19:37:01,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 220 transitions, 1168 flow, removed 92 selfloop flow, removed 40 redundant places. [2022-12-05 19:37:01,651 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 936 flow [2022-12-05 19:37:01,651 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=936, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2022-12-05 19:37:01,654 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 90 predicate places. [2022-12-05 19:37:01,654 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 936 flow [2022-12-05 19:37:01,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:01,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:01,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 19:37:01,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 19:37:01,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash 319788713, now seen corresponding path program 2 times [2022-12-05 19:37:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:01,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890477299] [2022-12-05 19:37:01,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:37:02,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:02,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890477299] [2022-12-05 19:37:02,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890477299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:02,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244844907] [2022-12-05 19:37:02,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:37:02,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:02,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:02,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-05 19:37:02,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:37:02,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:37:02,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-05 19:37:02,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:02,159 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-05 19:37:02,620 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-05 19:37:02,621 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-05 19:37:02,811 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-05 19:37:03,129 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-05 19:37:03,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:37:03,358 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 25 treesize of output 7 [2022-12-05 19:37:03,395 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-05 19:37:03,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:03,988 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= (select .cse3 .cse2) 1))))))) (< c_~front~0 0)) is different from false [2022-12-05 19:37:04,157 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse3 .cse2) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse1)))))))) (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0)) is different from false [2022-12-05 19:37:04,395 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0) (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= 1 (select .cse0 .cse2)))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse1)) 1) (not (= 1 (select .cse3 .cse2))))))))) is different from false [2022-12-05 19:37:04,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:04,537 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-05 19:37:04,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:04,549 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 316 treesize of output 296 [2022-12-05 19:37:04,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:04,565 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 284 treesize of output 272 [2022-12-05 19:37:04,580 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:04,580 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 260 treesize of output 224 [2022-12-05 19:37:04,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:04,761 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-05 19:37:04,773 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-05 19:37:04,773 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 148 treesize of output 136 [2022-12-05 19:37:04,785 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-05 19:37:04,785 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 132 treesize of output 112 [2022-12-05 19:37:04,797 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-05 19:37:04,797 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 83 treesize of output 75 [2022-12-05 19:37:04,838 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 19:37:05,827 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-05 19:37:05,876 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-05 19:37:05,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244844907] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:37:05,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:37:05,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 25] total 51 [2022-12-05 19:37:05,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348796804] [2022-12-05 19:37:05,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:37:05,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-05 19:37:05,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-05 19:37:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=1650, Unknown=45, NotChecked=282, Total=2550 [2022-12-05 19:37:05,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 122 [2022-12-05 19:37:05,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 936 flow. Second operand has 51 states, 51 states have (on average 50.78431372549019) internal successors, (2590), 51 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:05,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:05,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 122 [2022-12-05 19:37:05,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:10,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4))) (let ((.cse15 (* c_~back~0 4)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~queue~0.offset .cse16))) (let ((.cse4 (let ((.cse21 (+ c_~sum~0 (select .cse5 .cse9)))) (and (<= .cse21 1) (<= 0 .cse21)))) (.cse7 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_9| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_9|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc18#1.base_9| |c_#StackHeapBarrier|))))) (.cse6 (+ c_~queue~0.offset .cse15)) (.cse0 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse16 .cse15))) (.cse1 (<= c_~n~0 c_~front~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< c_~front~0 0))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse3) (or .cse1 (<= c_~back~0 c_~front~0) .cse4 .cse3) (= c_~sum~0 1) (or .cse1 .cse2 .cse4 .cse3 (not (= (select .cse5 .cse6) 1))) (or .cse0 .cse7 (< 0 c_~front~0) .cse2 .cse3) (or .cse0 .cse7 .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) c_~queue~0.base))) (or (not (= (select .cse8 .cse6) 1)) (<= (+ c_~sum~0 (select .cse8 .cse9)) 1)))) (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse9))) (not (= (select .cse10 .cse6) 1))))))) (or .cse1 .cse2 .cse3 (let ((.cse12 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse13 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse11 .cse12))) (not (= 1 (select .cse11 .cse13)))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse14 .cse12)) 1) (not (= 1 (select .cse14 .cse13))))))))) (or (let ((.cse19 (+ .cse15 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse18 (+ .cse16 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse17 .cse18))) (not (= (select .cse17 .cse19) 1))))) (forall ((v_ArrVal_108 (Array Int Int)) (v_ArrVal_109 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_108) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_109) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse20 .cse19) 1)) (<= (+ c_~sum~0 (select .cse20 .cse18)) 1)))))) .cse1 .cse2 .cse3) (or .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse3 (not (< 0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))))) is different from false [2022-12-05 19:37:11,563 INFO L130 PetriNetUnfolder]: 863/3210 cut-off events. [2022-12-05 19:37:11,563 INFO L131 PetriNetUnfolder]: For 16944/17010 co-relation queries the response was YES. [2022-12-05 19:37:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11189 conditions, 3210 events. 863/3210 cut-off events. For 16944/17010 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 29265 event pairs, 187 based on Foata normal form. 50/3098 useless extension candidates. Maximal degree in co-relation 11141. Up to 626 conditions per place. [2022-12-05 19:37:11,585 INFO L137 encePairwiseOnDemand]: 85/122 looper letters, 158 selfloop transitions, 126 changer transitions 34/378 dead transitions. [2022-12-05 19:37:11,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 378 transitions, 2709 flow [2022-12-05 19:37:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-05 19:37:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-05 19:37:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2345 transitions. [2022-12-05 19:37:11,590 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42714025500910746 [2022-12-05 19:37:11,590 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 936 flow. Second operand 45 states and 2345 transitions. [2022-12-05 19:37:11,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 378 transitions, 2709 flow [2022-12-05 19:37:11,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 378 transitions, 2707 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 19:37:11,634 INFO L231 Difference]: Finished difference. Result has 254 places, 270 transitions, 1773 flow [2022-12-05 19:37:11,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1773, PETRI_PLACES=254, PETRI_TRANSITIONS=270} [2022-12-05 19:37:11,635 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 146 predicate places. [2022-12-05 19:37:11,635 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 270 transitions, 1773 flow [2022-12-05 19:37:11,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 50.78431372549019) internal successors, (2590), 51 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:11,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:11,636 INFO L213 CegarLoopForPetriNet]: trace histogram [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] [2022-12-05 19:37:11,642 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-05 19:37:11,841 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,SelfDestructingSolverStorable6 [2022-12-05 19:37:11,842 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash -35224687, now seen corresponding path program 3 times [2022-12-05 19:37:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:11,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683902498] [2022-12-05 19:37:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:11,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:37:11,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:11,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683902498] [2022-12-05 19:37:11,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683902498] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:11,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749027196] [2022-12-05 19:37:11,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:37:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:11,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:11,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-05 19:37:12,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-05 19:37:12,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:37:12,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-05 19:37:12,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:37:12,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:37:12,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749027196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:37:12,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:37:12,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2022-12-05 19:37:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100088502] [2022-12-05 19:37:12,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:37:12,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 19:37:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 19:37:12,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-05 19:37:12,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 122 [2022-12-05 19:37:12,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 270 transitions, 1773 flow. Second operand has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:12,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:12,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 122 [2022-12-05 19:37:12,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:13,021 INFO L130 PetriNetUnfolder]: 836/3432 cut-off events. [2022-12-05 19:37:13,021 INFO L131 PetriNetUnfolder]: For 21159/21343 co-relation queries the response was YES. [2022-12-05 19:37:13,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12389 conditions, 3432 events. 836/3432 cut-off events. For 21159/21343 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 31536 event pairs, 339 based on Foata normal form. 79/3297 useless extension candidates. Maximal degree in co-relation 12328. Up to 642 conditions per place. [2022-12-05 19:37:13,053 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 99 selfloop transitions, 51 changer transitions 1/280 dead transitions. [2022-12-05 19:37:13,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 280 transitions, 2107 flow [2022-12-05 19:37:13,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 19:37:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 19:37:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-12-05 19:37:13,057 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8754098360655738 [2022-12-05 19:37:13,057 INFO L175 Difference]: Start difference. First operand has 254 places, 270 transitions, 1773 flow. Second operand 5 states and 534 transitions. [2022-12-05 19:37:13,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 280 transitions, 2107 flow [2022-12-05 19:37:13,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 280 transitions, 1972 flow, removed 28 selfloop flow, removed 36 redundant places. [2022-12-05 19:37:13,107 INFO L231 Difference]: Finished difference. Result has 218 places, 271 transitions, 1837 flow [2022-12-05 19:37:13,108 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1837, PETRI_PLACES=218, PETRI_TRANSITIONS=271} [2022-12-05 19:37:13,111 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 110 predicate places. [2022-12-05 19:37:13,111 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 271 transitions, 1837 flow [2022-12-05 19:37:13,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.71428571428571) internal successors, (733), 7 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:13,112 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:13,112 INFO L213 CegarLoopForPetriNet]: trace histogram [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] [2022-12-05 19:37:13,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 19:37:13,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:13,318 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash -176773509, now seen corresponding path program 4 times [2022-12-05 19:37:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:13,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829899359] [2022-12-05 19:37:13,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-05 19:37:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:13,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829899359] [2022-12-05 19:37:13,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829899359] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:13,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483178876] [2022-12-05 19:37:13,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 19:37:13,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:13,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:13,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:13,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-05 19:37:13,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 19:37:13,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:37:13,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 19:37:13,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:13,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:14,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483178876] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:37:14,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:37:14,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 12] total 23 [2022-12-05 19:37:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254763647] [2022-12-05 19:37:14,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:37:14,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-05 19:37:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:14,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-05 19:37:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2022-12-05 19:37:14,377 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 122 [2022-12-05 19:37:14,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 271 transitions, 1837 flow. Second operand has 23 states, 23 states have (on average 83.1304347826087) internal successors, (1912), 23 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:14,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:14,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 122 [2022-12-05 19:37:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:16,024 INFO L130 PetriNetUnfolder]: 1020/4101 cut-off events. [2022-12-05 19:37:16,024 INFO L131 PetriNetUnfolder]: For 26804/27032 co-relation queries the response was YES. [2022-12-05 19:37:16,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15505 conditions, 4101 events. 1020/4101 cut-off events. For 26804/27032 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 39147 event pairs, 392 based on Foata normal form. 216/4015 useless extension candidates. Maximal degree in co-relation 15448. Up to 787 conditions per place. [2022-12-05 19:37:16,051 INFO L137 encePairwiseOnDemand]: 100/122 looper letters, 140 selfloop transitions, 54 changer transitions 63/336 dead transitions. [2022-12-05 19:37:16,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 336 transitions, 2940 flow [2022-12-05 19:37:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-05 19:37:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-05 19:37:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2432 transitions. [2022-12-05 19:37:16,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6873940079140758 [2022-12-05 19:37:16,056 INFO L175 Difference]: Start difference. First operand has 218 places, 271 transitions, 1837 flow. Second operand 29 states and 2432 transitions. [2022-12-05 19:37:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 336 transitions, 2940 flow [2022-12-05 19:37:16,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 336 transitions, 2883 flow, removed 19 selfloop flow, removed 12 redundant places. [2022-12-05 19:37:16,097 INFO L231 Difference]: Finished difference. Result has 240 places, 220 transitions, 1511 flow [2022-12-05 19:37:16,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1511, PETRI_PLACES=240, PETRI_TRANSITIONS=220} [2022-12-05 19:37:16,098 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 132 predicate places. [2022-12-05 19:37:16,098 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 220 transitions, 1511 flow [2022-12-05 19:37:16,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 83.1304347826087) internal successors, (1912), 23 states have internal predecessors, (1912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:16,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:16,099 INFO L213 CegarLoopForPetriNet]: trace histogram [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] [2022-12-05 19:37:16,107 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-05 19:37:16,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:16,305 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1933328771, now seen corresponding path program 1 times [2022-12-05 19:37:16,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:16,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617838201] [2022-12-05 19:37:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:16,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617838201] [2022-12-05 19:37:16,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617838201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:16,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307619200] [2022-12-05 19:37:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:16,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:16,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:16,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:16,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-05 19:37:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:16,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-05 19:37:16,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:17,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:17,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307619200] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:37:17,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:37:17,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 32 [2022-12-05 19:37:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818145956] [2022-12-05 19:37:17,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:37:17,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-05 19:37:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-05 19:37:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2022-12-05 19:37:17,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 122 [2022-12-05 19:37:17,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 220 transitions, 1511 flow. Second operand has 32 states, 32 states have (on average 85.53125) internal successors, (2737), 32 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:17,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:17,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 122 [2022-12-05 19:37:17,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:18,784 INFO L130 PetriNetUnfolder]: 465/2221 cut-off events. [2022-12-05 19:37:18,784 INFO L131 PetriNetUnfolder]: For 22715/22795 co-relation queries the response was YES. [2022-12-05 19:37:18,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 2221 events. 465/2221 cut-off events. For 22715/22795 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 17949 event pairs, 301 based on Foata normal form. 45/2093 useless extension candidates. Maximal degree in co-relation 9263. Up to 728 conditions per place. [2022-12-05 19:37:18,842 INFO L137 encePairwiseOnDemand]: 104/122 looper letters, 54 selfloop transitions, 16 changer transitions 41/184 dead transitions. [2022-12-05 19:37:18,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 184 transitions, 1389 flow [2022-12-05 19:37:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-05 19:37:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-05 19:37:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2067 transitions. [2022-12-05 19:37:18,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7059426229508197 [2022-12-05 19:37:18,845 INFO L175 Difference]: Start difference. First operand has 240 places, 220 transitions, 1511 flow. Second operand 24 states and 2067 transitions. [2022-12-05 19:37:18,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 184 transitions, 1389 flow [2022-12-05 19:37:18,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 184 transitions, 1212 flow, removed 65 selfloop flow, removed 33 redundant places. [2022-12-05 19:37:18,867 INFO L231 Difference]: Finished difference. Result has 209 places, 137 transitions, 682 flow [2022-12-05 19:37:18,867 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=682, PETRI_PLACES=209, PETRI_TRANSITIONS=137} [2022-12-05 19:37:18,868 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 101 predicate places. [2022-12-05 19:37:18,868 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 137 transitions, 682 flow [2022-12-05 19:37:18,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 85.53125) internal successors, (2737), 32 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:18,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:18,869 INFO L213 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] [2022-12-05 19:37:18,878 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-05 19:37:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-05 19:37:19,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:19,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:19,075 INFO L85 PathProgramCache]: Analyzing trace with hash -92446853, now seen corresponding path program 2 times [2022-12-05 19:37:19,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:19,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918358900] [2022-12-05 19:37:19,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:19,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-05 19:37:19,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918358900] [2022-12-05 19:37:19,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918358900] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658980075] [2022-12-05 19:37:19,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:37:19,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:19,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:19,564 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:19,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-05 19:37:19,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:37:19,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:37:19,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-05 19:37:19,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:20,315 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-05 19:37:20,602 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-05 19:37:20,663 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-05 19:37:20,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:20,969 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 48 treesize of output 14 [2022-12-05 19:37:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:20,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:21,797 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse6)) (.cse2 (+ c_~queue~0.offset .cse7)) (.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1) (not (= (+ 1 (select .cse0 .cse4)) 0))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (+ 1 (select .cse5 .cse4)) 0)))))))) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2022-12-05 19:37:22,027 WARN L837 $PredicateComparison]: unable to prove that (or (<= (+ c_~back~0 1) c_~front~0) (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse2 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse3 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ (select .cse0 .cse2) c_~sum~0 (select .cse0 .cse3)) 1) (not (= (select .cse0 .cse4) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (<= 0 (+ (select .cse5 .cse2) c_~sum~0 (select .cse5 .cse3))) (not (= (select .cse5 .cse4) 1)))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2022-12-05 19:37:22,189 WARN L837 $PredicateComparison]: unable to prove that (or (<= (+ c_~back~0 1) c_~front~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse6 (* c_~back~0 4)) (.cse7 (* c_~front~0 4))) (let ((.cse1 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0)) (not (= (select .cse0 .cse4) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse1) (select .cse5 .cse2))) (not (= (+ (select .cse5 .cse3) 1) 0)) (not (= (select .cse5 .cse4) 1)))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2022-12-05 19:37:22,362 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse6 (* c_~back~0 4)) (.cse7 (* c_~front~0 4))) (let ((.cse1 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0)) (not (= (select .cse0 .cse4) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse1) (select .cse5 .cse2))) (not (= (+ (select .cse5 .cse3) 1) 0)) (not (= (select .cse5 .cse4) 1)))))))) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2022-12-05 19:37:22,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:22,418 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 123 treesize of output 87 [2022-12-05 19:37:22,451 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-05 19:37:22,452 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 266 treesize of output 270 [2022-12-05 19:37:22,484 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-05 19:37:22,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 218 [2022-12-05 19:37:22,514 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-05 19:37:22,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 165 [2022-12-05 19:37:23,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:23,708 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 123 treesize of output 87 [2022-12-05 19:37:23,736 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-05 19:37:23,736 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 562 treesize of output 502 [2022-12-05 19:37:23,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:37:23,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-05 19:37:23,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 19:37:23,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 345 [2022-12-05 19:37:23,784 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-05 19:37:23,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 442 treesize of output 346 [2022-12-05 19:37:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-05 19:37:24,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658980075] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:37:24,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:37:24,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 30, 26] total 56 [2022-12-05 19:37:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040017655] [2022-12-05 19:37:24,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:37:24,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-05 19:37:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-05 19:37:24,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=585, Invalid=2051, Unknown=32, NotChecked=412, Total=3080 [2022-12-05 19:37:24,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 122 [2022-12-05 19:37:24,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 137 transitions, 682 flow. Second operand has 56 states, 56 states have (on average 53.839285714285715) internal successors, (3015), 56 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:24,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:24,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 122 [2022-12-05 19:37:24,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:37:28,495 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front~0 4))) (let ((.cse28 (select |c_#memory_int| c_~queue~0.base)) (.cse25 (+ c_~queue~0.offset .cse14)) (.cse13 (* c_~back~0 4))) (let ((.cse23 (+ c_~queue~0.offset .cse13)) (.cse5 (select .cse28 .cse25)) (.cse24 (+ c_~queue~0.offset .cse14 4))) (let ((.cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse22 (+ c_~queue~0.offset .cse13 4)) (.cse27 (let ((.cse30 (+ c_~sum~0 .cse5 (select .cse28 .cse24)))) (and (<= .cse30 1) (<= 0 .cse30)))) (.cse29 (select .cse28 .cse23)) (.cse0 (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse14 .cse13))) (.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (< c_~front~0 0)) (.cse3 (<= c_~n~0 (+ c_~front~0 1)))) (and (or .cse0 .cse1 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse2 .cse3) (or (<= c_~n~0 c_~front~0) (let ((.cse4 (+ c_~sum~0 .cse5))) (and (<= .cse4 1) (<= 0 .cse4))) .cse2) (or (< 0 c_~front~0) .cse0 .cse1 .cse2) (or .cse6 .cse0 .cse1 .cse2 .cse3) (or .cse1 (let ((.cse9 (+ .cse14 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse10 (+ .cse14 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse8 (+ .cse13 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse11 (+ .cse13 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse7 .cse8) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse7 .cse9) (select .cse7 .cse10))) (not (= (select .cse7 .cse11) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (<= (+ c_~sum~0 (select .cse12 .cse9) (select .cse12 .cse10)) 1) (not (= (+ (select .cse12 .cse8) 1) 0)) (not (= (select .cse12 .cse11) 1))))))) .cse2 .cse3) (or (not .cse6) .cse0 .cse1 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or .cse1 (let ((.cse16 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse15 .cse16) (select .cse15 .cse17)) 1) (not (= (+ (select .cse15 .cse18) 1) 0)) (not (= (select .cse15 .cse19) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_212) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse20 .cse16) (select .cse20 .cse17))) (not (= (+ (select .cse20 .cse18) 1) 0)) (not (= (select .cse20 .cse19) 1))))))) .cse2 .cse3) (or .cse1 (and (forall ((v_ArrVal_213 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) c_~queue~0.base))) (or (not (= (+ (select .cse21 .cse22) 1) 0)) (not (= (select .cse21 .cse23) 1)) (<= 0 (+ c_~sum~0 (select .cse21 .cse24) (select .cse21 .cse25)))))) (forall ((v_ArrVal_213 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_213) c_~queue~0.base))) (or (not (= (+ (select .cse26 .cse22) 1) 0)) (not (= (select .cse26 .cse23) 1)) (<= (+ c_~sum~0 (select .cse26 .cse24) (select .cse26 .cse25)) 1))))) .cse2 .cse3) (or .cse27 .cse1 (not (= (+ (select .cse28 .cse22) 1) 0)) .cse2 (not (= .cse29 1)) .cse3) (or .cse0 .cse1 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse2 .cse3) (or .cse27 (<= c_~back~0 c_~front~0) (not (= (+ .cse29 1) 0)) .cse2 .cse3) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse0 .cse1 .cse2 .cse3) (= c_~sum~0 0)))))) is different from false [2022-12-05 19:37:30,897 INFO L130 PetriNetUnfolder]: 1318/4843 cut-off events. [2022-12-05 19:37:30,897 INFO L131 PetriNetUnfolder]: For 32517/32763 co-relation queries the response was YES. [2022-12-05 19:37:30,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19919 conditions, 4843 events. 1318/4843 cut-off events. For 32517/32763 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 45249 event pairs, 354 based on Foata normal form. 75/4637 useless extension candidates. Maximal degree in co-relation 19872. Up to 1239 conditions per place. [2022-12-05 19:37:30,929 INFO L137 encePairwiseOnDemand]: 85/122 looper letters, 151 selfloop transitions, 109 changer transitions 85/392 dead transitions. [2022-12-05 19:37:30,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 392 transitions, 3447 flow [2022-12-05 19:37:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-12-05 19:37:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-12-05 19:37:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 3938 transitions. [2022-12-05 19:37:30,947 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45462941583929806 [2022-12-05 19:37:30,947 INFO L175 Difference]: Start difference. First operand has 209 places, 137 transitions, 682 flow. Second operand 71 states and 3938 transitions. [2022-12-05 19:37:30,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 392 transitions, 3447 flow [2022-12-05 19:37:30,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 392 transitions, 3068 flow, removed 178 selfloop flow, removed 27 redundant places. [2022-12-05 19:37:30,983 INFO L231 Difference]: Finished difference. Result has 256 places, 201 transitions, 1620 flow [2022-12-05 19:37:30,983 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=1620, PETRI_PLACES=256, PETRI_TRANSITIONS=201} [2022-12-05 19:37:30,984 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 148 predicate places. [2022-12-05 19:37:30,984 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 201 transitions, 1620 flow [2022-12-05 19:37:30,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 53.839285714285715) internal successors, (3015), 56 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:30,985 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:37:30,985 INFO L213 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] [2022-12-05 19:37:30,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 19:37:31,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:31,191 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:37:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:37:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1667245029, now seen corresponding path program 3 times [2022-12-05 19:37:31,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:37:31,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061159144] [2022-12-05 19:37:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:37:31,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:37:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:37:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:37:33,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061159144] [2022-12-05 19:37:33,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061159144] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:37:33,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574763163] [2022-12-05 19:37:33,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:37:33,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:37:33,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:37:33,075 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:37:33,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-05 19:37:33,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-05 19:37:33,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:37:33,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-05 19:37:33,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:37:33,863 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-05 19:37:34,203 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-05 19:37:34,274 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-05 19:37:34,996 INFO L321 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-12-05 19:37:34,996 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 47 treesize of output 20 [2022-12-05 19:37:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:35,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:37:51,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:51,911 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 123 treesize of output 87 [2022-12-05 19:37:51,962 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-05 19:37:51,962 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 267 treesize of output 286 [2022-12-05 19:37:52,020 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-05 19:37:52,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 234 treesize of output 236 [2022-12-05 19:37:52,073 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-05 19:37:52,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 211 [2022-12-05 19:37:53,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:37:53,671 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 123 treesize of output 87 [2022-12-05 19:37:53,697 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-05 19:37:53,697 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 563 treesize of output 505 [2022-12-05 19:37:53,723 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-05 19:37:53,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 497 treesize of output 455 [2022-12-05 19:37:53,757 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-05 19:37:53,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 447 treesize of output 355 [2022-12-05 19:37:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:37:55,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574763163] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:37:55,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:37:55,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 26] total 74 [2022-12-05 19:37:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755513912] [2022-12-05 19:37:55,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:37:55,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-05 19:37:55,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:37:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-05 19:37:55,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=4746, Unknown=30, NotChecked=0, Total=5402 [2022-12-05 19:37:55,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 122 [2022-12-05 19:37:55,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 201 transitions, 1620 flow. Second operand has 74 states, 74 states have (on average 46.486486486486484) internal successors, (3440), 74 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:37:55,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:37:55,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 122 [2022-12-05 19:37:55,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:38:49,160 WARN L233 SmtUtils]: Spent 53.32s on a formula simplification that was a NOOP. DAG size: 215 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:39:51,687 WARN L233 SmtUtils]: Spent 57.99s on a formula simplification. DAG size of input: 234 DAG size of output: 231 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:40:20,436 WARN L233 SmtUtils]: Spent 26.98s on a formula simplification. DAG size of input: 256 DAG size of output: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:41:02,458 WARN L233 SmtUtils]: Spent 33.49s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:41:05,340 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-05 19:42:05,245 WARN L233 SmtUtils]: Spent 58.91s on a formula simplification. DAG size of input: 239 DAG size of output: 236 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:42:06,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:42:09,656 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-05 19:42:15,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-05 19:42:53,085 WARN L233 SmtUtils]: Spent 36.32s on a formula simplification. DAG size of input: 252 DAG size of output: 239 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:42:56,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:42:58,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:43:01,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-05 19:43:35,188 WARN L233 SmtUtils]: Spent 30.14s on a formula simplification. DAG size of input: 254 DAG size of output: 241 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:44:08,383 WARN L233 SmtUtils]: Spent 31.69s on a formula simplification. DAG size of input: 256 DAG size of output: 243 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 19:44:10,922 INFO L130 PetriNetUnfolder]: 3363/12203 cut-off events. [2022-12-05 19:44:10,922 INFO L131 PetriNetUnfolder]: For 63910/64132 co-relation queries the response was YES. [2022-12-05 19:44:10,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46109 conditions, 12203 events. 3363/12203 cut-off events. For 63910/64132 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 131696 event pairs, 904 based on Foata normal form. 58/11548 useless extension candidates. Maximal degree in co-relation 46044. Up to 2654 conditions per place. [2022-12-05 19:44:11,015 INFO L137 encePairwiseOnDemand]: 90/122 looper letters, 388 selfloop transitions, 162 changer transitions 171/762 dead transitions. [2022-12-05 19:44:11,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 762 transitions, 8557 flow [2022-12-05 19:44:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-12-05 19:44:11,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2022-12-05 19:44:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 5497 transitions. [2022-12-05 19:44:11,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40592231575838134 [2022-12-05 19:44:11,024 INFO L175 Difference]: Start difference. First operand has 256 places, 201 transitions, 1620 flow. Second operand 111 states and 5497 transitions. [2022-12-05 19:44:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 762 transitions, 8557 flow [2022-12-05 19:44:11,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 762 transitions, 7999 flow, removed 241 selfloop flow, removed 40 redundant places. [2022-12-05 19:44:11,121 INFO L231 Difference]: Finished difference. Result has 385 places, 326 transitions, 3731 flow [2022-12-05 19:44:11,121 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=3731, PETRI_PLACES=385, PETRI_TRANSITIONS=326} [2022-12-05 19:44:11,122 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 277 predicate places. [2022-12-05 19:44:11,122 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 326 transitions, 3731 flow [2022-12-05 19:44:11,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 46.486486486486484) internal successors, (3440), 74 states have internal predecessors, (3440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:44:11,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:44:11,124 INFO L213 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] [2022-12-05 19:44:11,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-05 19:44:11,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:44:11,330 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:44:11,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:44:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1350819777, now seen corresponding path program 4 times [2022-12-05 19:44:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:44:11,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105784311] [2022-12-05 19:44:11,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:44:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:44:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:44:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:44:13,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:44:13,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105784311] [2022-12-05 19:44:13,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105784311] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:44:13,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118326633] [2022-12-05 19:44:13,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-05 19:44:13,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:44:13,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:44:13,343 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-05 19:44:13,345 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-05 19:44:13,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-05 19:44:13,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:44:13,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-05 19:44:13,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:44:15,010 INFO L321 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-12-05 19:44:15,010 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 47 treesize of output 20 [2022-12-05 19:44:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:44:15,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:44:15,655 INFO L321 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-12-05 19:44:15,655 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 76 treesize of output 66 [2022-12-05 19:44:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:44:17,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118326633] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:44:17,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:44:17,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 23] total 67 [2022-12-05 19:44:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658492223] [2022-12-05 19:44:17,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:44:17,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-05 19:44:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:44:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-05 19:44:17,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=546, Invalid=3876, Unknown=0, NotChecked=0, Total=4422 [2022-12-05 19:44:17,933 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 122 [2022-12-05 19:44:17,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 326 transitions, 3731 flow. Second operand has 67 states, 67 states have (on average 56.56716417910448) internal successors, (3790), 67 states have internal predecessors, (3790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:44:17,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:44:17,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 122 [2022-12-05 19:44:17,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:44:37,430 INFO L130 PetriNetUnfolder]: 7315/25751 cut-off events. [2022-12-05 19:44:37,431 INFO L131 PetriNetUnfolder]: For 433491/434022 co-relation queries the response was YES. [2022-12-05 19:44:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138888 conditions, 25751 events. 7315/25751 cut-off events. For 433491/434022 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 310308 event pairs, 780 based on Foata normal form. 213/24515 useless extension candidates. Maximal degree in co-relation 138765. Up to 5898 conditions per place. [2022-12-05 19:44:37,878 INFO L137 encePairwiseOnDemand]: 88/122 looper letters, 414 selfloop transitions, 575 changer transitions 190/1226 dead transitions. [2022-12-05 19:44:37,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 1226 transitions, 19524 flow [2022-12-05 19:44:37,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-12-05 19:44:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2022-12-05 19:44:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 7602 transitions. [2022-12-05 19:44:37,887 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48680840163934425 [2022-12-05 19:44:37,887 INFO L175 Difference]: Start difference. First operand has 385 places, 326 transitions, 3731 flow. Second operand 128 states and 7602 transitions. [2022-12-05 19:44:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 1226 transitions, 19524 flow [2022-12-05 19:44:38,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 1226 transitions, 18069 flow, removed 693 selfloop flow, removed 51 redundant places. [2022-12-05 19:44:38,917 INFO L231 Difference]: Finished difference. Result has 517 places, 769 transitions, 12400 flow [2022-12-05 19:44:38,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3152, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=128, PETRI_FLOW=12400, PETRI_PLACES=517, PETRI_TRANSITIONS=769} [2022-12-05 19:44:38,918 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 409 predicate places. [2022-12-05 19:44:38,918 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 769 transitions, 12400 flow [2022-12-05 19:44:38,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 56.56716417910448) internal successors, (3790), 67 states have internal predecessors, (3790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:44:38,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:44:38,919 INFO L213 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] [2022-12-05 19:44:38,924 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-05 19:44:39,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-05 19:44:39,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:44:39,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:44:39,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1024023867, now seen corresponding path program 5 times [2022-12-05 19:44:39,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:44:39,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167876220] [2022-12-05 19:44:39,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:44:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:44:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:44:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:44:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:44:41,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167876220] [2022-12-05 19:44:41,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167876220] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:44:41,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043366705] [2022-12-05 19:44:41,757 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-05 19:44:41,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:44:41,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:44:41,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:44:41,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 19:44:41,859 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-05 19:44:41,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:44:41,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-05 19:44:41,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:44:42,552 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-05 19:44:42,829 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-05 19:44:43,341 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-05 19:44:43,445 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-05 19:44:44,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:44:44,461 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 48 treesize of output 14 [2022-12-05 19:44:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:44:44,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:44:48,124 WARN L837 $PredicateComparison]: unable to prove that (or (not (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) (let ((.cse8 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse1 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse6 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_304 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse5 .cse6 v_ArrVal_304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (< (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 0)) (not (= (+ (select .cse0 .cse4) 1) 0))))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (v_ArrVal_304 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse5 .cse6 v_ArrVal_304)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse1) 1)) (not (= (+ (select .cse7 .cse4) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)))))))))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-12-05 19:44:48,200 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:44:48,200 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 2 case distinctions, treesize of input 156 treesize of output 101 [2022-12-05 19:44:48,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:44:48,237 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 571 treesize of output 555 [2022-12-05 19:44:48,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:44:48,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 503 treesize of output 451 [2022-12-05 19:44:48,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:44:48,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 399 treesize of output 399 [2022-12-05 19:44:49,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:44:49,761 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 2 case distinctions, treesize of input 156 treesize of output 101 [2022-12-05 19:44:49,790 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-05 19:44:49,790 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 571 treesize of output 511 [2022-12-05 19:44:49,819 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-05 19:44:49,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 503 treesize of output 459 [2022-12-05 19:44:49,850 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-05 19:44:49,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 451 treesize of output 355 [2022-12-05 19:44:49,941 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 19:44:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-05 19:44:51,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043366705] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:44:51,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:44:51,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 33] total 88 [2022-12-05 19:44:51,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62703460] [2022-12-05 19:44:51,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:44:51,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-12-05 19:44:51,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:44:51,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-12-05 19:44:51,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1145, Invalid=6280, Unknown=61, NotChecked=170, Total=7656 [2022-12-05 19:44:51,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2022-12-05 19:44:51,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 769 transitions, 12400 flow. Second operand has 88 states, 88 states have (on average 48.95454545454545) internal successors, (4308), 88 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:44:51,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:44:51,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2022-12-05 19:44:51,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:46:10,946 INFO L130 PetriNetUnfolder]: 14189/47155 cut-off events. [2022-12-05 19:46:10,947 INFO L131 PetriNetUnfolder]: For 2216012/2218210 co-relation queries the response was YES. [2022-12-05 19:46:11,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347837 conditions, 47155 events. 14189/47155 cut-off events. For 2216012/2218210 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 611714 event pairs, 2302 based on Foata normal form. 621/45299 useless extension candidates. Maximal degree in co-relation 347659. Up to 11499 conditions per place. [2022-12-05 19:46:12,146 INFO L137 encePairwiseOnDemand]: 84/122 looper letters, 693 selfloop transitions, 1488 changer transitions 193/2418 dead transitions. [2022-12-05 19:46:12,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 2418 transitions, 51206 flow [2022-12-05 19:46:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2022-12-05 19:46:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2022-12-05 19:46:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 7548 transitions. [2022-12-05 19:46:12,155 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4296448087431694 [2022-12-05 19:46:12,155 INFO L175 Difference]: Start difference. First operand has 517 places, 769 transitions, 12400 flow. Second operand 144 states and 7548 transitions. [2022-12-05 19:46:12,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 2418 transitions, 51206 flow [2022-12-05 19:46:17,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 2418 transitions, 41748 flow, removed 4114 selfloop flow, removed 67 redundant places. [2022-12-05 19:46:17,683 INFO L231 Difference]: Finished difference. Result has 639 places, 1831 transitions, 34145 flow [2022-12-05 19:46:17,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=9118, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=144, PETRI_FLOW=34145, PETRI_PLACES=639, PETRI_TRANSITIONS=1831} [2022-12-05 19:46:17,684 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 531 predicate places. [2022-12-05 19:46:17,684 INFO L495 AbstractCegarLoop]: Abstraction has has 639 places, 1831 transitions, 34145 flow [2022-12-05 19:46:17,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 48.95454545454545) internal successors, (4308), 88 states have internal predecessors, (4308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:46:17,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:46:17,687 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 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] [2022-12-05 19:46:17,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-05 19:46:17,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-05 19:46:17,890 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:46:17,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:46:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1138719773, now seen corresponding path program 6 times [2022-12-05 19:46:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:46:17,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109071246] [2022-12-05 19:46:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:46:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:46:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:46:18,040 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-05 19:46:18,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:46:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109071246] [2022-12-05 19:46:18,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109071246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:46:18,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612808819] [2022-12-05 19:46:18,041 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-05 19:46:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:46:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:46:18,042 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:46:18,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-05 19:46:18,396 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-05 19:46:18,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:46:18,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-05 19:46:18,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:46:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:46:18,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:46:19,677 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-05 19:46:19,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612808819] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:46:19,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:46:19,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 16] total 33 [2022-12-05 19:46:19,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645117631] [2022-12-05 19:46:19,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:46:19,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-05 19:46:19,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:46:19,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-05 19:46:19,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2022-12-05 19:46:19,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 122 [2022-12-05 19:46:19,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 639 places, 1831 transitions, 34145 flow. Second operand has 33 states, 33 states have (on average 86.12121212121212) internal successors, (2842), 33 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:46:19,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:46:19,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 122 [2022-12-05 19:46:19,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:46:30,406 INFO L130 PetriNetUnfolder]: 3771/17372 cut-off events. [2022-12-05 19:46:30,407 INFO L131 PetriNetUnfolder]: For 1463834/1464461 co-relation queries the response was YES. [2022-12-05 19:46:30,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129642 conditions, 17372 events. 3771/17372 cut-off events. For 1463834/1464461 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 219603 event pairs, 1718 based on Foata normal form. 1258/17543 useless extension candidates. Maximal degree in co-relation 129425. Up to 3710 conditions per place. [2022-12-05 19:46:30,680 INFO L137 encePairwiseOnDemand]: 102/122 looper letters, 86 selfloop transitions, 114 changer transitions 432/705 dead transitions. [2022-12-05 19:46:30,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 705 transitions, 14152 flow [2022-12-05 19:46:30,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-05 19:46:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-05 19:46:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 3955 transitions. [2022-12-05 19:46:30,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7204007285974499 [2022-12-05 19:46:30,684 INFO L175 Difference]: Start difference. First operand has 639 places, 1831 transitions, 34145 flow. Second operand 45 states and 3955 transitions. [2022-12-05 19:46:30,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 705 transitions, 14152 flow [2022-12-05 19:46:32,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 499 places, 705 transitions, 11168 flow, removed 1400 selfloop flow, removed 107 redundant places. [2022-12-05 19:46:32,941 INFO L231 Difference]: Finished difference. Result has 517 places, 235 transitions, 2882 flow [2022-12-05 19:46:32,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=5519, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2882, PETRI_PLACES=517, PETRI_TRANSITIONS=235} [2022-12-05 19:46:32,941 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 409 predicate places. [2022-12-05 19:46:32,941 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 235 transitions, 2882 flow [2022-12-05 19:46:32,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 86.12121212121212) internal successors, (2842), 33 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:46:32,942 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:46:32,943 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-05 19:46:32,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-05 19:46:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-05 19:46:33,148 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:46:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:46:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1393814931, now seen corresponding path program 7 times [2022-12-05 19:46:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:46:33,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537093994] [2022-12-05 19:46:33,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:46:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:46:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:46:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-05 19:46:33,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:46:33,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537093994] [2022-12-05 19:46:33,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537093994] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:46:33,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263403597] [2022-12-05 19:46:33,790 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-05 19:46:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:46:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:46:33,791 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:46:33,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-05 19:46:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:46:33,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 93 conjunts are in the unsatisfiable core [2022-12-05 19:46:33,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:46:34,648 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-05 19:46:34,828 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-05 19:46:35,139 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-05 19:46:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-05 19:46:35,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:46:35,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-12-05 19:46:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:46:36,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:46:39,465 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse10 (* c_~front~0 4)) (.cse11 (* c_~back~0 4))) (let ((.cse1 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ 4 (* |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 1 (select .cse0 .cse1))) (not (= (+ (select .cse0 .cse2) 1) 0)) (not (= (select .cse0 .cse3) 1)) (not (< 1 (+ c_~sum~0 (select .cse0 .cse4) (select .cse0 .cse5) (select .cse0 .cse6))))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 1 (select .cse9 .cse1))) (not (= (+ (select .cse9 .cse2) 1) 0)) (not (= (select .cse9 .cse3) 1)) (not (< (+ c_~sum~0 (select .cse9 .cse4) (select .cse9 .cse5) (select .cse9 .cse6)) 0)))))))) (not (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (< c_~front~0 0)) is different from false [2022-12-05 19:46:39,528 WARN L837 $PredicateComparison]: unable to prove that (or (not (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse4 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ (select .cse0 .cse1) (select .cse0 .cse2) c_~sum~0 (select .cse0 .cse3)) 0)) (not (= (select .cse0 .cse4) 1)) (not (= (+ (select .cse0 .cse5) 1) 0)) (not (= (select .cse0 .cse6) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse4) 1)) (not (= (+ (select .cse9 .cse5) 1) 0)) (not (< 1 (+ (select .cse9 .cse1) (select .cse9 .cse2) c_~sum~0 (select .cse9 .cse3)))) (not (= (select .cse9 .cse6) 1)))))))) (< c_~front~0 0) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-12-05 19:46:39,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:46:39,616 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 2 case distinctions, treesize of input 231 treesize of output 136 [2022-12-05 19:46:39,696 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-05 19:46:39,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 801 treesize of output 775 [2022-12-05 19:46:39,783 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-05 19:46:39,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 697 treesize of output 615 [2022-12-05 19:46:39,861 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-05 19:46:39,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 537 treesize of output 535 [2022-12-05 19:46:43,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:46:43,369 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 2 case distinctions, treesize of input 231 treesize of output 136 [2022-12-05 19:46:43,425 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-05 19:46:43,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 801 treesize of output 709 [2022-12-05 19:46:43,474 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-05 19:46:43,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 697 treesize of output 629 [2022-12-05 19:46:43,526 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-05 19:46:43,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 617 treesize of output 469 [2022-12-05 19:46:43,692 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 19:46:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-05 19:46:45,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263403597] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:46:45,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:46:45,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 38, 35] total 76 [2022-12-05 19:46:45,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402748671] [2022-12-05 19:46:45,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:46:45,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-05 19:46:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:46:45,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-05 19:46:45,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1044, Invalid=4283, Unknown=83, NotChecked=290, Total=5700 [2022-12-05 19:46:45,180 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2022-12-05 19:46:45,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 235 transitions, 2882 flow. Second operand has 76 states, 76 states have (on average 49.69736842105263) internal successors, (3777), 76 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:46:45,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:46:45,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2022-12-05 19:46:45,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:46:56,378 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse43 (* c_~front~0 4)) (.cse44 (* c_~back~0 4))) (let ((.cse29 (+ c_~queue~0.offset .cse44 4)) (.cse32 (+ c_~queue~0.offset .cse43 4)) (.cse30 (+ c_~queue~0.offset .cse43)) (.cse19 (select |c_#memory_int| c_~queue~0.base)) (.cse28 (+ c_~queue~0.offset .cse44))) (let ((.cse55 (<= c_~sum~0 0)) (.cse56 (<= 0 (+ c_~sum~0 1))) (.cse58 (select .cse19 .cse28)) (.cse0 (+ c_~back~0 1)) (.cse31 (+ c_~queue~0.offset .cse43 8)) (.cse60 (select .cse19 .cse30)) (.cse61 (select .cse19 .cse32)) (.cse18 (select .cse19 .cse29))) (let ((.cse13 (+ .cse44 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse44 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse43 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse43 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (not (= .cse18 1))) (.cse17 (let ((.cse62 (+ c_~sum~0 (select .cse19 .cse31) .cse60 .cse61))) (and (not (< 1 .cse62)) (not (< .cse62 0))))) (.cse3 (<= c_~n~0 .cse0)) (.cse4 (not (= (+ .cse58 1) 0))) (.cse34 (+ c_~sum~0 .cse60)) (.cse2 (let ((.cse59 (+ c_~sum~0 .cse60 .cse61))) (and (not (< 1 .cse59)) (not (< .cse59 0))))) (.cse21 (not (= .cse58 1))) (.cse20 (+ c_~queue~0.offset .cse44 8)) (.cse26 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse16 (and .cse55 .cse56 (= .cse43 .cse44))) (.cse5 (<= c_~n~0 (+ c_~back~0 2))) (.cse6 (<= .cse0 c_~front~0)) (.cse57 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse15 (< c_~front~0 0))) (and (or (< .cse0 0) .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 0 (+ (select .cse7 .cse8) 1))) (not (< (+ c_~sum~0 (select .cse7 .cse9) (select .cse7 .cse10) (select .cse7 .cse11)) 0)) (not (= (select .cse7 .cse12) 1)) (not (= (select .cse7 .cse13) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse14 .cse9) (select .cse14 .cse10) (select .cse14 .cse11)))) (not (= 0 (+ (select .cse14 .cse8) 1))) (not (= (select .cse14 .cse12) 1)) (not (= (select .cse14 .cse13) 1)))))) .cse15) (<= 1 c_~sum~0) (or .cse16 (not (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse5 .cse6 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or .cse5 .cse17 .cse6 (not (= (+ .cse18 1) 0)) (not (= (select .cse19 .cse20) 1)) .cse15 .cse21) (or (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse24 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse23 .cse24 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse22 .cse13) 1)) (not (= (select .cse22 .cse12) 1)) (not (= (+ (select .cse22 .cse8) 1) 0)) (not (< (+ (select .cse22 .cse10) c_~sum~0 (select .cse22 .cse11) (select .cse22 .cse9)) 0))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse25 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse23 .cse24 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse25 .cse13) 1)) (not (= (select .cse25 .cse12) 1)) (not (= (+ (select .cse25 .cse8) 1) 0)) (not (< 1 (+ (select .cse25 .cse10) c_~sum~0 (select .cse25 .cse11) (select .cse25 .cse9))))))))) .cse5 .cse26 .cse6 .cse15) (or .cse5 .cse6 .cse15 (and (forall ((v_ArrVal_373 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (select .cse27 .cse28) 1)) (not (= (select .cse27 .cse20) 1)) (not (= 0 (+ (select .cse27 .cse29) 1))) (not (< (+ (select .cse27 .cse30) c_~sum~0 (select .cse27 .cse31) (select .cse27 .cse32)) 0))))) (forall ((v_ArrVal_373 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (select .cse33 .cse28) 1)) (not (< 1 (+ (select .cse33 .cse30) c_~sum~0 (select .cse33 .cse31) (select .cse33 .cse32)))) (not (= (select .cse33 .cse20) 1)) (not (= 0 (+ (select .cse33 .cse29) 1)))))))) (or .cse16 .cse5 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse15 (not (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (not (< .cse34 0)) (or .cse1 .cse17 (<= c_~back~0 c_~front~0) .cse3 .cse4 .cse15) (not (< 1 .cse34)) (<= c_~sum~0 1) (or .cse5 (let ((.cse36 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse37 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse38 (+ .cse44 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse39 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse40 (+ .cse43 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse41 (+ .cse43 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse35 .cse36) 1)) (not (= (+ (select .cse35 .cse37) 1) 0)) (not (= (select .cse35 .cse38) 1)) (not (< 1 (+ c_~sum~0 (select .cse35 .cse39) (select .cse35 .cse40) (select .cse35 .cse41))))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse42 .cse36) 1)) (not (= (+ (select .cse42 .cse37) 1) 0)) (not (= (select .cse42 .cse38) 1)) (not (< (+ c_~sum~0 (select .cse42 .cse39) (select .cse42 .cse40) (select .cse42 .cse41)) 0))))))) .cse6 .cse15) (or .cse2 .cse21) (or .cse16 .cse5 .cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse15) (or .cse5 .cse6 (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (+ (select .cse45 .cse29) 1) 0)) (not (= (select .cse45 .cse20) 1)) (not (< 1 (+ c_~sum~0 (select .cse45 .cse32) (select .cse45 .cse31) (select .cse45 .cse30)))) (not (= (select .cse45 .cse28) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (+ (select .cse46 .cse29) 1) 0)) (not (< (+ c_~sum~0 (select .cse46 .cse32) (select .cse46 .cse31) (select .cse46 .cse30)) 0)) (not (= (select .cse46 .cse20) 1)) (not (= (select .cse46 .cse28) 1)))))) .cse15) (or .cse5 (let ((.cse48 (+ .cse44 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse49 (+ .cse44 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse50 (+ .cse43 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse51 (+ .cse43 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse52 (+ .cse43 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse53 (+ .cse44 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse47 .cse48) 1) 0)) (not (= (select .cse47 .cse49) 1)) (not (< 1 (+ c_~sum~0 (select .cse47 .cse50) (select .cse47 .cse51) (select .cse47 .cse52)))) (not (= (select .cse47 .cse53) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse54 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse54 .cse48) 1) 0)) (not (= (select .cse54 .cse49) 1)) (not (< (+ c_~sum~0 (select .cse54 .cse50) (select .cse54 .cse51) (select .cse54 .cse52)) 0)) (not (= (select .cse54 .cse53) 1))))))) .cse6 .cse15) (or (and .cse55 .cse56) .cse6 (< 0 c_~back~0) .cse15) (or .cse16 (not .cse26) .cse5 .cse6 .cse15 .cse57) (or .cse16 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 (not .cse57) .cse15)))))) is different from false [2022-12-05 19:47:00,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse44 (* c_~front~0 4)) (.cse45 (* c_~back~0 4))) (let ((.cse30 (+ c_~queue~0.offset .cse45 4)) (.cse33 (+ c_~queue~0.offset .cse44 4)) (.cse31 (+ c_~queue~0.offset .cse44)) (.cse20 (select |c_#memory_int| c_~queue~0.base)) (.cse29 (+ c_~queue~0.offset .cse45))) (let ((.cse17 (<= c_~sum~0 0)) (.cse57 (select .cse20 .cse29)) (.cse0 (+ c_~back~0 1)) (.cse32 (+ c_~queue~0.offset .cse44 8)) (.cse35 (select .cse20 .cse31)) (.cse59 (select .cse20 .cse33)) (.cse19 (select .cse20 .cse30))) (let ((.cse13 (+ .cse45 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse45 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse44 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse44 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (not (= .cse19 1))) (.cse18 (let ((.cse60 (+ c_~sum~0 (select .cse20 .cse32) .cse35 .cse59))) (and (not (< 1 .cse60)) (not (< .cse60 0))))) (.cse3 (<= c_~n~0 .cse0)) (.cse4 (not (= (+ .cse57 1) 0))) (.cse2 (let ((.cse58 (+ c_~sum~0 .cse35 .cse59))) (and (not (< 1 .cse58)) (not (< .cse58 0))))) (.cse22 (not (= .cse57 1))) (.cse21 (+ c_~queue~0.offset .cse45 8)) (.cse27 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse16 (and .cse17 (<= 0 (+ c_~sum~0 1)) (= .cse44 .cse45))) (.cse5 (<= c_~n~0 (+ c_~back~0 2))) (.cse6 (<= .cse0 c_~front~0)) (.cse56 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse15 (< c_~front~0 0))) (and (or (< .cse0 0) .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 0 (+ (select .cse7 .cse8) 1))) (not (< (+ c_~sum~0 (select .cse7 .cse9) (select .cse7 .cse10) (select .cse7 .cse11)) 0)) (not (= (select .cse7 .cse12) 1)) (not (= (select .cse7 .cse13) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse14 .cse9) (select .cse14 .cse10) (select .cse14 .cse11)))) (not (= 0 (+ (select .cse14 .cse8) 1))) (not (= (select .cse14 .cse12) 1)) (not (= (select .cse14 .cse13) 1)))))) .cse15) (or .cse16 (not (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse5 .cse6 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) .cse17 (or .cse5 .cse18 .cse6 (not (= (+ .cse19 1) 0)) (not (= (select .cse20 .cse21) 1)) .cse15 .cse22) (or (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 .cse25 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse23 .cse13) 1)) (not (= (select .cse23 .cse12) 1)) (not (= (+ (select .cse23 .cse8) 1) 0)) (not (< (+ (select .cse23 .cse10) c_~sum~0 (select .cse23 .cse11) (select .cse23 .cse9)) 0))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 .cse25 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse26 .cse13) 1)) (not (= (select .cse26 .cse12) 1)) (not (= (+ (select .cse26 .cse8) 1) 0)) (not (< 1 (+ (select .cse26 .cse10) c_~sum~0 (select .cse26 .cse11) (select .cse26 .cse9))))))))) .cse5 .cse27 .cse6 .cse15) (or .cse5 .cse6 .cse15 (and (forall ((v_ArrVal_373 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (select .cse28 .cse29) 1)) (not (= (select .cse28 .cse21) 1)) (not (= 0 (+ (select .cse28 .cse30) 1))) (not (< (+ (select .cse28 .cse31) c_~sum~0 (select .cse28 .cse32) (select .cse28 .cse33)) 0))))) (forall ((v_ArrVal_373 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (select .cse34 .cse29) 1)) (not (< 1 (+ (select .cse34 .cse31) c_~sum~0 (select .cse34 .cse32) (select .cse34 .cse33)))) (not (= (select .cse34 .cse21) 1)) (not (= 0 (+ (select .cse34 .cse30) 1)))))))) (or .cse16 .cse5 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse15 (not (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or .cse1 .cse18 (<= c_~back~0 c_~front~0) .cse3 .cse4 .cse15) (<= 0 c_~sum~0) (= .cse35 1) (or .cse5 (let ((.cse37 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse38 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse39 (+ .cse45 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse40 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse41 (+ .cse44 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse42 (+ .cse44 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse36 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse36 .cse37) 1)) (not (= (+ (select .cse36 .cse38) 1) 0)) (not (= (select .cse36 .cse39) 1)) (not (< 1 (+ c_~sum~0 (select .cse36 .cse40) (select .cse36 .cse41) (select .cse36 .cse42))))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse43 .cse37) 1)) (not (= (+ (select .cse43 .cse38) 1) 0)) (not (= (select .cse43 .cse39) 1)) (not (< (+ c_~sum~0 (select .cse43 .cse40) (select .cse43 .cse41) (select .cse43 .cse42)) 0))))))) .cse6 .cse15) (or .cse2 .cse22) (or .cse16 .cse5 .cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse15) (or .cse5 .cse6 (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (+ (select .cse46 .cse30) 1) 0)) (not (= (select .cse46 .cse21) 1)) (not (< 1 (+ c_~sum~0 (select .cse46 .cse33) (select .cse46 .cse32) (select .cse46 .cse31)))) (not (= (select .cse46 .cse29) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (+ (select .cse47 .cse30) 1) 0)) (not (< (+ c_~sum~0 (select .cse47 .cse33) (select .cse47 .cse32) (select .cse47 .cse31)) 0)) (not (= (select .cse47 .cse21) 1)) (not (= (select .cse47 .cse29) 1)))))) .cse15) (or .cse5 (let ((.cse49 (+ .cse45 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse50 (+ .cse45 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse51 (+ .cse44 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse52 (+ .cse44 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse53 (+ .cse44 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse54 (+ .cse45 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse48 .cse49) 1) 0)) (not (= (select .cse48 .cse50) 1)) (not (< 1 (+ c_~sum~0 (select .cse48 .cse51) (select .cse48 .cse52) (select .cse48 .cse53)))) (not (= (select .cse48 .cse54) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse55 .cse49) 1) 0)) (not (= (select .cse55 .cse50) 1)) (not (< (+ c_~sum~0 (select .cse55 .cse51) (select .cse55 .cse52) (select .cse55 .cse53)) 0)) (not (= (select .cse55 .cse54) 1))))))) .cse6 .cse15) (or .cse16 (not .cse27) .cse5 .cse6 .cse15 .cse56) (or .cse16 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 (not .cse56) .cse15)))))) is different from false [2022-12-05 19:47:00,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* c_~front~0 4)) (.cse46 (* c_~back~0 4))) (let ((.cse30 (+ c_~queue~0.offset .cse46 4)) (.cse33 (+ c_~queue~0.offset .cse45 4)) (.cse31 (+ c_~queue~0.offset .cse45)) (.cse20 (select |c_#memory_int| c_~queue~0.base)) (.cse29 (+ c_~queue~0.offset .cse46))) (let ((.cse58 (select .cse20 .cse29)) (.cse0 (+ c_~back~0 1)) (.cse32 (+ c_~queue~0.offset .cse45 8)) (.cse36 (select .cse20 .cse31)) (.cse60 (select .cse20 .cse33)) (.cse19 (select .cse20 .cse30))) (let ((.cse13 (+ .cse46 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse46 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse45 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse45 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (not (= .cse19 1))) (.cse18 (let ((.cse61 (+ c_~sum~0 (select .cse20 .cse32) .cse36 .cse60))) (and (not (< 1 .cse61)) (not (< .cse61 0))))) (.cse3 (<= c_~n~0 .cse0)) (.cse4 (not (= (+ .cse58 1) 0))) (.cse2 (let ((.cse59 (+ c_~sum~0 .cse36 .cse60))) (and (not (< 1 .cse59)) (not (< .cse59 0))))) (.cse22 (not (= .cse58 1))) (.cse16 (select .cse20 (+ c_~queue~0.offset .cse45 (- 8)))) (.cse35 (select .cse20 (+ c_~queue~0.offset .cse45 (- 4)))) (.cse21 (+ c_~queue~0.offset .cse46 8)) (.cse27 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse17 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse45 .cse46))) (.cse5 (<= c_~n~0 (+ c_~back~0 2))) (.cse6 (<= .cse0 c_~front~0)) (.cse57 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse15 (< c_~front~0 0))) (and (or (< .cse0 0) .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= 0 (+ (select .cse7 .cse8) 1))) (not (< (+ c_~sum~0 (select .cse7 .cse9) (select .cse7 .cse10) (select .cse7 .cse11)) 0)) (not (= (select .cse7 .cse12) 1)) (not (= (select .cse7 .cse13) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse14 .cse9) (select .cse14 .cse10) (select .cse14 .cse11)))) (not (= 0 (+ (select .cse14 .cse8) 1))) (not (= (select .cse14 .cse12) 1)) (not (= (select .cse14 .cse13) 1)))))) .cse15) (= .cse16 1) (or .cse17 (not (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse5 .cse6 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or .cse5 .cse18 .cse6 (not (= (+ .cse19 1) 0)) (not (= (select .cse20 .cse21) 1)) .cse15 .cse22) (<= c_~front~0 2) (or (let ((.cse24 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse25 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse23 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 .cse25 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse23 .cse13) 1)) (not (= (select .cse23 .cse12) 1)) (not (= (+ (select .cse23 .cse8) 1) 0)) (not (< (+ (select .cse23 .cse10) c_~sum~0 (select .cse23 .cse11) (select .cse23 .cse9)) 0))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_370 Int) (v_ArrVal_372 (Array Int Int))) (let ((.cse26 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse24 .cse25 v_ArrVal_370)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse26 .cse13) 1)) (not (= (select .cse26 .cse12) 1)) (not (= (+ (select .cse26 .cse8) 1) 0)) (not (< 1 (+ (select .cse26 .cse10) c_~sum~0 (select .cse26 .cse11) (select .cse26 .cse9))))))))) .cse5 .cse27 .cse6 .cse15) (<= 2 c_~front~0) (or .cse5 .cse6 .cse15 (and (forall ((v_ArrVal_373 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (select .cse28 .cse29) 1)) (not (= (select .cse28 .cse21) 1)) (not (= 0 (+ (select .cse28 .cse30) 1))) (not (< (+ (select .cse28 .cse31) c_~sum~0 (select .cse28 .cse32) (select .cse28 .cse33)) 0))))) (forall ((v_ArrVal_373 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (select .cse34 .cse29) 1)) (not (< 1 (+ (select .cse34 .cse31) c_~sum~0 (select .cse34 .cse32) (select .cse34 .cse33)))) (not (= (select .cse34 .cse21) 1)) (not (= 0 (+ (select .cse34 .cse30) 1)))))))) (or .cse17 .cse5 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse15 (not (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (or .cse1 .cse18 (<= c_~back~0 c_~front~0) .cse3 .cse4 .cse15) (= (+ .cse35 1) 0) (= .cse36 1) (or .cse5 (let ((.cse38 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse39 (+ .cse46 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse40 (+ .cse46 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse41 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse42 (+ .cse45 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse43 (+ .cse45 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse37 .cse38) 1)) (not (= (+ (select .cse37 .cse39) 1) 0)) (not (= (select .cse37 .cse40) 1)) (not (< 1 (+ c_~sum~0 (select .cse37 .cse41) (select .cse37 .cse42) (select .cse37 .cse43))))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse44 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse44 .cse38) 1)) (not (= (+ (select .cse44 .cse39) 1) 0)) (not (= (select .cse44 .cse40) 1)) (not (< (+ c_~sum~0 (select .cse44 .cse41) (select .cse44 .cse42) (select .cse44 .cse43)) 0))))))) .cse6 .cse15) (or .cse2 .cse22) (or .cse17 .cse5 .cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse15) (= c_~sum~0 (+ .cse16 .cse35)) (or .cse5 .cse6 (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse47 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (+ (select .cse47 .cse30) 1) 0)) (not (= (select .cse47 .cse21) 1)) (not (< 1 (+ c_~sum~0 (select .cse47 .cse33) (select .cse47 .cse32) (select .cse47 .cse31)))) (not (= (select .cse47 .cse29) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) c_~queue~0.base))) (or (not (= (+ (select .cse48 .cse30) 1) 0)) (not (< (+ c_~sum~0 (select .cse48 .cse33) (select .cse48 .cse32) (select .cse48 .cse31)) 0)) (not (= (select .cse48 .cse21) 1)) (not (= (select .cse48 .cse29) 1)))))) .cse15) (or .cse5 (let ((.cse50 (+ .cse46 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse51 (+ .cse46 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse52 (+ .cse45 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse53 (+ .cse45 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse54 (+ .cse45 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse55 (+ .cse46 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse49 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse49 .cse50) 1) 0)) (not (= (select .cse49 .cse51) 1)) (not (< 1 (+ c_~sum~0 (select .cse49 .cse52) (select .cse49 .cse53) (select .cse49 .cse54)))) (not (= (select .cse49 .cse55) 1))))) (forall ((v_ArrVal_373 (Array Int Int)) (v_ArrVal_372 (Array Int Int))) (let ((.cse56 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_372) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_373) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse56 .cse50) 1) 0)) (not (= (select .cse56 .cse51) 1)) (not (< (+ c_~sum~0 (select .cse56 .cse52) (select .cse56 .cse53) (select .cse56 .cse54)) 0)) (not (= (select .cse56 .cse55) 1))))))) .cse6 .cse15) (or .cse17 (not .cse27) .cse5 .cse6 .cse15 .cse57) (or .cse17 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 (not .cse57) .cse15)))))) is different from false [2022-12-05 19:47:15,092 INFO L130 PetriNetUnfolder]: 6436/21835 cut-off events. [2022-12-05 19:47:15,093 INFO L131 PetriNetUnfolder]: For 1482056/1482337 co-relation queries the response was YES. [2022-12-05 19:47:15,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189597 conditions, 21835 events. 6436/21835 cut-off events. For 1482056/1482337 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 259393 event pairs, 1009 based on Foata normal form. 74/20873 useless extension candidates. Maximal degree in co-relation 189429. Up to 5138 conditions per place. [2022-12-05 19:47:15,381 INFO L137 encePairwiseOnDemand]: 81/122 looper letters, 518 selfloop transitions, 557 changer transitions 259/1378 dead transitions. [2022-12-05 19:47:15,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 1378 transitions, 31356 flow [2022-12-05 19:47:15,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-12-05 19:47:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2022-12-05 19:47:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 9660 transitions. [2022-12-05 19:47:15,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4280017722640673 [2022-12-05 19:47:15,391 INFO L175 Difference]: Start difference. First operand has 517 places, 235 transitions, 2882 flow. Second operand 185 states and 9660 transitions. [2022-12-05 19:47:15,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 1378 transitions, 31356 flow [2022-12-05 19:47:16,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1378 transitions, 19890 flow, removed 5708 selfloop flow, removed 112 redundant places. [2022-12-05 19:47:16,957 INFO L231 Difference]: Finished difference. Result has 547 places, 686 transitions, 13308 flow [2022-12-05 19:47:16,957 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=2536, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=185, PETRI_FLOW=13308, PETRI_PLACES=547, PETRI_TRANSITIONS=686} [2022-12-05 19:47:16,957 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 439 predicate places. [2022-12-05 19:47:16,958 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 686 transitions, 13308 flow [2022-12-05 19:47:16,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 49.69736842105263) internal successors, (3777), 76 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:47:16,959 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:47:16,959 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-05 19:47:16,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-05 19:47:17,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-05 19:47:17,164 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:47:17,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:47:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash 117066897, now seen corresponding path program 8 times [2022-12-05 19:47:17,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:47:17,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650553586] [2022-12-05 19:47:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:47:17,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:47:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:47:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-05 19:47:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:47:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650553586] [2022-12-05 19:47:17,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650553586] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:47:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130527274] [2022-12-05 19:47:17,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 19:47:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:47:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:47:17,796 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:47:17,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-05 19:47:17,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 19:47:17,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:47:17,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 93 conjunts are in the unsatisfiable core [2022-12-05 19:47:17,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:47:18,654 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-05 19:47:18,800 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-05 19:47:18,975 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-05 19:47:19,291 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-05 19:47:19,366 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-05 19:47:20,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:47:20,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 18 [2022-12-05 19:47:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:47:20,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:47:23,713 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0) (let ((.cse10 (* c_~back~0 4)) (.cse11 (* c_~front~0 4))) (let ((.cse4 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse10 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ 4 (* |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ (select .cse0 .cse2) 1) 0)) (not (= (select .cse0 .cse3) 1)) (not (< 1 (+ (select .cse0 .cse4) (select .cse0 .cse5) c_~sum~0 (select .cse0 .cse6))))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ (select .cse9 .cse4) (select .cse9 .cse5) c_~sum~0 (select .cse9 .cse6)) 0)) (not (= (select .cse9 .cse1) 1)) (not (= (+ (select .cse9 .cse2) 1) 0)) (not (= (select .cse9 .cse3) 1))))))))) is different from false [2022-12-05 19:47:23,762 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse10 (* c_~front~0 4)) (.cse11 (* c_~back~0 4))) (let ((.cse4 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse10 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3)) 0)) (not (= (select .cse0 .cse4) 1)) (not (= (select .cse0 .cse5) 1)) (not (= 0 (+ (select .cse0 .cse6) 1)))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse7 .cse8 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse4) 1)) (not (= (select .cse9 .cse5) 1)) (not (= 0 (+ (select .cse9 .cse6) 1))) (not (< 1 (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2) (select .cse9 .cse3)))))))))) (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-12-05 19:47:23,861 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse11 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse13 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse1 (+ .cse12 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse13 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse12 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse7 .cse8 v_ArrVal_408) .cse9 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (not (< 1 (+ (select .cse0 .cse2) c_~sum~0 (select .cse0 .cse3) (select .cse0 .cse4)))) (not (= (select .cse0 .cse5) 1)) (not (= (select .cse0 .cse6) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse7 .cse8 v_ArrVal_408) .cse9 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse10 .cse1) 1) 0)) (not (< (+ (select .cse10 .cse2) c_~sum~0 (select .cse10 .cse3) (select .cse10 .cse4)) 0)) (not (= (select .cse10 .cse5) 1)) (not (= (select .cse10 .cse6) 1)))))))) (< c_~front~0 0) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-12-05 19:47:24,329 WARN L837 $PredicateComparison]: unable to prove that (or (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse11 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse13 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse1 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse13 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse12 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse12 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse8 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse7 .cse8 v_ArrVal_408) .cse9 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (select .cse0 .cse2) 1)) (not (= (+ (select .cse0 .cse3) 1) 0)) (not (< (+ (select .cse0 .cse4) c_~sum~0 (select .cse0 .cse5) (select .cse0 .cse6)) 0))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse7 .cse8 v_ArrVal_408) .cse9 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse10 .cse1) 1)) (not (< 1 (+ (select .cse10 .cse4) c_~sum~0 (select .cse10 .cse5) (select .cse10 .cse6)))) (not (= (select .cse10 .cse2) 1)) (not (= (+ (select .cse10 .cse3) 1) 0)))))))) (< c_~front~0 0)) is different from false [2022-12-05 19:47:24,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:47:24,404 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 3 case distinctions, treesize of input 279 treesize of output 149 [2022-12-05 19:47:24,489 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-05 19:47:24,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 381 treesize of output 407 [2022-12-05 19:47:24,558 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-05 19:47:24,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 329 treesize of output 327 [2022-12-05 19:47:24,628 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-05 19:47:24,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 249 treesize of output 287 [2022-12-05 19:47:27,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:47:27,510 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 3 case distinctions, treesize of input 279 treesize of output 149 [2022-12-05 19:47:27,548 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-05 19:47:27,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 801 treesize of output 709 [2022-12-05 19:47:27,586 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-05 19:47:27,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 697 treesize of output 629 [2022-12-05 19:47:27,624 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-05 19:47:27,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 617 treesize of output 469 [2022-12-05 19:47:27,773 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-05 19:47:28,920 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-12-05 19:47:28,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130527274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 19:47:28,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 19:47:28,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 37, 36] total 76 [2022-12-05 19:47:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545243176] [2022-12-05 19:47:28,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 19:47:28,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-05 19:47:28,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 19:47:28,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-05 19:47:28,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=935, Invalid=4127, Unknown=66, NotChecked=572, Total=5700 [2022-12-05 19:47:28,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2022-12-05 19:47:28,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 686 transitions, 13308 flow. Second operand has 76 states, 76 states have (on average 49.69736842105263) internal successors, (3777), 76 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:47:28,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 19:47:28,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2022-12-05 19:47:28,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 19:47:29,089 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4)) (.cse15 (* c_~back~0 4))) (let ((.cse44 (+ c_~queue~0.offset .cse15 4)) (.cse43 (+ c_~queue~0.offset .cse16 4)) (.cse41 (+ c_~queue~0.offset .cse16)) (.cse20 (select |c_#memory_int| c_~queue~0.base)) (.cse45 (+ c_~queue~0.offset .cse15))) (let ((.cse55 (select .cse20 .cse45)) (.cse0 (+ c_~back~0 1)) (.cse42 (+ c_~queue~0.offset .cse16 8)) (.cse57 (select .cse20 .cse41)) (.cse58 (select .cse20 .cse43)) (.cse19 (select .cse20 .cse44))) (let ((.cse1 (not (= .cse19 1))) (.cse18 (let ((.cse59 (+ c_~sum~0 (select .cse20 .cse42) .cse57 .cse58))) (and (not (< 1 .cse59)) (not (< .cse59 0))))) (.cse3 (<= c_~n~0 .cse0)) (.cse4 (not (= (+ .cse55 1) 0))) (.cse37 (+ .cse16 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse36 (+ .cse16 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse35 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse34 (+ .cse15 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (+ .cse15 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse38 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (let ((.cse56 (+ c_~sum~0 .cse57 .cse58))) (and (not (< 1 .cse56)) (not (< .cse56 0))))) (.cse22 (not (= .cse55 1))) (.cse23 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse16 .cse15))) (.cse21 (+ c_~queue~0.offset .cse15 8)) (.cse5 (<= c_~n~0 (+ c_~back~0 2))) (.cse6 (<= .cse0 c_~front~0)) (.cse17 (< c_~front~0 0))) (and (or (< .cse0 0) .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 (let ((.cse11 (+ .cse15 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse8 (+ .cse16 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse9 (+ .cse16 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse10 (+ .cse16 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse12 (+ .cse15 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse13 (+ .cse15 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse7 .cse8) (select .cse7 .cse9) (select .cse7 .cse10)))) (not (= (+ (select .cse7 .cse11) 1) 0)) (not (= (select .cse7 .cse12) 1)) (not (= (select .cse7 .cse13) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse14 .cse11) 1) 0)) (not (< (+ c_~sum~0 (select .cse14 .cse8) (select .cse14 .cse9) (select .cse14 .cse10)) 0)) (not (= (select .cse14 .cse12) 1)) (not (= (select .cse14 .cse13) 1))))))) .cse17) (or .cse5 .cse18 .cse6 (not (= (+ .cse19 1) 0)) (not (= (select .cse20 .cse21) 1)) .cse17 .cse22) (or .cse23 .cse5 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse17) (or .cse5 (let ((.cse25 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse27 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse28 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse29 (+ .cse16 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse26 (+ .cse15 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse30 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse24 .cse25) 1)) (not (= (select .cse24 .cse26) 1)) (not (< (+ c_~sum~0 (select .cse24 .cse27) (select .cse24 .cse28) (select .cse24 .cse29)) 0)) (not (= (+ (select .cse24 .cse30) 1) 0))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse31 .cse25) 1)) (not (< 1 (+ c_~sum~0 (select .cse31 .cse27) (select .cse31 .cse28) (select .cse31 .cse29)))) (not (= (select .cse31 .cse26) 1)) (not (= (+ (select .cse31 .cse30) 1) 0))))))) .cse6 .cse17) (or (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse32 .cse33) 1)) (not (= (+ (select .cse32 .cse34) 1) 0)) (not (< (+ c_~sum~0 (select .cse32 .cse35) (select .cse32 .cse36) (select .cse32 .cse37)) 0)) (not (= (select .cse32 .cse38) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse39 .cse33) 1)) (not (= (+ (select .cse39 .cse34) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse39 .cse35) (select .cse39 .cse36) (select .cse39 .cse37)))) (not (= (select .cse39 .cse38) 1)))))) .cse5 .cse6 .cse17) (or .cse1 .cse18 (<= c_~back~0 c_~front~0) .cse3 .cse4 .cse17) (or .cse5 (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse40 .cse41) (select .cse40 .cse42) (select .cse40 .cse43)))) (not (= (+ (select .cse40 .cse44) 1) 0)) (not (= (select .cse40 .cse45) 1)) (not (= (select .cse40 .cse21) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (< (+ c_~sum~0 (select .cse46 .cse41) (select .cse46 .cse42) (select .cse46 .cse43)) 0)) (not (= (+ (select .cse46 .cse44) 1) 0)) (not (= (select .cse46 .cse45) 1)) (not (= (select .cse46 .cse21) 1)))))) .cse6 .cse17) (or .cse5 .cse6 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse52 (* |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4))) (let ((.cse48 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse49 (+ 4 .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse50 (+ 8 .cse52 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse47 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse48 .cse49 v_ArrVal_408) .cse50 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse47 .cse34) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse47 .cse37) (select .cse47 .cse36) (select .cse47 .cse35)))) (not (= (select .cse47 .cse33) 1)) (not (= (select .cse47 .cse38) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse48 .cse49 v_ArrVal_408) .cse50 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse51 .cse37) (select .cse51 .cse36) (select .cse51 .cse35)) 0)) (not (= (+ (select .cse51 .cse34) 1) 0)) (not (= (select .cse51 .cse33) 1)) (not (= (select .cse51 .cse38) 1)))))))) .cse17) (or .cse23 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 .cse17) (or (<= c_~n~0 c_~back~0) .cse2 (< c_~back~0 0) .cse22) (or .cse23 .cse5 .cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse17) (or (and (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (= (select .cse53 .cse21) 1)) (not (= (+ (select .cse53 .cse44) 1) 0)) (not (= (select .cse53 .cse45) 1)) (not (< 1 (+ (select .cse53 .cse41) c_~sum~0 (select .cse53 .cse43) (select .cse53 .cse42))))))) (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (= (select .cse54 .cse21) 1)) (not (= (+ (select .cse54 .cse44) 1) 0)) (not (= (select .cse54 .cse45) 1)) (not (< (+ (select .cse54 .cse41) c_~sum~0 (select .cse54 .cse43) (select .cse54 .cse42)) 0)))))) .cse5 .cse6 .cse17) (= c_~sum~0 0)))))) is different from false [2022-12-05 19:47:35,867 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-05 19:47:38,296 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4))) (let ((.cse42 (+ c_~queue~0.offset .cse11 4)) (.cse15 (select |c_#memory_int| c_~queue~0.base)) (.cse40 (+ c_~queue~0.offset .cse11)) (.cse10 (* c_~back~0 4))) (let ((.cse38 (+ c_~back~0 1)) (.cse44 (+ c_~queue~0.offset .cse10)) (.cse41 (+ c_~queue~0.offset .cse11 8)) (.cse18 (select .cse15 .cse40)) (.cse19 (select .cse15 .cse42)) (.cse43 (+ c_~queue~0.offset .cse10 4))) (let ((.cse14 (select .cse15 .cse43)) (.cse13 (let ((.cse54 (+ c_~sum~0 (select .cse15 .cse41) .cse18 .cse19))) (and (not (< 1 .cse54)) (not (< .cse54 0))))) (.cse17 (select .cse15 .cse44)) (.cse35 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse34 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse32 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (+ .cse10 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse36 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse15 (+ c_~queue~0.offset .cse11 (- 4)))) (.cse20 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse11 .cse10))) (.cse16 (+ c_~queue~0.offset .cse10 8)) (.cse0 (<= c_~n~0 (+ c_~back~0 2))) (.cse1 (<= .cse38 c_~front~0)) (.cse12 (< c_~front~0 0))) (and (or .cse0 .cse1 (let ((.cse6 (+ .cse10 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse3 (+ .cse11 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse4 (+ .cse11 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse5 (+ .cse11 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse7 (+ .cse10 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse8 (+ .cse10 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5)))) (not (= (+ (select .cse2 .cse6) 1) 0)) (not (= (select .cse2 .cse7) 1)) (not (= (select .cse2 .cse8) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse9 .cse6) 1) 0)) (not (< (+ c_~sum~0 (select .cse9 .cse3) (select .cse9 .cse4) (select .cse9 .cse5)) 0)) (not (= (select .cse9 .cse7) 1)) (not (= (select .cse9 .cse8) 1))))))) .cse12) (or .cse0 .cse13 .cse1 (not (= (+ .cse14 1) 0)) (not (= (select .cse15 .cse16) 1)) .cse12 (not (= .cse17 1))) (= (+ .cse18 1) 0) (= .cse19 1) (or .cse20 .cse0 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse12) (or .cse0 (let ((.cse22 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse24 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse25 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse26 (+ .cse11 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse23 (+ .cse10 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse27 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse21 .cse22) 1)) (not (= (select .cse21 .cse23) 1)) (not (< (+ c_~sum~0 (select .cse21 .cse24) (select .cse21 .cse25) (select .cse21 .cse26)) 0)) (not (= (+ (select .cse21 .cse27) 1) 0))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse28 .cse22) 1)) (not (< 1 (+ c_~sum~0 (select .cse28 .cse24) (select .cse28 .cse25) (select .cse28 .cse26)))) (not (= (select .cse28 .cse23) 1)) (not (= (+ (select .cse28 .cse27) 1) 0))))))) .cse1 .cse12) (= c_~sum~0 .cse29) (or (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse30 .cse31) 1)) (not (= (+ (select .cse30 .cse32) 1) 0)) (not (< (+ c_~sum~0 (select .cse30 .cse33) (select .cse30 .cse34) (select .cse30 .cse35)) 0)) (not (= (select .cse30 .cse36) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse37 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse37 .cse31) 1)) (not (= (+ (select .cse37 .cse32) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse37 .cse33) (select .cse37 .cse34) (select .cse37 .cse35)))) (not (= (select .cse37 .cse36) 1)))))) .cse0 .cse1 .cse12) (or (not (= .cse14 1)) .cse13 (<= c_~back~0 c_~front~0) (<= c_~n~0 .cse38) (not (= (+ .cse17 1) 0)) .cse12) (or .cse0 (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse39 .cse40) (select .cse39 .cse41) (select .cse39 .cse42)))) (not (= (+ (select .cse39 .cse43) 1) 0)) (not (= (select .cse39 .cse44) 1)) (not (= (select .cse39 .cse16) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (< (+ c_~sum~0 (select .cse45 .cse40) (select .cse45 .cse41) (select .cse45 .cse42)) 0)) (not (= (+ (select .cse45 .cse43) 1) 0)) (not (= (select .cse45 .cse44) 1)) (not (= (select .cse45 .cse16) 1)))))) .cse1 .cse12) (or .cse0 .cse1 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse51 (* |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 4))) (let ((.cse47 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse48 (+ 4 .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse49 (+ 8 .cse51 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse46 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse47 .cse48 v_ArrVal_408) .cse49 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse46 .cse32) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse46 .cse35) (select .cse46 .cse34) (select .cse46 .cse33)))) (not (= (select .cse46 .cse31) 1)) (not (= (select .cse46 .cse36) 1))))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 Int) (v_ArrVal_408 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse50 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse47 .cse48 v_ArrVal_408) .cse49 v_ArrVal_410)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_412) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse50 .cse35) (select .cse50 .cse34) (select .cse50 .cse33)) 0)) (not (= (+ (select .cse50 .cse32) 1) 0)) (not (= (select .cse50 .cse31) 1)) (not (= (select .cse50 .cse36) 1)))))))) .cse12) (= .cse29 1) (or .cse20 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1 .cse12) (or .cse20 .cse0 .cse1 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse12) (<= c_~front~0 1) (or (and (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse52 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (= (select .cse52 .cse16) 1)) (not (= (+ (select .cse52 .cse43) 1) 0)) (not (= (select .cse52 .cse44) 1)) (not (< 1 (+ (select .cse52 .cse40) c_~sum~0 (select .cse52 .cse42) (select .cse52 .cse41))))))) (forall ((v_ArrVal_413 (Array Int Int))) (let ((.cse53 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_413) c_~queue~0.base))) (or (not (= (select .cse53 .cse16) 1)) (not (= (+ (select .cse53 .cse43) 1) 0)) (not (= (select .cse53 .cse44) 1)) (not (< (+ (select .cse53 .cse40) c_~sum~0 (select .cse53 .cse42) (select .cse53 .cse41)) 0)))))) .cse0 .cse1 .cse12) (<= 1 c_~front~0)))))) is different from false [2022-12-05 19:48:05,778 INFO L130 PetriNetUnfolder]: 9295/31773 cut-off events. [2022-12-05 19:48:05,778 INFO L131 PetriNetUnfolder]: For 930170/930710 co-relation queries the response was YES. [2022-12-05 19:48:06,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216595 conditions, 31773 events. 9295/31773 cut-off events. For 930170/930710 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 393920 event pairs, 1186 based on Foata normal form. 203/30386 useless extension candidates. Maximal degree in co-relation 216393. Up to 7376 conditions per place. [2022-12-05 19:48:06,616 INFO L137 encePairwiseOnDemand]: 86/122 looper letters, 555 selfloop transitions, 750 changer transitions 221/1570 dead transitions. [2022-12-05 19:48:06,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 1570 transitions, 35692 flow [2022-12-05 19:48:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-12-05 19:48:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2022-12-05 19:48:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 7673 transitions. [2022-12-05 19:48:06,624 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43374788015828153 [2022-12-05 19:48:06,624 INFO L175 Difference]: Start difference. First operand has 547 places, 686 transitions, 13308 flow. Second operand 145 states and 7673 transitions. [2022-12-05 19:48:06,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 1570 transitions, 35692 flow [2022-12-05 19:48:08,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 1570 transitions, 30577 flow, removed 2427 selfloop flow, removed 94 redundant places. [2022-12-05 19:48:08,813 INFO L231 Difference]: Finished difference. Result has 597 places, 934 transitions, 17970 flow [2022-12-05 19:48:08,814 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=11071, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=516, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=145, PETRI_FLOW=17970, PETRI_PLACES=597, PETRI_TRANSITIONS=934} [2022-12-05 19:48:08,814 INFO L294 CegarLoopForPetriNet]: 108 programPoint places, 489 predicate places. [2022-12-05 19:48:08,814 INFO L495 AbstractCegarLoop]: Abstraction has has 597 places, 934 transitions, 17970 flow [2022-12-05 19:48:08,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 49.69736842105263) internal successors, (3777), 76 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 19:48:08,815 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 19:48:08,816 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-05 19:48:08,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-05 19:48:09,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-05 19:48:09,021 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-05 19:48:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 19:48:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1454086605, now seen corresponding path program 9 times [2022-12-05 19:48:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 19:48:09,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348663607] [2022-12-05 19:48:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 19:48:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 19:48:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 19:48:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:48:10,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 19:48:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348663607] [2022-12-05 19:48:10,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348663607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 19:48:10,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339984178] [2022-12-05 19:48:10,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-05 19:48:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 19:48:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 19:48:10,894 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 19:48:10,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-05 19:48:11,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-05 19:48:11,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 19:48:11,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-05 19:48:11,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 19:48:12,134 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-05 19:48:12,535 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-05 19:48:12,634 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-05 19:48:14,856 INFO L321 Elim1Store]: treesize reduction 86, result has 7.5 percent of original size [2022-12-05 19:48:14,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 24 [2022-12-05 19:48:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 19:48:14,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 19:48:51,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:48:51,419 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 181 treesize of output 121 [2022-12-05 19:48:51,533 INFO L321 Elim1Store]: treesize reduction 36, result has 77.1 percent of original size [2022-12-05 19:48:51,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 373 treesize of output 443 [2022-12-05 19:48:51,649 INFO L321 Elim1Store]: treesize reduction 36, result has 77.1 percent of original size [2022-12-05 19:48:51,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 323 treesize of output 367 [2022-12-05 19:48:51,762 INFO L321 Elim1Store]: treesize reduction 36, result has 77.1 percent of original size [2022-12-05 19:48:51,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 247 treesize of output 329 [2022-12-05 19:49:06,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 19:49:06,841 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 181 treesize of output 121 [2022-12-05 19:49:06,899 INFO L321 Elim1Store]: treesize reduction 144, result has 8.3 percent of original size [2022-12-05 19:49:06,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 785 treesize of output 697 [2022-12-05 19:49:06,951 INFO L321 Elim1Store]: treesize reduction 144, result has 8.3 percent of original size [2022-12-05 19:49:06,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 685 treesize of output 545 [2022-12-05 19:49:07,005 INFO L321 Elim1Store]: treesize reduction 144, result has 8.3 percent of original size [2022-12-05 19:49:07,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 533 treesize of output 469 Received shutdown request... [2022-12-05 19:49:55,804 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 19:49:55,805 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 19:49:56,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-05 19:49:56,916 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 19:49:56,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 19:49:56,917 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 140 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2022-12-05 19:49:56,918 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 19:49:56,918 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 19:49:56,918 INFO L458 BasicCegarLoop]: Path program histogram: [9, 4, 1, 1, 1, 1, 1] [2022-12-05 19:49:56,921 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 19:49:56,921 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 19:49:56,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 07:49:56 BasicIcfg [2022-12-05 19:49:56,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 19:49:56,924 INFO L158 Benchmark]: Toolchain (without parser) took 802741.07ms. Allocated memory was 204.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 180.1MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-05 19:49:56,924 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 204.5MB. Free memory was 182.3MB in the beginning and 182.3MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 19:49:56,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.14ms. Allocated memory is still 204.5MB. Free memory was 180.1MB in the beginning and 168.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 19:49:56,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.74ms. Allocated memory is still 204.5MB. Free memory was 168.0MB in the beginning and 166.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 19:49:56,925 INFO L158 Benchmark]: Boogie Preprocessor took 22.43ms. Allocated memory is still 204.5MB. Free memory was 166.0MB in the beginning and 164.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 19:49:56,925 INFO L158 Benchmark]: RCFGBuilder took 542.79ms. Allocated memory is still 204.5MB. Free memory was 164.3MB in the beginning and 143.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-05 19:49:56,925 INFO L158 Benchmark]: TraceAbstraction took 801938.00ms. Allocated memory was 204.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 142.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-05 19:49:56,926 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.16ms. Allocated memory is still 204.5MB. Free memory was 182.3MB in the beginning and 182.3MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.14ms. Allocated memory is still 204.5MB. Free memory was 180.1MB in the beginning and 168.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.74ms. Allocated memory is still 204.5MB. Free memory was 168.0MB in the beginning and 166.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.43ms. Allocated memory is still 204.5MB. Free memory was 166.0MB in the beginning and 164.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 542.79ms. Allocated memory is still 204.5MB. Free memory was 164.3MB in the beginning and 143.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 801938.00ms. Allocated memory was 204.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 142.9MB in the beginning and 2.6GB in the end (delta: -2.4GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 140 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 140 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 140 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 138 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 801.8s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 602.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 458 mSolverCounterUnknown, 15751 SdHoareTripleChecker+Valid, 54.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15751 mSDsluCounter, 10409 SdHoareTripleChecker+Invalid, 50.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4007 IncrementalHoareTripleChecker+Unchecked, 9926 mSDsCounter, 2538 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32101 IncrementalHoareTripleChecker+Invalid, 39104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2538 mSolverCounterUnsat, 483 mSDtfsCounter, 32101 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3951 GetRequests, 2350 SyntacticMatches, 56 SemanticMatches, 1545 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 86274 ImplicationChecksByTransitivity, 508.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34145occurred in iteration=14, InterpolantAutomatonStates: 1047, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 85.9s InterpolantComputationTime, 3217 NumberOfCodeBlocks, 3179 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 4570 ConstructedInterpolants, 229 QuantifiedInterpolants, 99598 SizeOfPredicates, 344 NumberOfNonLiveVariables, 3221 ConjunctsInSsa, 645 ConjunctsInUnsatCore, 41 InterpolantComputations, 5 PerfectInterpolantSequences, 189/924 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown