/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -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-a802222-m [2022-12-12 13:38:40,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 13:38:40,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 13:38:40,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 13:38:40,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 13:38:40,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 13:38:40,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 13:38:40,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 13:38:40,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 13:38:40,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 13:38:40,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 13:38:40,638 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 13:38:40,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 13:38:40,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 13:38:40,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 13:38:40,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 13:38:40,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 13:38:40,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 13:38:40,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 13:38:40,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 13:38:40,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 13:38:40,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 13:38:40,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 13:38:40,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 13:38:40,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 13:38:40,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 13:38:40,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 13:38:40,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 13:38:40,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 13:38:40,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 13:38:40,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 13:38:40,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 13:38:40,662 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 13:38:40,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 13:38:40,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 13:38:40,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 13:38:40,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 13:38:40,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 13:38:40,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 13:38:40,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 13:38:40,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 13:38:40,673 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-12 13:38:40,701 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 13:38:40,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 13:38:40,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 13:38:40,703 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 13:38:40,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 13:38:40,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 13:38:40,704 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 13:38:40,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 13:38:40,704 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 13:38:40,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 13:38:40,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 13:38:40,713 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 13:38:40,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 13:38:40,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 13:38:40,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 13:38:40,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 13:38:40,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 13:38:40,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:38:40,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 13:38:40,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 13:38:40,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 13:38:40,715 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 13:38:40,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 13:38:40,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 13:38:40,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 13:38:40,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 13:38:40,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 13:38:40,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 13:38:40,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 13:38:40,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 13:38:40,969 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 13:38:40,970 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-12 13:38:41,920 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 13:38:42,090 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 13:38:42,091 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2022-12-12 13:38:42,095 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725f01559/d111297c101e4dd8b5211ea185f0dfef/FLAGc24511bd2 [2022-12-12 13:38:42,105 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/725f01559/d111297c101e4dd8b5211ea185f0dfef [2022-12-12 13:38:42,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 13:38:42,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 13:38:42,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 13:38:42,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 13:38:42,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 13:38:42,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b993c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42, skipping insertion in model container [2022-12-12 13:38:42,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 13:38:42,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 13:38:42,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:38:42,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:38:42,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:38:42,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:38:42,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:38:42,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:38:42,227 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-12 13:38:42,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:38:42,239 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 13:38:42,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:38:42,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:38:42,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:38:42,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:38:42,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 13:38:42,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 13:38:42,261 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-12 13:38:42,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:38:42,275 INFO L208 MainTranslator]: Completed translation [2022-12-12 13:38:42,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42 WrapperNode [2022-12-12 13:38:42,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 13:38:42,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 13:38:42,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 13:38:42,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 13:38:42,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,320 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 142 [2022-12-12 13:38:42,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 13:38:42,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 13:38:42,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 13:38:42,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 13:38:42,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 13:38:42,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 13:38:42,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 13:38:42,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 13:38:42,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (1/1) ... [2022-12-12 13:38:42,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:38:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:38:42,392 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-12 13:38:42,398 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-12 13:38:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 13:38:42,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 13:38:42,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 13:38:42,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 13:38:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 13:38:42,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 13:38:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 13:38:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 13:38:42,423 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 13:38:42,543 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 13:38:42,544 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 13:38:42,718 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 13:38:42,778 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 13:38:42,778 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 13:38:42,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:38:42 BoogieIcfgContainer [2022-12-12 13:38:42,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 13:38:42,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 13:38:42,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 13:38:42,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 13:38:42,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:38:42" (1/3) ... [2022-12-12 13:38:42,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666717f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:38:42, skipping insertion in model container [2022-12-12 13:38:42,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:38:42" (2/3) ... [2022-12-12 13:38:42,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666717f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:38:42, skipping insertion in model container [2022-12-12 13:38:42,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:38:42" (3/3) ... [2022-12-12 13:38:42,785 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2022-12-12 13:38:42,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 13:38:42,799 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 13:38:42,799 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 13:38:42,834 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 13:38:42,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 122 transitions, 260 flow [2022-12-12 13:38:42,892 INFO L130 PetriNetUnfolder]: 11/120 cut-off events. [2022-12-12 13:38:42,892 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:38:42,895 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-12 13:38:42,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 122 transitions, 260 flow [2022-12-12 13:38:42,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 112 transitions, 236 flow [2022-12-12 13:38:42,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 13:38:42,915 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;@112f2828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 13:38:42,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 13:38:42,957 INFO L130 PetriNetUnfolder]: 11/111 cut-off events. [2022-12-12 13:38:42,957 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:38:42,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:42,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:38:42,958 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-12 13:38:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1056395966, now seen corresponding path program 1 times [2022-12-12 13:38:42,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:42,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481794626] [2022-12-12 13:38:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:43,133 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-12 13:38:43,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:43,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481794626] [2022-12-12 13:38:43,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481794626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:38:43,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:38:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 13:38:43,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266673944] [2022-12-12 13:38:43,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:38:43,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 13:38:43,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 13:38:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 13:38:43,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 122 [2022-12-12 13:38:43,166 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-12 13:38:43,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:43,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 122 [2022-12-12 13:38:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:43,217 INFO L130 PetriNetUnfolder]: 8/112 cut-off events. [2022-12-12 13:38:43,218 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-12 13:38:43,218 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-12 13:38:43,219 INFO L137 encePairwiseOnDemand]: 115/122 looper letters, 7 selfloop transitions, 0 changer transitions 3/105 dead transitions. [2022-12-12 13:38:43,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 236 flow [2022-12-12 13:38:43,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 13:38:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 13:38:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2022-12-12 13:38:43,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9344262295081968 [2022-12-12 13:38:43,231 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 1 predicate places. [2022-12-12 13:38:43,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 236 flow [2022-12-12 13:38:43,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 105 transitions, 226 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-12 13:38:43,235 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 105 transitions, 226 flow [2022-12-12 13:38:43,235 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-12 13:38:43,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:43,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:38:43,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 13:38:43,236 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-12 13:38:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1130460435, now seen corresponding path program 1 times [2022-12-12 13:38:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:43,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296985106] [2022-12-12 13:38:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:43,512 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-12 13:38:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:43,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296985106] [2022-12-12 13:38:43,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296985106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:38:43,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:38:43,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:38:43,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768496456] [2022-12-12 13:38:43,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:38:43,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:38:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:38:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:38:43,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2022-12-12 13:38:43,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 105 transitions, 226 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-12 13:38:43,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:43,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2022-12-12 13:38:43,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:43,635 INFO L130 PetriNetUnfolder]: 14/157 cut-off events. [2022-12-12 13:38:43,636 INFO L131 PetriNetUnfolder]: For 26/36 co-relation queries the response was YES. [2022-12-12 13:38:43,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 157 events. 14/157 cut-off events. For 26/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 304 event pairs, 2 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 83. Up to 23 conditions per place. [2022-12-12 13:38:43,637 INFO L137 encePairwiseOnDemand]: 114/122 looper letters, 23 selfloop transitions, 2 changer transitions 8/115 dead transitions. [2022-12-12 13:38:43,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 115 transitions, 327 flow [2022-12-12 13:38:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:38:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:38:43,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 671 transitions. [2022-12-12 13:38:43,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7857142857142857 [2022-12-12 13:38:43,644 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 3 predicate places. [2022-12-12 13:38:43,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 115 transitions, 327 flow [2022-12-12 13:38:43,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 285 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-12 13:38:43,647 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 285 flow [2022-12-12 13:38:43,648 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-12 13:38:43,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:43,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:38:43,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 13:38:43,649 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-12 13:38:43,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash 397294607, now seen corresponding path program 1 times [2022-12-12 13:38:43,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:43,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820510503] [2022-12-12 13:38:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:43,805 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-12 13:38:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:43,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820510503] [2022-12-12 13:38:43,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820510503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:38:43,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:38:43,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 13:38:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619243517] [2022-12-12 13:38:43,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:38:43,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 13:38:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:43,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 13:38:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 13:38:43,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 122 [2022-12-12 13:38:43,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 285 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-12 13:38:43,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:43,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 122 [2022-12-12 13:38:43,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:43,868 INFO L130 PetriNetUnfolder]: 18/185 cut-off events. [2022-12-12 13:38:43,868 INFO L131 PetriNetUnfolder]: For 39/43 co-relation queries the response was YES. [2022-12-12 13:38:43,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 185 events. 18/185 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 387 event pairs, 3 based on Foata normal form. 3/173 useless extension candidates. Maximal degree in co-relation 82. Up to 30 conditions per place. [2022-12-12 13:38:43,870 INFO L137 encePairwiseOnDemand]: 118/122 looper letters, 15 selfloop transitions, 3 changer transitions 11/119 dead transitions. [2022-12-12 13:38:43,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 119 transitions, 344 flow [2022-12-12 13:38:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 13:38:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 13:38:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2022-12-12 13:38:43,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2022-12-12 13:38:43,873 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 4 predicate places. [2022-12-12 13:38:43,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 119 transitions, 344 flow [2022-12-12 13:38:43,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 119 transitions, 332 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-12 13:38:43,879 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 119 transitions, 332 flow [2022-12-12 13:38:43,879 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-12 13:38:43,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:43,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:38:43,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 13:38:43,880 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-12 13:38:43,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:43,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1362215221, now seen corresponding path program 1 times [2022-12-12 13:38:43,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:43,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690409246] [2022-12-12 13:38:43,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:43,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:44,103 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-12 13:38:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:44,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690409246] [2022-12-12 13:38:44,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690409246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:38:44,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:38:44,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:38:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927218487] [2022-12-12 13:38:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:38:44,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:38:44,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:38:44,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:38:44,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 122 [2022-12-12 13:38:44,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 119 transitions, 332 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-12 13:38:44,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:44,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 122 [2022-12-12 13:38:44,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:44,208 INFO L130 PetriNetUnfolder]: 27/289 cut-off events. [2022-12-12 13:38:44,209 INFO L131 PetriNetUnfolder]: For 127/139 co-relation queries the response was YES. [2022-12-12 13:38:44,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 289 events. 27/289 cut-off events. For 127/139 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 960 event pairs, 4 based on Foata normal form. 2/265 useless extension candidates. Maximal degree in co-relation 153. Up to 43 conditions per place. [2022-12-12 13:38:44,213 INFO L137 encePairwiseOnDemand]: 114/122 looper letters, 26 selfloop transitions, 6 changer transitions 24/136 dead transitions. [2022-12-12 13:38:44,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 136 transitions, 506 flow [2022-12-12 13:38:44,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:38:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:38:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 679 transitions. [2022-12-12 13:38:44,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7950819672131147 [2022-12-12 13:38:44,216 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 10 predicate places. [2022-12-12 13:38:44,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 136 transitions, 506 flow [2022-12-12 13:38:44,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 136 transitions, 491 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-12 13:38:44,219 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 136 transitions, 491 flow [2022-12-12 13:38:44,219 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-12 13:38:44,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:44,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:38:44,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 13:38:44,220 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-12 13:38:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2095567841, now seen corresponding path program 1 times [2022-12-12 13:38:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:44,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291209227] [2022-12-12 13:38:44,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:44,550 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-12 13:38:44,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:44,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291209227] [2022-12-12 13:38:44,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291209227] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:38:44,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736943946] [2022-12-12 13:38:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:44,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:38:44,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:38:44,554 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-12 13:38:44,587 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-12 13:38:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:44,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-12 13:38:44,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:38:45,260 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-12 13:38:45,519 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-12 13:38:45,578 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-12 13:38:45,729 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-12 13:38:45,764 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-12 13:38:45,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:38:46,420 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (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_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (< (+ c_~sum~0 (select .cse0 .cse1)) 0)) (not (= (select .cse0 .cse2) 1))))) (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 (= (select .cse3 .cse2) 1)) (not (< 1 (+ c_~sum~0 (select .cse3 .cse1))))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:38:46,517 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |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 ((.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_ULTIMATE.start_create_fresh_int_array_~arr~0#1.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_ULTIMATE.start_create_fresh_int_array_~arr~0#1.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-12 13:38:46,787 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:38:46,788 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-12 13:38:46,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:38:46,798 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-12 13:38:46,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:38:46,808 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-12 13:38:46,817 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:38:46,817 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-12 13:38:46,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:38:46,965 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-12 13:38:46,975 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:38:46,975 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-12 13:38:46,986 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:38:46,986 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-12 13:38:46,995 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 13:38:46,995 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-12 13:38:47,594 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-12 13:38:47,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736943946] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:38:47,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:38:47,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 23] total 49 [2022-12-12 13:38:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811612447] [2022-12-12 13:38:47,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:38:47,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-12 13:38:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-12 13:38:47,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1604, Unknown=30, NotChecked=182, Total=2352 [2022-12-12 13:38:47,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 122 [2022-12-12 13:38:47,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 136 transitions, 491 flow. Second operand has 49 states, 49 states have (on average 53.83673469387755) internal successors, (2638), 49 states have internal predecessors, (2638), 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-12 13:38:47,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:47,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 122 [2022-12-12 13:38:47,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:52,276 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse9 (* c_~back~0 4)) (.cse21 (select |c_#memory_int| c_~queue~0.base)) (.cse13 (+ c_~queue~0.offset .cse8))) (let ((.cse10 (let ((.cse22 (+ c_~sum~0 (select .cse21 .cse13)))) (and (not (< .cse22 0)) (not (< 1 .cse22))))) (.cse12 (+ c_~queue~0.offset .cse9)) (.cse0 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse8 .cse9))) (.cse1 (<= c_~n~0 c_~front~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (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 .cse2 (let ((.cse5 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ .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 ((.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_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse4 .cse5) 1)) (not (< 1 (+ (select .cse4 .cse6) c_~sum~0)))))) (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_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse7 .cse5) 1)) (not (< (+ (select .cse7 .cse6) c_~sum~0) 0))))))) .cse3) (or .cse1 (<= c_~back~0 c_~front~0) .cse3 .cse10) (or .cse0 (< 0 c_~front~0) .cse2 .cse3) (or (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_~queue~0.base))) (or (not (= (select .cse11 .cse12) 1)) (not (< (+ c_~sum~0 (select .cse11 .cse13)) 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_~queue~0.base))) (or (not (= (select .cse14 .cse12) 1)) (not (< 1 (+ c_~sum~0 (select .cse14 .cse13)))))))) .cse1 .cse2 .cse3) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse16 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .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 ((.cse15 (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 .cse15 .cse16) 1)) (not (< (+ c_~sum~0 (select .cse15 .cse17)) 0))))) (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 .cse16) 1)) (not (< 1 (+ c_~sum~0 (select .cse18 .cse17))))))))) .cse1 .cse2 .cse3) (or .cse0 .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (<= c_~sum~0 1) (or (and (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_68) c_~queue~0.base))) (or (not (= (select .cse19 .cse12) 1)) (not (< (+ c_~sum~0 (select .cse19 .cse13)) 0))))) (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 .cse12) 1)) (not (< 1 (+ c_~sum~0 (select .cse20 .cse13)))))))) .cse1 .cse2 .cse3) (or .cse1 .cse2 .cse3 .cse10 (not (= (select .cse21 .cse12) 1))) (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-12 13:38:59,152 INFO L130 PetriNetUnfolder]: 249/1378 cut-off events. [2022-12-12 13:38:59,152 INFO L131 PetriNetUnfolder]: For 1558/1686 co-relation queries the response was YES. [2022-12-12 13:38:59,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 1378 events. 249/1378 cut-off events. For 1558/1686 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10223 event pairs, 23 based on Foata normal form. 10/1209 useless extension candidates. Maximal degree in co-relation 354. Up to 324 conditions per place. [2022-12-12 13:38:59,157 INFO L137 encePairwiseOnDemand]: 82/122 looper letters, 94 selfloop transitions, 61 changer transitions 132/333 dead transitions. [2022-12-12 13:38:59,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 333 transitions, 2119 flow [2022-12-12 13:38:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-12 13:38:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2022-12-12 13:38:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 4092 transitions. [2022-12-12 13:38:59,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44721311475409836 [2022-12-12 13:38:59,165 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 81 predicate places. [2022-12-12 13:38:59,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 333 transitions, 2119 flow [2022-12-12 13:38:59,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 333 transitions, 1436 flow, removed 317 selfloop flow, removed 18 redundant places. [2022-12-12 13:38:59,170 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 333 transitions, 1436 flow [2022-12-12 13:38:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 53.83673469387755) internal successors, (2638), 49 states have internal predecessors, (2638), 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-12 13:38:59,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:59,172 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:38:59,191 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-12 13:38:59,376 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-12 13:38:59,377 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-12 13:38:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -237948409, now seen corresponding path program 1 times [2022-12-12 13:38:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:59,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744308616] [2022-12-12 13:38:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 13:38:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:59,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744308616] [2022-12-12 13:38:59,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744308616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:38:59,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:38:59,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 13:38:59,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388789656] [2022-12-12 13:38:59,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:38:59,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 13:38:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:59,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 13:38:59,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 13:38:59,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 122 [2022-12-12 13:38:59,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 333 transitions, 1436 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-12 13:38:59,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:59,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 122 [2022-12-12 13:38:59,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:59,616 INFO L130 PetriNetUnfolder]: 335/1555 cut-off events. [2022-12-12 13:38:59,616 INFO L131 PetriNetUnfolder]: For 769/781 co-relation queries the response was YES. [2022-12-12 13:38:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 1555 events. 335/1555 cut-off events. For 769/781 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11821 event pairs, 40 based on Foata normal form. 4/1370 useless extension candidates. Maximal degree in co-relation 1108. Up to 446 conditions per place. [2022-12-12 13:38:59,620 INFO L137 encePairwiseOnDemand]: 119/122 looper letters, 58 selfloop transitions, 2 changer transitions 117/318 dead transitions. [2022-12-12 13:38:59,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 318 transitions, 1554 flow [2022-12-12 13:38:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 13:38:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 13:38:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2022-12-12 13:38:59,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8934426229508197 [2022-12-12 13:38:59,624 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 60 predicate places. [2022-12-12 13:38:59,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 318 transitions, 1554 flow [2022-12-12 13:38:59,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 318 transitions, 1540 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-12 13:38:59,628 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 318 transitions, 1540 flow [2022-12-12 13:38:59,628 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-12 13:38:59,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:59,628 INFO L214 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-12 13:38:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 13:38:59,629 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-12 13:38:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1855893607, now seen corresponding path program 2 times [2022-12-12 13:38:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:59,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158789014] [2022-12-12 13:38:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:59,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:38:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:38:59,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:38:59,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158789014] [2022-12-12 13:38:59,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158789014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:38:59,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:38:59,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 13:38:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838523287] [2022-12-12 13:38:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:38:59,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:38:59,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:38:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:38:59,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 13:38:59,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 122 [2022-12-12 13:38:59,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 318 transitions, 1540 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-12 13:38:59,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:38:59,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 122 [2022-12-12 13:38:59,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:38:59,923 INFO L130 PetriNetUnfolder]: 447/2215 cut-off events. [2022-12-12 13:38:59,923 INFO L131 PetriNetUnfolder]: For 2442/2496 co-relation queries the response was YES. [2022-12-12 13:38:59,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 2215 events. 447/2215 cut-off events. For 2442/2496 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 18381 event pairs, 79 based on Foata normal form. 71/2003 useless extension candidates. Maximal degree in co-relation 1240. Up to 638 conditions per place. [2022-12-12 13:38:59,933 INFO L137 encePairwiseOnDemand]: 118/122 looper letters, 58 selfloop transitions, 37 changer transitions 131/357 dead transitions. [2022-12-12 13:38:59,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 357 transitions, 2156 flow [2022-12-12 13:38:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:38:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:38:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2022-12-12 13:38:59,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2022-12-12 13:38:59,938 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 62 predicate places. [2022-12-12 13:38:59,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 357 transitions, 2156 flow [2022-12-12 13:38:59,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 357 transitions, 2084 flow, removed 36 selfloop flow, removed 0 redundant places. [2022-12-12 13:38:59,945 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 357 transitions, 2084 flow [2022-12-12 13:38:59,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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-12 13:38:59,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:38:59,947 INFO L214 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-12 13:38:59,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 13:38:59,948 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-12 13:38:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:38:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 923918647, now seen corresponding path program 3 times [2022-12-12 13:38:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:38:59,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543440391] [2022-12-12 13:38:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:38:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:38:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:39:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:00,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543440391] [2022-12-12 13:39:00,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543440391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:39:00,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:39:00,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 13:39:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589636787] [2022-12-12 13:39:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:39:00,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:39:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:39:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 13:39:00,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 122 [2022-12-12 13:39:00,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 357 transitions, 2084 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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-12 13:39:00,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:00,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 122 [2022-12-12 13:39:00,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:00,263 INFO L130 PetriNetUnfolder]: 367/2298 cut-off events. [2022-12-12 13:39:00,263 INFO L131 PetriNetUnfolder]: For 2407/2496 co-relation queries the response was YES. [2022-12-12 13:39:00,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5091 conditions, 2298 events. 367/2298 cut-off events. For 2407/2496 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 19790 event pairs, 56 based on Foata normal form. 19/2094 useless extension candidates. Maximal degree in co-relation 1439. Up to 536 conditions per place. [2022-12-12 13:39:00,273 INFO L137 encePairwiseOnDemand]: 118/122 looper letters, 69 selfloop transitions, 4 changer transitions 124/334 dead transitions. [2022-12-12 13:39:00,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 334 transitions, 2224 flow [2022-12-12 13:39:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:39:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:39:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2022-12-12 13:39:00,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8811475409836066 [2022-12-12 13:39:00,277 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 61 predicate places. [2022-12-12 13:39:00,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 334 transitions, 2224 flow [2022-12-12 13:39:00,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 334 transitions, 1957 flow, removed 114 selfloop flow, removed 4 redundant places. [2022-12-12 13:39:00,288 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 334 transitions, 1957 flow [2022-12-12 13:39:00,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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-12 13:39:00,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:00,288 INFO L214 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-12 13:39:00,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 13:39:00,288 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-12 13:39:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash -549181477, now seen corresponding path program 1 times [2022-12-12 13:39:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537962347] [2022-12-12 13:39:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:00,601 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-12 13:39:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:00,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537962347] [2022-12-12 13:39:00,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537962347] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:00,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181491470] [2022-12-12 13:39:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:00,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:00,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:00,603 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-12 13:39:00,605 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-12 13:39:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:00,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-12 13:39:00,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:00,969 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-12 13:39:00,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:01,399 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-12 13:39:01,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181491470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:01,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:01,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 28 [2022-12-12 13:39:01,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928442376] [2022-12-12 13:39:01,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:01,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-12 13:39:01,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:01,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-12 13:39:01,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2022-12-12 13:39:01,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 122 [2022-12-12 13:39:01,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 334 transitions, 1957 flow. Second operand has 28 states, 28 states have (on average 85.78571428571429) internal successors, (2402), 28 states have internal predecessors, (2402), 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-12 13:39:01,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:01,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 122 [2022-12-12 13:39:01,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:02,623 INFO L130 PetriNetUnfolder]: 921/3968 cut-off events. [2022-12-12 13:39:02,623 INFO L131 PetriNetUnfolder]: For 9570/9835 co-relation queries the response was YES. [2022-12-12 13:39:02,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10489 conditions, 3968 events. 921/3968 cut-off events. For 9570/9835 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 36664 event pairs, 119 based on Foata normal form. 68/3682 useless extension candidates. Maximal degree in co-relation 1969. Up to 735 conditions per place. [2022-12-12 13:39:02,638 INFO L137 encePairwiseOnDemand]: 103/122 looper letters, 148 selfloop transitions, 36 changer transitions 220/497 dead transitions. [2022-12-12 13:39:02,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 497 transitions, 4235 flow [2022-12-12 13:39:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-12 13:39:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-12 13:39:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2526 transitions. [2022-12-12 13:39:02,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7139626907857547 [2022-12-12 13:39:02,642 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 79 predicate places. [2022-12-12 13:39:02,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 497 transitions, 4235 flow [2022-12-12 13:39:02,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 497 transitions, 3831 flow, removed 190 selfloop flow, removed 10 redundant places. [2022-12-12 13:39:02,655 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 497 transitions, 3831 flow [2022-12-12 13:39:02,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 85.78571428571429) internal successors, (2402), 28 states have internal predecessors, (2402), 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-12 13:39:02,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:02,656 INFO L214 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-12 13:39:02,667 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-12 13:39:02,860 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,SelfDestructingSolverStorable8 [2022-12-12 13:39:02,861 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-12 13:39:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1703155645, now seen corresponding path program 2 times [2022-12-12 13:39:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:02,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818693346] [2022-12-12 13:39:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:39:03,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818693346] [2022-12-12 13:39:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818693346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287677317] [2022-12-12 13:39:03,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:39:03,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:03,356 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-12 13:39:03,357 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-12 13:39:03,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 13:39:03,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:39:03,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-12 13:39:03,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:03,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:39:04,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287677317] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:04,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:04,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 36 [2022-12-12 13:39:04,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368872299] [2022-12-12 13:39:04,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:04,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-12 13:39:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-12 13:39:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2022-12-12 13:39:04,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 122 [2022-12-12 13:39:04,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 497 transitions, 3831 flow. Second operand has 36 states, 36 states have (on average 85.38888888888889) internal successors, (3074), 36 states have internal predecessors, (3074), 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-12 13:39:04,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:04,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 122 [2022-12-12 13:39:04,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:06,558 INFO L130 PetriNetUnfolder]: 614/2964 cut-off events. [2022-12-12 13:39:06,559 INFO L131 PetriNetUnfolder]: For 6518/6707 co-relation queries the response was YES. [2022-12-12 13:39:06,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 2964 events. 614/2964 cut-off events. For 6518/6707 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 24907 event pairs, 59 based on Foata normal form. 38/2713 useless extension candidates. Maximal degree in co-relation 2610. Up to 751 conditions per place. [2022-12-12 13:39:06,569 INFO L137 encePairwiseOnDemand]: 102/122 looper letters, 80 selfloop transitions, 40 changer transitions 181/385 dead transitions. [2022-12-12 13:39:06,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 385 transitions, 3098 flow [2022-12-12 13:39:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-12 13:39:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-12 13:39:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2769 transitions. [2022-12-12 13:39:06,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7092725409836066 [2022-12-12 13:39:06,573 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 97 predicate places. [2022-12-12 13:39:06,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 385 transitions, 3098 flow [2022-12-12 13:39:06,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 385 transitions, 2621 flow, removed 219 selfloop flow, removed 18 redundant places. [2022-12-12 13:39:06,583 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 385 transitions, 2621 flow [2022-12-12 13:39:06,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 85.38888888888889) internal successors, (3074), 36 states have internal predecessors, (3074), 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-12 13:39:06,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:06,585 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:39:06,593 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-12 13:39:06,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:06,792 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-12 13:39:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash -598092693, now seen corresponding path program 3 times [2022-12-12 13:39:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:06,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703068315] [2022-12-12 13:39:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:08,590 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-12 13:39:08,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:08,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703068315] [2022-12-12 13:39:08,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703068315] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:08,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242769308] [2022-12-12 13:39:08,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 13:39:08,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:08,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:08,592 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-12 13:39:08,593 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-12 13:39:08,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 13:39:08,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:39:08,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-12 13:39:08,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:09,409 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-12 13:39:09,755 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-12 13:39:09,848 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-12 13:39:10,524 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-12-12 13:39:10,525 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 49 treesize of output 20 [2022-12-12 13:39:10,543 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-12 13:39:10,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:11,855 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~front~0 1))) (or (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ .cse6 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse3 (+ .cse7 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (< 1 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)))) (not (= (+ (select .cse0 .cse4) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (select .cse5 .cse1) 1)) (not (< (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 0)) (not (= (+ (select .cse5 .cse4) 1) 0)))))))) (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (< .cse8 0) (< c_~back~0 0) (<= c_~n~0 .cse8))) is different from false [2022-12-12 13:39:12,701 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:12,702 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 124 treesize of output 88 [2022-12-12 13:39:12,742 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 13:39:12,742 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 541 [2022-12-12 13:39:12,776 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 13:39:12,776 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 489 [2022-12-12 13:39:12,811 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-12 13:39:12,812 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 385 [2022-12-12 13:39:13,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:39:13,424 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 124 treesize of output 88 [2022-12-12 13:39:13,441 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 13:39:13,441 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 271 treesize of output 245 [2022-12-12 13:39:13,458 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 13:39:13,458 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 237 treesize of output 193 [2022-12-12 13:39:13,474 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 13:39:13,475 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 185 treesize of output 167 [2022-12-12 13:39:13,533 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:39:14,393 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-12 13:39:14,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242769308] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:14,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:14,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29, 26] total 69 [2022-12-12 13:39:14,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268230488] [2022-12-12 13:39:14,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:14,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-12 13:39:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:14,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-12 13:39:14,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=696, Invalid=3824, Unknown=40, NotChecked=132, Total=4692 [2022-12-12 13:39:14,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2022-12-12 13:39:14,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 385 transitions, 2621 flow. Second operand has 69 states, 69 states have (on average 49.56521739130435) internal successors, (3420), 69 states have internal predecessors, (3420), 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-12 13:39:14,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:14,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2022-12-12 13:39:14,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:39:14,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse26 (* c_~back~0 4)) (.cse27 (* c_~front~0 4))) (let ((.cse8 (+ c_~queue~0.offset .cse27)) (.cse28 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~queue~0.offset .cse26))) (let ((.cse36 (+ c_~front~0 1)) (.cse29 (select .cse28 .cse9)) (.cse38 (select .cse28 .cse8)) (.cse7 (+ c_~queue~0.offset .cse27 4))) (let ((.cse13 (<= c_~back~0 c_~front~0)) (.cse10 (+ c_~queue~0.offset .cse26 4)) (.cse16 (let ((.cse39 (+ c_~sum~0 .cse38 (select .cse28 .cse7)))) (and (not (< 1 .cse39)) (not (< .cse39 0))))) (.cse12 (<= c_~n~0 c_~front~0)) (.cse17 (not (= (+ .cse29 1) 0))) (.cse14 (< c_~front~0 0)) (.cse15 (let ((.cse37 (+ c_~sum~0 .cse38))) (and (not (< .cse37 0)) (not (< 1 .cse37))))) (.cse1 (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse27 .cse26))) (.cse0 (<= c_~n~0 c_~back~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< .cse36 0)) (.cse4 (< c_~back~0 0)) (.cse5 (<= c_~n~0 .cse36))) (and (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse2 (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8)))) (not (= (select .cse6 .cse9) 1)) (not (= (+ (select .cse6 .cse10) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse11 .cse9) 1)) (not (= (+ (select .cse11 .cse10) 1) 0)) (not (< (+ c_~sum~0 (select .cse11 .cse7) (select .cse11 .cse8)) 0)))))) .cse3 .cse4 .cse5) (or .cse12 .cse13 .cse14 .cse15) (or .cse13 .cse16 .cse3 .cse17 .cse5) (or (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse18 .cse9) 1)) (not (< (+ (select .cse18 .cse7) c_~sum~0 (select .cse18 .cse8)) 0)) (not (= (+ (select .cse18 .cse10) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse19 .cse9) 1)) (not (= (+ (select .cse19 .cse10) 1) 0)) (not (< 1 (+ (select .cse19 .cse7) c_~sum~0 (select .cse19 .cse8)))))))) .cse0 .cse2 .cse3 .cse4 .cse5) (or (let ((.cse21 (+ .cse27 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse23 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse24 (+ .cse26 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse20 .cse21) (select .cse20 .cse22)))) (not (= (select .cse20 .cse23) 1)) (not (= (+ (select .cse20 .cse24) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse25 .cse21) (select .cse25 .cse22)) 0)) (not (= (select .cse25 .cse23) 1)) (not (= (+ (select .cse25 .cse24) 1) 0))))))) .cse0 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5) (or .cse2 (not (= (+ (select .cse28 .cse10) 1) 0)) .cse16 .cse3 (not (= .cse29 1)) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or .cse12 .cse2 .cse17 .cse14 .cse15) (or .cse0 .cse1 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5) (= c_~sum~0 0) (or (let ((.cse31 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse33 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse34 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse32 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse30 .cse31) 1)) (not (= (+ (select .cse30 .cse32) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse30 .cse33) (select .cse30 .cse34))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse35 .cse31) 1)) (not (< (+ c_~sum~0 (select .cse35 .cse33) (select .cse35 .cse34)) 0)) (not (= (+ (select .cse35 .cse32) 1) 0))))))) .cse0 .cse2 .cse3 .cse4 .cse5)))))) is different from false [2022-12-12 13:39:26,919 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (* c_~front~0 4))) (let ((.cse25 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ c_~queue~0.offset .cse24)) (.cse23 (* c_~back~0 4))) (let ((.cse31 (+ c_~front~0 1)) (.cse9 (+ c_~queue~0.offset .cse23)) (.cse28 (select .cse25 .cse8)) (.cse7 (+ c_~queue~0.offset .cse24 4))) (let ((.cse10 (+ c_~queue~0.offset .cse23 4)) (.cse13 (let ((.cse39 (+ c_~sum~0 .cse28 (select .cse25 .cse7)))) (and (not (< 1 .cse39)) (not (< .cse39 0))))) (.cse1 (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse24 .cse23))) (.cse26 (* c_~n~0 4)) (.cse14 (select .cse25 .cse9)) (.cse12 (<= .cse9 4)) (.cse32 (= c_~sum~0 0)) (.cse0 (<= c_~n~0 c_~back~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< .cse31 0)) (.cse4 (< c_~back~0 0)) (.cse5 (<= c_~n~0 .cse31))) (and (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse2 (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8)))) (not (= (select .cse6 .cse9) 1)) (not (= (+ (select .cse6 .cse10) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse11 .cse9) 1)) (not (= (+ (select .cse11 .cse10) 1) 0)) (not (< (+ c_~sum~0 (select .cse11 .cse7) (select .cse11 .cse8)) 0)))))) .cse3 .cse4 .cse5) (or (<= (+ c_~back~0 c_~n~0) (+ 3 c_~front~0)) .cse12) (or (<= c_~back~0 c_~front~0) .cse13 .cse3 (not (= (+ .cse14 1) 0)) .cse5) (or (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse15 .cse9) 1)) (not (< (+ (select .cse15 .cse7) c_~sum~0 (select .cse15 .cse8)) 0)) (not (= (+ (select .cse15 .cse10) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse16 .cse9) 1)) (not (= (+ (select .cse16 .cse10) 1) 0)) (not (< 1 (+ (select .cse16 .cse7) c_~sum~0 (select .cse16 .cse8)))))))) .cse0 .cse2 .cse3 .cse4 .cse5) (or (let ((.cse18 (+ .cse24 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse21 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse17 .cse18) (select .cse17 .cse19)))) (not (= (select .cse17 .cse20) 1)) (not (= (+ (select .cse17 .cse21) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse22 .cse18) (select .cse22 .cse19)) 0)) (not (= (select .cse22 .cse20) 1)) (not (= (+ (select .cse22 .cse21) 1) 0))))))) .cse0 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5) (or .cse2 (not (= (+ (select .cse25 .cse10) 1) 0)) .cse13 .cse3 (not (= .cse14 1)) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (= c_~queue~0.offset 0) (or (<= .cse26 (+ c_~queue~0.offset .cse24 3)) (let ((.cse27 (+ c_~sum~0 .cse28))) (and (<= .cse27 0) (<= 0 .cse27) (< 3 .cse8) (<= .cse8 4)))) (or .cse0 .cse1 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5) (or (and (let ((.cse29 (<= .cse31 c_~back~0))) (or (not (<= .cse8 0)) (and .cse29 (not (= 4 .cse9))) (let ((.cse30 (= .cse28 1))) (and (or (not (= .cse8 0)) (and .cse29 .cse30) (<= .cse26 (+ c_~queue~0.offset .cse24 7))) (or (not .cse30) (<= (select .cse25 4) .cse14)))))) .cse32 (<= c_~n~0 2)) (not .cse12)) .cse32 (or (let ((.cse34 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse36 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse37 (+ .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse35 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse33 .cse34) 1)) (not (= (+ (select .cse33 .cse35) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse33 .cse36) (select .cse33 .cse37))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse38 .cse34) 1)) (not (< (+ c_~sum~0 (select .cse38 .cse36) (select .cse38 .cse37)) 0)) (not (= (+ (select .cse38 .cse35) 1) 0))))))) .cse0 .cse2 .cse3 .cse4 .cse5)))))) is different from false [2022-12-12 13:39:38,684 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse23 (* c_~front~0 4))) (let ((.cse24 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ c_~queue~0.offset .cse23)) (.cse22 (* c_~back~0 4))) (let ((.cse33 (+ c_~front~0 1)) (.cse9 (+ c_~queue~0.offset .cse22)) (.cse26 (select .cse24 .cse8)) (.cse7 (+ c_~queue~0.offset .cse23 4))) (let ((.cse10 (+ c_~queue~0.offset .cse22 4)) (.cse12 (let ((.cse34 (+ c_~sum~0 .cse26 (select .cse24 .cse7)))) (and (not (< 1 .cse34)) (not (< .cse34 0))))) (.cse13 (select .cse24 .cse9)) (.cse1 (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse23 .cse22))) (.cse0 (<= c_~n~0 c_~back~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< .cse33 0)) (.cse4 (< c_~back~0 0)) (.cse5 (<= c_~n~0 .cse33))) (and (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse2 (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8)))) (not (= (select .cse6 .cse9) 1)) (not (= (+ (select .cse6 .cse10) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse11 .cse9) 1)) (not (= (+ (select .cse11 .cse10) 1) 0)) (not (< (+ c_~sum~0 (select .cse11 .cse7) (select .cse11 .cse8)) 0)))))) .cse3 .cse4 .cse5) (or (<= c_~back~0 c_~front~0) .cse12 .cse3 (not (= (+ .cse13 1) 0)) .cse5) (or (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse14 .cse9) 1)) (not (< (+ (select .cse14 .cse7) c_~sum~0 (select .cse14 .cse8)) 0)) (not (= (+ (select .cse14 .cse10) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) c_~queue~0.base))) (or (not (= (select .cse15 .cse9) 1)) (not (= (+ (select .cse15 .cse10) 1) 0)) (not (< 1 (+ (select .cse15 .cse7) c_~sum~0 (select .cse15 .cse8)))))))) .cse0 .cse2 .cse3 .cse4 .cse5) (or (let ((.cse17 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (+ .cse22 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse16 .cse17) (select .cse16 .cse18)))) (not (= (select .cse16 .cse19) 1)) (not (= (+ (select .cse16 .cse20) 1) 0))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< (+ c_~sum~0 (select .cse21 .cse17) (select .cse21 .cse18)) 0)) (not (= (select .cse21 .cse19) 1)) (not (= (+ (select .cse21 .cse20) 1) 0))))))) .cse0 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5) (or .cse2 (not (= (+ (select .cse24 .cse10) 1) 0)) .cse12 .cse3 (not (= .cse13 1)) .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (= c_~queue~0.offset 0) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset .cse23 3)) (let ((.cse25 (+ c_~sum~0 .cse26))) (and (<= .cse25 0) (<= 0 .cse25) (< 3 .cse8) (<= .cse8 4)))) (or .cse0 .cse1 .cse2 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse4 .cse5) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (= c_~sum~0 0) (or (let ((.cse28 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse30 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse31 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse29 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse27 .cse28) 1)) (not (= (+ (select .cse27 .cse29) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse27 .cse30) (select .cse27 .cse31))))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse32 .cse28) 1)) (not (< (+ c_~sum~0 (select .cse32 .cse30) (select .cse32 .cse31)) 0)) (not (= (+ (select .cse32 .cse29) 1) 0))))))) .cse0 .cse2 .cse3 .cse4 .cse5)))))) is different from false [2022-12-12 13:39:40,796 INFO L130 PetriNetUnfolder]: 2364/7995 cut-off events. [2022-12-12 13:39:40,796 INFO L131 PetriNetUnfolder]: For 20412/20832 co-relation queries the response was YES. [2022-12-12 13:39:40,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25367 conditions, 7995 events. 2364/7995 cut-off events. For 20412/20832 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 78450 event pairs, 228 based on Foata normal form. 105/7396 useless extension candidates. Maximal degree in co-relation 7757. Up to 1625 conditions per place. [2022-12-12 13:39:40,826 INFO L137 encePairwiseOnDemand]: 83/122 looper letters, 347 selfloop transitions, 164 changer transitions 743/1299 dead transitions. [2022-12-12 13:39:40,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1299 transitions, 11833 flow [2022-12-12 13:39:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-12-12 13:39:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2022-12-12 13:39:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 9193 transitions. [2022-12-12 13:39:40,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4233284214404126 [2022-12-12 13:39:40,842 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 256 predicate places. [2022-12-12 13:39:40,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1299 transitions, 11833 flow [2022-12-12 13:39:40,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 1299 transitions, 9632 flow, removed 1019 selfloop flow, removed 47 redundant places. [2022-12-12 13:39:40,870 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 1299 transitions, 9632 flow [2022-12-12 13:39:40,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 49.56521739130435) internal successors, (3420), 69 states have internal predecessors, (3420), 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-12 13:39:40,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:39:40,872 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:39:40,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-12 13:39:41,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:41,079 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-12 13:39:41,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:39:41,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1155964727, now seen corresponding path program 4 times [2022-12-12 13:39:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:39:41,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317148690] [2022-12-12 13:39:41,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:39:41,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:39:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:39:41,478 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-12 13:39:41,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:39:41,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317148690] [2022-12-12 13:39:41,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317148690] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:39:41,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766438604] [2022-12-12 13:39:41,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 13:39:41,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:39:41,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:39:41,480 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-12 13:39:41,482 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-12 13:39:41,565 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 13:39:41,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:39:41,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-12 13:39:41,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:39:42,628 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-12-12 13:39:42,629 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 48 treesize of output 17 [2022-12-12 13:39:42,651 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-12 13:39:42,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:39:43,108 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-12 13:39:43,109 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 78 [2022-12-12 13:39:44,719 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-12 13:39:44,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766438604] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:39:44,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:39:44,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 24, 23] total 47 [2022-12-12 13:39:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469724957] [2022-12-12 13:39:44,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:39:44,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-12 13:39:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:39:44,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-12 13:39:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1810, Unknown=0, NotChecked=0, Total=2162 [2022-12-12 13:39:44,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 122 [2022-12-12 13:39:44,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 1299 transitions, 9632 flow. Second operand has 47 states, 47 states have (on average 64.12765957446808) internal successors, (3014), 47 states have internal predecessors, (3014), 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-12 13:39:44,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:39:44,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 122 [2022-12-12 13:39:44,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:40:01,131 INFO L130 PetriNetUnfolder]: 5761/18676 cut-off events. [2022-12-12 13:40:01,131 INFO L131 PetriNetUnfolder]: For 54481/55508 co-relation queries the response was YES. [2022-12-12 13:40:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66616 conditions, 18676 events. 5761/18676 cut-off events. For 54481/55508 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 208596 event pairs, 407 based on Foata normal form. 237/17471 useless extension candidates. Maximal degree in co-relation 19787. Up to 4227 conditions per place. [2022-12-12 13:40:01,197 INFO L137 encePairwiseOnDemand]: 91/122 looper letters, 895 selfloop transitions, 430 changer transitions 1841/3224 dead transitions. [2022-12-12 13:40:01,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 3224 transitions, 32384 flow [2022-12-12 13:40:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-12-12 13:40:01,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2022-12-12 13:40:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 10467 transitions. [2022-12-12 13:40:01,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.539591710485617 [2022-12-12 13:40:01,206 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 367 predicate places. [2022-12-12 13:40:01,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 3224 transitions, 32384 flow [2022-12-12 13:40:01,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 3224 transitions, 28484 flow, removed 1908 selfloop flow, removed 38 redundant places. [2022-12-12 13:40:01,303 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 3224 transitions, 28484 flow [2022-12-12 13:40:01,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 64.12765957446808) internal successors, (3014), 47 states have internal predecessors, (3014), 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-12 13:40:01,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:40:01,304 INFO L214 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-12 13:40:01,310 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-12 13:40:01,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 13:40:01,511 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-12 13:40:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:40:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash 231520801, now seen corresponding path program 5 times [2022-12-12 13:40:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:40:01,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682122214] [2022-12-12 13:40:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:40:01,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:40:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:40:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-12 13:40:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:40:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682122214] [2022-12-12 13:40:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682122214] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:40:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382728092] [2022-12-12 13:40:01,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 13:40:01,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:40:01,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:40:01,652 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-12 13:40:01,659 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-12 13:40:01,762 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-12-12 13:40:01,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:40:01,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 13:40:01,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:40:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-12 13:40:01,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:40:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-12 13:40:02,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382728092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:40:02,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:40:02,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 11 [2022-12-12 13:40:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488778982] [2022-12-12 13:40:02,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:40:02,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 13:40:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:40:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 13:40:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-12 13:40:02,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 122 [2022-12-12 13:40:02,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 3224 transitions, 28484 flow. Second operand has 11 states, 11 states have (on average 101.81818181818181) internal successors, (1120), 11 states have internal predecessors, (1120), 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-12 13:40:02,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:40:02,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 122 [2022-12-12 13:40:02,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:40:06,201 INFO L130 PetriNetUnfolder]: 7071/23616 cut-off events. [2022-12-12 13:40:06,202 INFO L131 PetriNetUnfolder]: For 80326/81492 co-relation queries the response was YES. [2022-12-12 13:40:06,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83049 conditions, 23616 events. 7071/23616 cut-off events. For 80326/81492 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 281989 event pairs, 497 based on Foata normal form. 354/22110 useless extension candidates. Maximal degree in co-relation 23786. Up to 4348 conditions per place. [2022-12-12 13:40:06,287 INFO L137 encePairwiseOnDemand]: 116/122 looper letters, 661 selfloop transitions, 239 changer transitions 2006/3609 dead transitions. [2022-12-12 13:40:06,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 3609 transitions, 37212 flow [2022-12-12 13:40:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 13:40:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 13:40:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2022-12-12 13:40:06,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8565573770491803 [2022-12-12 13:40:06,289 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 334 predicate places. [2022-12-12 13:40:06,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 3609 transitions, 37212 flow [2022-12-12 13:40:06,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 3609 transitions, 35636 flow, removed 787 selfloop flow, removed 1 redundant places. [2022-12-12 13:40:06,433 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 3609 transitions, 35636 flow [2022-12-12 13:40:06,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.81818181818181) internal successors, (1120), 11 states have internal predecessors, (1120), 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-12 13:40:06,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:40:06,434 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-12 13:40:06,440 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-12 13:40:06,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:40:06,639 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-12 13:40:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:40:06,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1484516507, now seen corresponding path program 6 times [2022-12-12 13:40:06,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:40:06,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451828728] [2022-12-12 13:40:06,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:40:06,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:40:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:40:06,983 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:40:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:40:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451828728] [2022-12-12 13:40:06,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451828728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:40:06,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810986964] [2022-12-12 13:40:06,984 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 13:40:06,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:40:06,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:40:07,004 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-12 13:40:07,006 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-12 13:40:07,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-12-12 13:40:07,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:40:07,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-12 13:40:07,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:40:07,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:40:07,670 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-12 13:40:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-12 13:40:07,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:40:08,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:40:08,011 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 77 treesize of output 78 [2022-12-12 13:40:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-12 13:40:08,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810986964] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:40:08,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:40:08,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 32 [2022-12-12 13:40:08,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648504527] [2022-12-12 13:40:08,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:40:08,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-12 13:40:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:40:08,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-12 13:40:08,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-12-12 13:40:08,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 122 [2022-12-12 13:40:08,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 3609 transitions, 35636 flow. Second operand has 32 states, 32 states have (on average 66.28125) internal successors, (2121), 32 states have internal predecessors, (2121), 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-12 13:40:08,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:40:08,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 122 [2022-12-12 13:40:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:40:14,713 INFO L130 PetriNetUnfolder]: 3246/11835 cut-off events. [2022-12-12 13:40:14,714 INFO L131 PetriNetUnfolder]: For 46057/47298 co-relation queries the response was YES. [2022-12-12 13:40:14,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46543 conditions, 11835 events. 3246/11835 cut-off events. For 46057/47298 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 130185 event pairs, 214 based on Foata normal form. 131/11025 useless extension candidates. Maximal degree in co-relation 10494. Up to 2401 conditions per place. [2022-12-12 13:40:14,753 INFO L137 encePairwiseOnDemand]: 96/122 looper letters, 498 selfloop transitions, 124 changer transitions 1240/1920 dead transitions. [2022-12-12 13:40:14,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1920 transitions, 22792 flow [2022-12-12 13:40:14,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-12 13:40:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2022-12-12 13:40:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 6579 transitions. [2022-12-12 13:40:14,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5392622950819672 [2022-12-12 13:40:14,759 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 327 predicate places. [2022-12-12 13:40:14,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1920 transitions, 22792 flow [2022-12-12 13:40:14,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1920 transitions, 20324 flow, removed 1125 selfloop flow, removed 57 redundant places. [2022-12-12 13:40:14,810 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 1920 transitions, 20324 flow [2022-12-12 13:40:14,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 66.28125) internal successors, (2121), 32 states have internal predecessors, (2121), 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-12 13:40:14,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:40:14,811 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-12-12 13:40:14,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 13:40:15,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:40:15,015 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-12 13:40:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:40:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash -22583415, now seen corresponding path program 7 times [2022-12-12 13:40:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:40:15,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871499524] [2022-12-12 13:40:15,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:40:15,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:40:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:40:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 29 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-12 13:40:15,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:40:15,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871499524] [2022-12-12 13:40:15,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871499524] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:40:15,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397917780] [2022-12-12 13:40:15,343 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 13:40:15,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:40:15,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:40:15,345 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-12 13:40:15,348 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-12 13:40:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:40:15,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-12 13:40:15,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:40:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:40:15,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:40:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:40:16,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397917780] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:40:16,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:40:16,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 42 [2022-12-12 13:40:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25912317] [2022-12-12 13:40:16,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:40:16,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-12 13:40:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:40:16,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-12 13:40:16,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-12-12 13:40:16,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 122 [2022-12-12 13:40:16,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1920 transitions, 20324 flow. Second operand has 42 states, 42 states have (on average 85.9047619047619) internal successors, (3608), 42 states have internal predecessors, (3608), 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-12 13:40:16,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:40:16,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 122 [2022-12-12 13:40:16,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:40:19,242 INFO L130 PetriNetUnfolder]: 2417/8650 cut-off events. [2022-12-12 13:40:19,242 INFO L131 PetriNetUnfolder]: For 40018/40968 co-relation queries the response was YES. [2022-12-12 13:40:19,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35924 conditions, 8650 events. 2417/8650 cut-off events. For 40018/40968 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 87084 event pairs, 162 based on Foata normal form. 68/8039 useless extension candidates. Maximal degree in co-relation 11387. Up to 2973 conditions per place. [2022-12-12 13:40:19,280 INFO L137 encePairwiseOnDemand]: 104/122 looper letters, 322 selfloop transitions, 17 changer transitions 834/1284 dead transitions. [2022-12-12 13:40:19,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1284 transitions, 14989 flow [2022-12-12 13:40:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-12 13:40:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-12 13:40:19,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3475 transitions. [2022-12-12 13:40:19,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7120901639344263 [2022-12-12 13:40:19,283 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 274 predicate places. [2022-12-12 13:40:19,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1284 transitions, 14989 flow [2022-12-12 13:40:19,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 1284 transitions, 13092 flow, removed 876 selfloop flow, removed 39 redundant places. [2022-12-12 13:40:19,424 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1284 transitions, 13092 flow [2022-12-12 13:40:19,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 85.9047619047619) internal successors, (3608), 42 states have internal predecessors, (3608), 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-12 13:40:19,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:40:19,425 INFO L214 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-12 13:40:19,429 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-12 13:40:19,625 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,SelfDestructingSolverStorable14 [2022-12-12 13:40:19,626 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-12 13:40:19,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:40:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -658140257, now seen corresponding path program 8 times [2022-12-12 13:40:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:40:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674494541] [2022-12-12 13:40:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:40:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:40:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:40:21,734 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-12 13:40:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:40:21,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674494541] [2022-12-12 13:40:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674494541] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:40:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425903246] [2022-12-12 13:40:21,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:40:21,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:40:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:40:21,736 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-12 13:40:21,738 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-12 13:40:21,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 13:40:21,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:40:21,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-12 13:40:21,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:40:22,529 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-12 13:40:22,702 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-12 13:40:23,058 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-12 13:40:23,133 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-12 13:40:23,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:40:23,933 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-12 13:40:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:40:23,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:40:25,466 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse8 4)) (.cse2 (+ c_~queue~0.offset .cse8 8)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (+ c_~queue~0.offset .cse9 8)) (.cse5 (+ c_~queue~0.offset .cse9)) (.cse6 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (not (= (select .cse0 .cse2) 1)) (not (< 1 (+ (select .cse0 .cse3) c_~sum~0 (select .cse0 .cse4) (select .cse0 .cse5)))) (not (= (select .cse0 .cse6) 1))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (not (= (select .cse7 .cse2) 1)) (not (< (+ (select .cse7 .cse3) c_~sum~0 (select .cse7 .cse4) (select .cse7 .cse5)) 0)) (not (= (select .cse7 .cse6) 1)))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:40:25,887 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse1 (+ .cse8 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse4 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse5 (+ .cse9 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse2 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse3 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4))) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (select .cse0 .cse2) 1)) (not (= (+ (select .cse0 .cse3) 1) 0)) (not (< (+ c_~sum~0 (select .cse0 .cse4) (select .cse0 .cse5) (select .cse0 .cse6)) 0))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (select .cse7 .cse1) 1)) (not (< 1 (+ c_~sum~0 (select .cse7 .cse4) (select .cse7 .cse5) (select .cse7 .cse6)))) (not (= (select .cse7 .cse2) 1)) (not (= (+ (select .cse7 .cse3) 1) 0)))))))) (< c_~front~0 0)) is different from false [2022-12-12 13:40:26,377 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|) (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse1 (+ .cse8 |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 (+ .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|)) (.cse5 (+ .cse9 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse8 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ 1 (select .cse0 .cse2)) 0)) (not (< (+ c_~sum~0 (select .cse0 .cse3) (select .cse0 .cse4) (select .cse0 .cse5)) 0)) (not (= (select .cse0 .cse6) 1))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse1) 1)) (not (= (+ 1 (select .cse7 .cse2)) 0)) (not (< 1 (+ c_~sum~0 (select .cse7 .cse3) (select .cse7 .cse4) (select .cse7 .cse5)))) (not (= (select .cse7 .cse6) 1)))))))) (<= c_~n~0 (+ c_~back~0 2)) (<= (+ c_~back~0 1) c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 13:40:26,973 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 (+ c_~back~0 2)) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse4 (+ .cse10 8 |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|)) (.cse5 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 |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_331 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (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_331)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |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) 0)) (not (= (select .cse0 .cse6) 1))))) (forall ((v_ArrVal_331 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (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_331)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse4) 1)) (not (< 1 (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2) (select .cse9 .cse3)))) (not (= (+ (select .cse9 .cse5) 1) 0)) (not (= (select .cse9 .cse6) 1)))))))) (<= (+ 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)) is different from false [2022-12-12 13:40:27,023 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse10 (* c_~back~0 4)) (.cse11 (* c_~front~0 4))) (let ((.cse1 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse11 |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|)) (.cse4 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 |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_331 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (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_331)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |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) 0)) (not (= (select .cse0 .cse5) 1)) (not (= (select .cse0 .cse6) 1))))) (forall ((v_ArrVal_331 Int) (v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (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_331)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (< 1 (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2) (select .cse9 .cse3)))) (not (= (+ (select .cse9 .cse4) 1) 0)) (not (= (select .cse9 .cse5) 1)) (not (= (select .cse9 .cse6) 1)))))))) (<= 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-12 13:40:27,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:40:27,092 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-12 13:40:27,158 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-12 13:40:27,159 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-12 13:40:27,223 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-12 13:40:27,223 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-12 13:40:27,285 INFO L321 Elim1Store]: treesize reduction 42, result has 65.3 percent of original size [2022-12-12 13:40:27,285 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-12 13:40:31,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:40:31,967 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-12 13:40:32,008 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-12 13:40:32,009 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-12 13:40:32,052 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-12 13:40:32,053 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 549 [2022-12-12 13:40:32,099 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-12 13:40:32,099 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 469 [2022-12-12 13:40:32,312 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:40:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-12 13:40:33,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425903246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:40:33,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:40:33,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 32] total 89 [2022-12-12 13:40:33,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136458808] [2022-12-12 13:40:33,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:40:33,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-12-12 13:40:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:40:33,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-12-12 13:40:33,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=5673, Unknown=30, NotChecked=840, Total=7832 [2022-12-12 13:40:33,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 122 [2022-12-12 13:40:33,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1284 transitions, 13092 flow. Second operand has 89 states, 89 states have (on average 46.438202247191015) internal successors, (4133), 89 states have internal predecessors, (4133), 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-12 13:40:33,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:40:33,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 122 [2022-12-12 13:40:33,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:41:02,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~back~0 4)) (.cse23 (* c_~front~0 4))) (let ((.cse40 (+ c_~queue~0.offset .cse23)) (.cse43 (+ c_~queue~0.offset .cse22 4)) (.cse41 (+ c_~queue~0.offset .cse23 4)) (.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse42 (+ c_~queue~0.offset .cse22))) (let ((.cse45 (<= c_~sum~0 0)) (.cse46 (<= 0 (+ c_~sum~0 1))) (.cse37 (= .cse23 .cse22)) (.cse27 (select .cse10 .cse42)) (.cse0 (+ c_~back~0 1)) (.cse39 (+ c_~queue~0.offset .cse23 8)) (.cse48 (select .cse10 .cse41)) (.cse9 (select .cse10 .cse43)) (.cse26 (select .cse10 .cse40))) (let ((.cse28 (= .cse26 1)) (.cse11 (+ c_~queue~0.offset .cse22 8)) (.cse1 (not (= .cse9 1))) (.cse7 (let ((.cse49 (+ c_~sum~0 (select .cse10 .cse39) .cse26 .cse48))) (and (not (< 1 .cse49)) (not (< .cse49 0))))) (.cse3 (<= c_~n~0 .cse0)) (.cse4 (not (= (+ .cse27 1) 0))) (.cse5 (<= c_~n~0 c_~back~0)) (.cse2 (let ((.cse47 (+ c_~sum~0 .cse26 .cse48))) (and (not (< 1 .cse47)) (not (< .cse47 0))))) (.cse13 (not (= .cse27 1))) (.cse24 (and .cse45 .cse46 .cse37)) (.cse6 (<= c_~n~0 (+ c_~back~0 2))) (.cse8 (<= .cse0 c_~front~0)) (.cse12 (< c_~front~0 0))) (and (or (< .cse0 0) .cse1 .cse2 .cse3 .cse4) (not .cse5) (or .cse6 .cse7 .cse8 (not (= (+ .cse9 1) 0)) (not (= (select .cse10 .cse11) 1)) .cse12 .cse13) (or (let ((.cse15 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (+ .cse22 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse23 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (+ .cse22 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse14 .cse15) 1)) (not (= (+ 1 (select .cse14 .cse16)) 0)) (not (< (+ c_~sum~0 (select .cse14 .cse17) (select .cse14 .cse18) (select .cse14 .cse19)) 0)) (not (= (select .cse14 .cse20) 1))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse21 .cse15) 1)) (not (= (+ 1 (select .cse21 .cse16)) 0)) (not (< 1 (+ c_~sum~0 (select .cse21 .cse17) (select .cse21 .cse18) (select .cse21 .cse19)))) (not (= (select .cse21 .cse20) 1))))))) .cse6 .cse8 .cse12) (<= 0 c_~back~0) (or .cse24 .cse6 (< 3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8 .cse12) (or .cse24 .cse6 .cse8 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_#t~post19#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12) (or (let ((.cse25 (+ c_~sum~0 .cse26))) (and (<= 1 .cse25) (<= .cse25 1))) (not (= .cse26 .cse27)) (not .cse28)) (or .cse6 .cse8 (let ((.cse30 (+ .cse22 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse32 (+ .cse23 |c_ULTIMATE.start_main_#t~ret11#1.offset| 4)) (.cse33 (+ .cse23 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse34 (+ .cse23 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse31 (+ .cse22 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (.cse35 (+ .cse22 8 |c_ULTIMATE.start_main_#t~ret11#1.offset|))) (and (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse29 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse29 .cse30) 1) 0)) (not (= (select .cse29 .cse31) 1)) (not (< (+ c_~sum~0 (select .cse29 .cse32) (select .cse29 .cse33) (select .cse29 .cse34)) 0)) (not (= 1 (select .cse29 .cse35)))))) (forall ((v_ArrVal_333 (Array Int Int)) (v_ArrVal_334 (Array Int Int))) (let ((.cse36 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_333) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (or (not (= (+ (select .cse36 .cse30) 1) 0)) (not (< 1 (+ c_~sum~0 (select .cse36 .cse32) (select .cse36 .cse33) (select .cse36 .cse34)))) (not (= (select .cse36 .cse31) 1)) (not (= 1 (select .cse36 .cse35)))))))) .cse12) (or .cse28 .cse37) (or .cse6 (and (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~queue~0.base))) (or (not (< 1 (+ c_~sum~0 (select .cse38 .cse39) (select .cse38 .cse40) (select .cse38 .cse41)))) (not (= (select .cse38 .cse42) 1)) (not (= (+ (select .cse38 .cse43) 1) 0)) (not (= (select .cse38 .cse11) 1))))) (forall ((v_ArrVal_334 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_334) c_~queue~0.base))) (or (not (= (select .cse44 .cse42) 1)) (not (< (+ c_~sum~0 (select .cse44 .cse39) (select .cse44 .cse40) (select .cse44 .cse41)) 0)) (not (= (+ (select .cse44 .cse43) 1) 0)) (not (= (select .cse44 .cse11) 1)))))) .cse8 .cse12) (= c_~queue~0.offset 0) (or .cse1 .cse7 (<= c_~back~0 c_~front~0) .cse3 .cse4 .cse12) (or .cse24 (< (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse8 .cse12) (or .cse5 .cse2 (< c_~back~0 0) .cse13) (or .cse24 .cse6 .cse8 (< 3 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse12) (or (and .cse45 .cse46) .cse8 (< 0 c_~back~0) .cse12)))))) is different from false [2022-12-12 13:41:29,823 INFO L130 PetriNetUnfolder]: 7618/26677 cut-off events. [2022-12-12 13:41:29,824 INFO L131 PetriNetUnfolder]: For 143282/146561 co-relation queries the response was YES. [2022-12-12 13:41:29,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122056 conditions, 26677 events. 7618/26677 cut-off events. For 143282/146561 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 312214 event pairs, 420 based on Foata normal form. 745/25210 useless extension candidates. Maximal degree in co-relation 41950. Up to 8942 conditions per place. [2022-12-12 13:41:29,931 INFO L137 encePairwiseOnDemand]: 84/122 looper letters, 998 selfloop transitions, 706 changer transitions 2350/4096 dead transitions. [2022-12-12 13:41:29,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 4096 transitions, 59356 flow [2022-12-12 13:41:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 313 states. [2022-12-12 13:41:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2022-12-12 13:41:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 15282 transitions. [2022-12-12 13:41:29,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4001990258209815 [2022-12-12 13:41:29,942 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 547 predicate places. [2022-12-12 13:41:29,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 4096 transitions, 59356 flow [2022-12-12 13:41:30,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 4096 transitions, 47432 flow, removed 5886 selfloop flow, removed 55 redundant places. [2022-12-12 13:41:30,206 INFO L495 AbstractCegarLoop]: Abstraction has has 600 places, 4096 transitions, 47432 flow [2022-12-12 13:41:30,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 46.438202247191015) internal successors, (4133), 89 states have internal predecessors, (4133), 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-12 13:41:30,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:41:30,208 INFO L214 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-12 13:41:30,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-12 13:41:30,412 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,SelfDestructingSolverStorable15 [2022-12-12 13:41:30,412 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-12 13:41:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:41:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2004569437, now seen corresponding path program 9 times [2022-12-12 13:41:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:41:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333702333] [2022-12-12 13:41:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:41:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:41:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:41:31,910 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-12 13:41:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:41:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333702333] [2022-12-12 13:41:31,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333702333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:41:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566416316] [2022-12-12 13:41:31,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 13:41:31,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:41:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:41:31,912 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-12 13:41:31,912 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-12 13:41:32,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 13:41:32,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:41:32,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-12 13:41:32,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:41:32,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:32,618 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-12 13:41:32,664 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-12 13:41:32,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:41:33,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:41:33,195 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 110 treesize of output 152 [2022-12-12 13:41:33,814 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-12 13:41:33,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566416316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:41:33,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:41:33,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 13, 12] total 45 [2022-12-12 13:41:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602139020] [2022-12-12 13:41:33,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:41:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-12 13:41:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:41:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-12 13:41:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2022-12-12 13:41:33,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 122 [2022-12-12 13:41:33,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 4096 transitions, 47432 flow. Second operand has 45 states, 45 states have (on average 58.111111111111114) internal successors, (2615), 45 states have internal predecessors, (2615), 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-12 13:41:33,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:41:33,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 122 [2022-12-12 13:41:33,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:41:50,826 INFO L130 PetriNetUnfolder]: 9869/33847 cut-off events. [2022-12-12 13:41:50,826 INFO L131 PetriNetUnfolder]: For 170758/174363 co-relation queries the response was YES. [2022-12-12 13:41:50,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155641 conditions, 33847 events. 9869/33847 cut-off events. For 170758/174363 co-relation queries the response was YES. Maximal size of possible extension queue 717. Compared 413807 event pairs, 551 based on Foata normal form. 211/31582 useless extension candidates. Maximal degree in co-relation 41495. Up to 9454 conditions per place. [2022-12-12 13:41:50,973 INFO L137 encePairwiseOnDemand]: 94/122 looper letters, 1709 selfloop transitions, 388 changer transitions 3297/5442 dead transitions. [2022-12-12 13:41:50,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 5442 transitions, 75350 flow [2022-12-12 13:41:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-12-12 13:41:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2022-12-12 13:41:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 7085 transitions. [2022-12-12 13:41:50,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47994851646118414 [2022-12-12 13:41:50,978 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 612 predicate places. [2022-12-12 13:41:50,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 5442 transitions, 75350 flow [2022-12-12 13:41:51,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 5442 transitions, 70207 flow, removed 2397 selfloop flow, removed 54 redundant places. [2022-12-12 13:41:51,337 INFO L495 AbstractCegarLoop]: Abstraction has has 666 places, 5442 transitions, 70207 flow [2022-12-12 13:41:51,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 58.111111111111114) internal successors, (2615), 45 states have internal predecessors, (2615), 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-12 13:41:51,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:41:51,338 INFO L214 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-12 13:41:51,343 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-12 13:41:51,542 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,SelfDestructingSolverStorable16 [2022-12-12 13:41:51,543 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-12 13:41:51,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:41:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash 560273009, now seen corresponding path program 10 times [2022-12-12 13:41:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:41:51,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733130453] [2022-12-12 13:41:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:41:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:41:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:41:53,501 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-12 13:41:53,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:41:53,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733130453] [2022-12-12 13:41:53,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733130453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:41:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379987822] [2022-12-12 13:41:53,502 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 13:41:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:41:53,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:41:53,503 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-12 13:41:53,504 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-12 13:41:53,586 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 13:41:53,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:41:53,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-12 13:41:53,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:41:55,483 INFO L321 Elim1Store]: treesize reduction 111, result has 8.3 percent of original size [2022-12-12 13:41:55,483 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 70 treesize of output 27 [2022-12-12 13:41:55,534 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:41:55,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:41:56,356 INFO L321 Elim1Store]: treesize reduction 14, result has 88.4 percent of original size [2022-12-12 13:41:56,356 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 110 treesize of output 138 [2022-12-12 13:41:57,977 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-12 13:41:57,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379987822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:41:57,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:41:57,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 28] total 75 [2022-12-12 13:41:57,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351672870] [2022-12-12 13:41:57,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:41:57,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-12 13:41:57,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:41:57,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-12 13:41:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1093, Invalid=4457, Unknown=0, NotChecked=0, Total=5550 [2022-12-12 13:41:57,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 122 [2022-12-12 13:41:57,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 5442 transitions, 70207 flow. Second operand has 75 states, 75 states have (on average 56.68) internal successors, (4251), 75 states have internal predecessors, (4251), 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-12 13:41:57,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:41:57,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 122 [2022-12-12 13:41:57,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:42:48,574 INFO L130 PetriNetUnfolder]: 15589/52676 cut-off events. [2022-12-12 13:42:48,574 INFO L131 PetriNetUnfolder]: For 327383/335608 co-relation queries the response was YES. [2022-12-12 13:42:48,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268104 conditions, 52676 events. 15589/52676 cut-off events. For 327383/335608 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 702836 event pairs, 842 based on Foata normal form. 1148/49974 useless extension candidates. Maximal degree in co-relation 45406. Up to 15905 conditions per place. [2022-12-12 13:42:48,826 INFO L137 encePairwiseOnDemand]: 84/122 looper letters, 2249 selfloop transitions, 1101 changer transitions 4905/8303 dead transitions. [2022-12-12 13:42:48,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 8303 transitions, 130514 flow [2022-12-12 13:42:48,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 315 states. [2022-12-12 13:42:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2022-12-12 13:42:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 18569 transitions. [2022-12-12 13:42:48,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4831902159771012 [2022-12-12 13:42:48,836 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 872 predicate places. [2022-12-12 13:42:48,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 8303 transitions, 130514 flow [2022-12-12 13:42:49,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 896 places, 8303 transitions, 112875 flow, removed 8651 selfloop flow, removed 84 redundant places. [2022-12-12 13:42:49,547 INFO L495 AbstractCegarLoop]: Abstraction has has 896 places, 8303 transitions, 112875 flow [2022-12-12 13:42:49,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 56.68) internal successors, (4251), 75 states have internal predecessors, (4251), 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-12 13:42:49,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:42:49,549 INFO L214 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-12 13:42:49,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-12 13:42:49,749 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,SelfDestructingSolverStorable17 [2022-12-12 13:42:49,750 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:42:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:42:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash -597793359, now seen corresponding path program 11 times [2022-12-12 13:42:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:42:49,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016048456] [2022-12-12 13:42:49,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:42:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:42:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:42:51,496 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-12 13:42:51,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:42:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016048456] [2022-12-12 13:42:51,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016048456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:42:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525732495] [2022-12-12 13:42:51,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 13:42:51,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:42:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:42:51,499 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-12 13:42:51,500 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-12 13:42:51,617 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-12 13:42:51,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:42:51,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-12 13:42:51,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:42:52,387 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-12 13:42:52,771 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-12 13:42:52,846 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-12 13:42:53,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:42:53,603 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-12 13:42:53,662 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-12 13:42:53,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:42:56,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:42:56,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 1 case distinctions, treesize of input 183 treesize of output 123 [2022-12-12 13:42:56,485 INFO L321 Elim1Store]: treesize reduction 14, result has 88.4 percent of original size [2022-12-12 13:42:56,486 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 803 [2022-12-12 13:42:56,559 INFO L321 Elim1Store]: treesize reduction 14, result has 88.4 percent of original size [2022-12-12 13:42:56,560 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 723 [2022-12-12 13:42:56,635 INFO L321 Elim1Store]: treesize reduction 14, result has 88.4 percent of original size [2022-12-12 13:42:56,635 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 563 [2022-12-12 13:43:02,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:43:02,677 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 183 treesize of output 123 [2022-12-12 13:43:02,714 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-12 13:43:02,715 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 341 [2022-12-12 13:43:02,748 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-12 13:43:02,749 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 261 [2022-12-12 13:43:02,782 INFO L321 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2022-12-12 13:43:02,782 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 221 [2022-12-12 13:43:02,977 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:43:04,211 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-12 13:43:04,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525732495] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:43:04,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:43:04,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 31] total 86 [2022-12-12 13:43:04,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519997344] [2022-12-12 13:43:04,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:43:04,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-12-12 13:43:04,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:43:04,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-12-12 13:43:04,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1185, Invalid=6077, Unknown=48, NotChecked=0, Total=7310 [2022-12-12 13:43:04,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2022-12-12 13:43:04,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 896 places, 8303 transitions, 112875 flow. Second operand has 86 states, 86 states have (on average 49.5) internal successors, (4257), 86 states have internal predecessors, (4257), 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-12 13:43:04,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:43:04,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2022-12-12 13:43:04,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:45:51,127 INFO L130 PetriNetUnfolder]: 35408/119237 cut-off events. [2022-12-12 13:45:51,127 INFO L131 PetriNetUnfolder]: For 774673/802626 co-relation queries the response was YES. [2022-12-12 13:45:51,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619619 conditions, 119237 events. 35408/119237 cut-off events. For 774673/802626 co-relation queries the response was YES. Maximal size of possible extension queue 2863. Compared 1752650 event pairs, 1413 based on Foata normal form. 4690/115753 useless extension candidates. Maximal degree in co-relation 78965. Up to 32459 conditions per place. [2022-12-12 13:45:51,720 INFO L137 encePairwiseOnDemand]: 84/122 looper letters, 4989 selfloop transitions, 3832 changer transitions 14904/23770 dead transitions. [2022-12-12 13:45:51,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1296 places, 23770 transitions, 379412 flow [2022-12-12 13:45:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 401 states. [2022-12-12 13:45:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2022-12-12 13:45:51,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 20814 transitions. [2022-12-12 13:45:51,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42545276153877604 [2022-12-12 13:45:51,736 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 1188 predicate places. [2022-12-12 13:45:51,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1296 places, 23770 transitions, 379412 flow [2022-12-12 13:45:54,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1225 places, 23770 transitions, 366287 flow, removed 6418 selfloop flow, removed 71 redundant places. [2022-12-12 13:45:54,232 INFO L495 AbstractCegarLoop]: Abstraction has has 1225 places, 23770 transitions, 366287 flow [2022-12-12 13:45:54,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 49.5) internal successors, (4257), 86 states have internal predecessors, (4257), 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-12 13:45:54,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:45:54,233 INFO L214 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-12 13:45:54,238 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-12 13:45:54,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:45:54,434 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:45:54,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:45:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -626576793, now seen corresponding path program 12 times [2022-12-12 13:45:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:45:54,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418706856] [2022-12-12 13:45:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:45:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:45:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:45:54,864 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-12 13:45:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:45:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418706856] [2022-12-12 13:45:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418706856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:45:54,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368203784] [2022-12-12 13:45:54,864 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-12 13:45:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:45:54,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:45:54,865 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-12 13:45:54,866 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-12 13:45:55,027 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-12-12 13:45:55,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:45:55,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 13:45:55,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:45:55,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:45:55,546 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 84 treesize of output 23 [2022-12-12 13:45:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 13:45:55,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:45:55,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:45:55,930 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 108 treesize of output 150 [2022-12-12 13:45:56,329 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-12 13:45:56,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368203784] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:45:56,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:45:56,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 12] total 28 [2022-12-12 13:45:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563960421] [2022-12-12 13:45:56,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:45:56,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-12 13:45:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:45:56,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-12 13:45:56,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2022-12-12 13:45:56,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 122 [2022-12-12 13:45:56,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1225 places, 23770 transitions, 366287 flow. Second operand has 28 states, 28 states have (on average 70.92857142857143) internal successors, (1986), 28 states have internal predecessors, (1986), 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-12 13:45:56,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:45:56,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 122 [2022-12-12 13:45:56,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:51:26,355 INFO L130 PetriNetUnfolder]: 38931/130360 cut-off events. [2022-12-12 13:51:26,356 INFO L131 PetriNetUnfolder]: For 1059493/1092300 co-relation queries the response was YES. [2022-12-12 13:51:26,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723242 conditions, 130360 events. 38931/130360 cut-off events. For 1059493/1092300 co-relation queries the response was YES. Maximal size of possible extension queue 3047. Compared 1926891 event pairs, 1603 based on Foata normal form. 2192/123944 useless extension candidates. Maximal degree in co-relation 100908. Up to 36817 conditions per place. [2022-12-12 13:51:27,005 INFO L137 encePairwiseOnDemand]: 105/122 looper letters, 5660 selfloop transitions, 1155 changer transitions 16316/25399 dead transitions. [2022-12-12 13:51:27,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1270 places, 25399 transitions, 439251 flow [2022-12-12 13:51:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-12 13:51:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-12 13:51:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3286 transitions. [2022-12-12 13:51:27,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5855310049893087 [2022-12-12 13:51:27,007 INFO L295 CegarLoopForPetriNet]: 108 programPoint places, 1162 predicate places. [2022-12-12 13:51:27,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1270 places, 25399 transitions, 439251 flow [2022-12-12 13:51:29,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1248 places, 25399 transitions, 420756 flow, removed 9007 selfloop flow, removed 22 redundant places. [2022-12-12 13:51:29,755 INFO L495 AbstractCegarLoop]: Abstraction has has 1248 places, 25399 transitions, 420756 flow [2022-12-12 13:51:29,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 70.92857142857143) internal successors, (1986), 28 states have internal predecessors, (1986), 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-12 13:51:29,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:51:29,756 INFO L214 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-12 13:51:29,763 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-12 13:51:29,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-12-12 13:51:29,964 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:51:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:51:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash -217236737, now seen corresponding path program 13 times [2022-12-12 13:51:29,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:51:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044281686] [2022-12-12 13:51:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:51:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:51:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:51:30,389 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-12 13:51:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:51:30,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044281686] [2022-12-12 13:51:30,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044281686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:51:30,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604643730] [2022-12-12 13:51:30,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-12 13:51:30,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:51:30,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:51:30,391 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:51:30,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-12 13:51:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:51:30,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 93 conjunts are in the unsatisfiable core [2022-12-12 13:51:30,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:51:30,978 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-12 13:51:31,118 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-12 13:51:31,288 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-12 13:51:31,583 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-12 13:51:31,642 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-12 13:51:32,592 INFO L321 Elim1Store]: treesize reduction 86, result has 7.5 percent of original size [2022-12-12 13:51:32,593 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-12 13:51:32,633 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-12 13:51:32,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-12 13:52:16,892 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-12 13:52:16,892 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 13:52:17,565 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 13:52:17,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-12 13:52:17,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:52:17,766 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 140 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 63 known predicates. [2022-12-12 13:52:17,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 13:52:17,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 13:52:17,767 INFO L445 BasicCegarLoop]: Path program histogram: [13, 3, 1, 1, 1, 1, 1] [2022-12-12 13:52:17,770 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 13:52:17,770 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 13:52:17,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 01:52:17 BasicIcfg [2022-12-12 13:52:17,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 13:52:17,772 INFO L158 Benchmark]: Toolchain (without parser) took 815664.82ms. Allocated memory was 175.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 151.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-12 13:52:17,772 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 13:52:17,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.80ms. Allocated memory is still 175.1MB. Free memory was 151.3MB in the beginning and 138.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 13:52:17,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.46ms. Allocated memory is still 175.1MB. Free memory was 138.9MB in the beginning and 137.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 13:52:17,773 INFO L158 Benchmark]: Boogie Preprocessor took 38.45ms. Allocated memory is still 175.1MB. Free memory was 137.2MB in the beginning and 135.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 13:52:17,773 INFO L158 Benchmark]: RCFGBuilder took 419.26ms. Allocated memory is still 175.1MB. Free memory was 135.4MB in the beginning and 114.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-12 13:52:17,773 INFO L158 Benchmark]: TraceAbstraction took 814990.39ms. Allocated memory was 175.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 113.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2022-12-12 13:52:17,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 175.1MB. Free memory is still 152.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.80ms. Allocated memory is still 175.1MB. Free memory was 151.3MB in the beginning and 138.9MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.46ms. Allocated memory is still 175.1MB. Free memory was 138.9MB in the beginning and 137.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.45ms. Allocated memory is still 175.1MB. Free memory was 137.2MB in the beginning and 135.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 419.26ms. Allocated memory is still 175.1MB. Free memory was 135.4MB in the beginning and 114.8MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 814990.39ms. Allocated memory was 175.1MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 113.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 63 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 63 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 63 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 138 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 7.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 814.9s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 694.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 257 mSolverCounterUnknown, 25999 SdHoareTripleChecker+Valid, 35.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25999 mSDsluCounter, 15520 SdHoareTripleChecker+Invalid, 31.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2048 IncrementalHoareTripleChecker+Unchecked, 14813 mSDsCounter, 2359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45570 IncrementalHoareTripleChecker+Invalid, 50234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2359 mSolverCounterUnsat, 707 mSDtfsCounter, 45570 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5251 GetRequests, 2893 SyntacticMatches, 42 SemanticMatches, 2316 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 268775 ImplicationChecksByTransitivity, 202.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420756occurred in iteration=20, InterpolantAutomatonStates: 1845, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 80364 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 3906 NumberOfCodeBlocks, 3837 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 5493 ConstructedInterpolants, 89 QuantifiedInterpolants, 101155 SizeOfPredicates, 328 NumberOfNonLiveVariables, 3706 ConjunctsInSsa, 639 ConjunctsInUnsatCore, 46 InterpolantComputations, 7 PerfectInterpolantSequences, 369/1656 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