/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 22:48:38,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 22:48:38,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 22:48:38,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 22:48:38,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 22:48:38,570 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 22:48:38,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 22:48:38,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 22:48:38,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 22:48:38,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 22:48:38,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 22:48:38,580 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 22:48:38,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 22:48:38,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 22:48:38,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 22:48:38,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 22:48:38,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 22:48:38,586 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 22:48:38,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 22:48:38,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 22:48:38,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 22:48:38,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 22:48:38,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 22:48:38,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 22:48:38,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 22:48:38,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 22:48:38,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 22:48:38,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 22:48:38,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 22:48:38,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 22:48:38,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 22:48:38,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 22:48:38,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 22:48:38,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 22:48:38,603 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 22:48:38,603 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 22:48:38,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 22:48:38,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 22:48:38,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 22:48:38,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 22:48:38,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 22:48:38,605 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-VariableLbe.epf [2023-01-27 22:48:38,634 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 22:48:38,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 22:48:38,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 22:48:38,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 22:48:38,635 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 22:48:38,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 22:48:38,635 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 22:48:38,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 22:48:38,636 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 22:48:38,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 22:48:38,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 22:48:38,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 22:48:38,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 22:48:38,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 22:48:38,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 22:48:38,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:48:38,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 22:48:38,638 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 22:48:38,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 22:48:38,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 22:48:38,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 22:48:38,836 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 22:48:38,838 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 22:48:38,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-01-27 22:48:39,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 22:48:39,929 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 22:48:39,929 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-01-27 22:48:39,933 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a9c5896/23d91b4685254203a6251856fe2b44b6/FLAG6f7cadd6c [2023-01-27 22:48:39,941 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a9c5896/23d91b4685254203a6251856fe2b44b6 [2023-01-27 22:48:39,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 22:48:39,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 22:48:39,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 22:48:39,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 22:48:39,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 22:48:39,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:48:39" (1/1) ... [2023-01-27 22:48:39,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e63535a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:39, skipping insertion in model container [2023-01-27 22:48:39,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:48:39" (1/1) ... [2023-01-27 22:48:39,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 22:48:39,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 22:48:40,115 WARN L247 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.wvr.c[3107,3120] [2023-01-27 22:48:40,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:48:40,134 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 22:48:40,164 WARN L247 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.wvr.c[3107,3120] [2023-01-27 22:48:40,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:48:40,175 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:48:40,175 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:48:40,180 INFO L208 MainTranslator]: Completed translation [2023-01-27 22:48:40,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40 WrapperNode [2023-01-27 22:48:40,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 22:48:40,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 22:48:40,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 22:48:40,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 22:48:40,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,221 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-01-27 22:48:40,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 22:48:40,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 22:48:40,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 22:48:40,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 22:48:40,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,257 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 22:48:40,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 22:48:40,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 22:48:40,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 22:48:40,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (1/1) ... [2023-01-27 22:48:40,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:48:40,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:48:40,285 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) [2023-01-27 22:48:40,292 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 [2023-01-27 22:48:40,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 22:48:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 22:48:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 22:48:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 22:48:40,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 22:48:40,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 22:48:40,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 22:48:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 22:48:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 22:48:40,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 22:48:40,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 22:48:40,319 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 22:48:40,410 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 22:48:40,411 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 22:48:40,633 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 22:48:40,685 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 22:48:40,686 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-27 22:48:40,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:48:40 BoogieIcfgContainer [2023-01-27 22:48:40,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 22:48:40,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 22:48:40,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 22:48:40,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 22:48:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:48:39" (1/3) ... [2023-01-27 22:48:40,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4e5350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:48:40, skipping insertion in model container [2023-01-27 22:48:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:48:40" (2/3) ... [2023-01-27 22:48:40,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4e5350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:48:40, skipping insertion in model container [2023-01-27 22:48:40,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:48:40" (3/3) ... [2023-01-27 22:48:40,692 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-01-27 22:48:40,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 22:48:40,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 22:48:40,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 22:48:40,756 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 22:48:40,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 294 flow [2023-01-27 22:48:40,838 INFO L130 PetriNetUnfolder]: 10/132 cut-off events. [2023-01-27 22:48:40,838 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:48:40,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 10/132 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-01-27 22:48:40,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 294 flow [2023-01-27 22:48:40,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 262 flow [2023-01-27 22:48:40,847 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 22:48:40,852 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 262 flow [2023-01-27 22:48:40,854 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 122 transitions, 262 flow [2023-01-27 22:48:40,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 262 flow [2023-01-27 22:48:40,875 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2023-01-27 22:48:40,876 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:48:40,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 10/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-01-27 22:48:40,877 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-01-27 22:48:44,338 INFO L134 LiptonReduction]: Checked pairs total: 2055 [2023-01-27 22:48:44,338 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-01-27 22:48:44,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 22:48:44,351 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;@6c529d55, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 22:48:44,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 22:48:44,355 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-01-27 22:48:44,355 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 22:48:44,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:44,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:48:44,356 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:44,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 839295690, now seen corresponding path program 1 times [2023-01-27 22:48:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897849975] [2023-01-27 22:48:44,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:44,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:44,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:44,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897849975] [2023-01-27 22:48:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897849975] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:48:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:48:44,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:48:44,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446282345] [2023-01-27 22:48:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:48:44,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:48:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:44,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:48:44,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:48:44,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-27 22:48:44,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:48:44,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:44,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-27 22:48:44,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:44,806 INFO L130 PetriNetUnfolder]: 214/342 cut-off events. [2023-01-27 22:48:44,807 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-01-27 22:48:44,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 342 events. 214/342 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1072 event pairs, 15 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 616. Up to 121 conditions per place. [2023-01-27 22:48:44,812 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-01-27 22:48:44,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-01-27 22:48:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:48:44,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:48:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-01-27 22:48:44,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491869918699187 [2023-01-27 22:48:44,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-01-27 22:48:44,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-01-27 22:48:44,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:44,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-01-27 22:48:44,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 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) [2023-01-27 22:48:44,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-27 22:48:44,843 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-27 22:48:44,844 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 605 transitions. [2023-01-27 22:48:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-01-27 22:48:44,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-01-27 22:48:44,848 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-01-27 22:48:44,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-01-27 22:48:44,853 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-01-27 22:48:44,853 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-01-27 22:48:44,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:48:44,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:44,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:48:44,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 22:48:44,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:44,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:44,854 INFO L85 PathProgramCache]: Analyzing trace with hash 712380104, now seen corresponding path program 2 times [2023-01-27 22:48:44,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:44,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472958025] [2023-01-27 22:48:44,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:44,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:44,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472958025] [2023-01-27 22:48:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472958025] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:48:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:48:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:48:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085337982] [2023-01-27 22:48:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:48:44,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:48:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:48:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:48:44,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-27 22:48:44,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:48:44,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:44,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-27 22:48:44,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:44,999 INFO L130 PetriNetUnfolder]: 209/341 cut-off events. [2023-01-27 22:48:44,999 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-01-27 22:48:45,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 341 events. 209/341 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1080 event pairs, 30 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 452. Up to 167 conditions per place. [2023-01-27 22:48:45,001 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-01-27 22:48:45,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-01-27 22:48:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:48:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:48:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-01-27 22:48:45,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869918699186992 [2023-01-27 22:48:45,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-01-27 22:48:45,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-01-27 22:48:45,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:45,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-01-27 22:48:45,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 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) [2023-01-27 22:48:45,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-27 22:48:45,007 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-27 22:48:45,007 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 599 transitions. [2023-01-27 22:48:45,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-01-27 22:48:45,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:48:45,009 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-01-27 22:48:45,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-01-27 22:48:45,010 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-27 22:48:45,010 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-01-27 22:48:45,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:48:45,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:45,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:48:45,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 22:48:45,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:45,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash 109437294, now seen corresponding path program 3 times [2023-01-27 22:48:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167338481] [2023-01-27 22:48:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:45,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:45,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167338481] [2023-01-27 22:48:45,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167338481] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:48:45,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:48:45,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 22:48:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755207431] [2023-01-27 22:48:45,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:48:45,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 22:48:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 22:48:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 22:48:45,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246 [2023-01-27 22:48:45,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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) [2023-01-27 22:48:45,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:45,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246 [2023-01-27 22:48:45,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:45,357 INFO L130 PetriNetUnfolder]: 360/594 cut-off events. [2023-01-27 22:48:45,357 INFO L131 PetriNetUnfolder]: For 409/409 co-relation queries the response was YES. [2023-01-27 22:48:45,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 594 events. 360/594 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2262 event pairs, 43 based on Foata normal form. 20/613 useless extension candidates. Maximal degree in co-relation 1154. Up to 182 conditions per place. [2023-01-27 22:48:45,359 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 52 selfloop transitions, 8 changer transitions 24/84 dead transitions. [2023-01-27 22:48:45,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 84 transitions, 475 flow [2023-01-27 22:48:45,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 22:48:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 22:48:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-01-27 22:48:45,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48606271777003485 [2023-01-27 22:48:45,361 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-01-27 22:48:45,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-01-27 22:48:45,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:45,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-01-27 22:48:45,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 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) [2023-01-27 22:48:45,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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) [2023-01-27 22:48:45,366 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 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) [2023-01-27 22:48:45,366 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 837 transitions. [2023-01-27 22:48:45,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 84 transitions, 475 flow [2023-01-27 22:48:45,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 84 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:48:45,370 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-01-27 22:48:45,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=152, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-01-27 22:48:45,371 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-01-27 22:48:45,373 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-01-27 22:48:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 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) [2023-01-27 22:48:45,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:45,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:48:45,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 22:48:45,374 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:45,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:45,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2055038813, now seen corresponding path program 1 times [2023-01-27 22:48:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407086164] [2023-01-27 22:48:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:45,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:45,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407086164] [2023-01-27 22:48:45,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407086164] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:48:45,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:48:45,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 22:48:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954796096] [2023-01-27 22:48:45,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:48:45,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 22:48:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:45,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 22:48:45,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 22:48:45,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-27 22:48:45,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2023-01-27 22:48:45,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:45,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-27 22:48:45,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:45,506 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2023-01-27 22:48:45,506 INFO L131 PetriNetUnfolder]: For 323/336 co-relation queries the response was YES. [2023-01-27 22:48:45,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 163 events. 80/163 cut-off events. For 323/336 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 457 event pairs, 15 based on Foata normal form. 23/181 useless extension candidates. Maximal degree in co-relation 508. Up to 121 conditions per place. [2023-01-27 22:48:45,508 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-01-27 22:48:45,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 179 flow [2023-01-27 22:48:45,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 22:48:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 22:48:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-01-27 22:48:45,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48644986449864497 [2023-01-27 22:48:45,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-01-27 22:48:45,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-01-27 22:48:45,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:45,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-01-27 22:48:45,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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) [2023-01-27 22:48:45,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-01-27 22:48:45,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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) [2023-01-27 22:48:45,517 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 359 transitions. [2023-01-27 22:48:45,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 179 flow [2023-01-27 22:48:45,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 157 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-01-27 22:48:45,520 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-01-27 22:48:45,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-01-27 22:48:45,521 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-01-27 22:48:45,521 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-01-27 22:48:45,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2023-01-27 22:48:45,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:45,522 INFO L208 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] [2023-01-27 22:48:45,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 22:48:45,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:45,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:45,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1140643143, now seen corresponding path program 1 times [2023-01-27 22:48:45,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:45,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389424071] [2023-01-27 22:48:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:45,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:48:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389424071] [2023-01-27 22:48:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389424071] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:48:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:48:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:48:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433613972] [2023-01-27 22:48:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:48:45,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:48:45,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:48:45,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:48:45,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-01-27 22:48:45,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-01-27 22:48:45,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:45,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-01-27 22:48:45,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:45,680 INFO L130 PetriNetUnfolder]: 83/178 cut-off events. [2023-01-27 22:48:45,680 INFO L131 PetriNetUnfolder]: For 228/250 co-relation queries the response was YES. [2023-01-27 22:48:45,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 178 events. 83/178 cut-off events. For 228/250 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 40 based on Foata normal form. 26/197 useless extension candidates. Maximal degree in co-relation 547. Up to 137 conditions per place. [2023-01-27 22:48:45,681 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-01-27 22:48:45,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 197 flow [2023-01-27 22:48:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 22:48:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 22:48:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-01-27 22:48:45,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2023-01-27 22:48:45,682 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-01-27 22:48:45,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-01-27 22:48:45,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:45,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-01-27 22:48:45,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-01-27 22:48:45,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-01-27 22:48:45,685 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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) [2023-01-27 22:48:45,685 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 447 transitions. [2023-01-27 22:48:45,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 197 flow [2023-01-27 22:48:45,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 22:48:45,686 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-01-27 22:48:45,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-01-27 22:48:45,686 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-01-27 22:48:45,686 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-01-27 22:48:45,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 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) [2023-01-27 22:48:45,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:45,687 INFO L208 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] [2023-01-27 22:48:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 22:48:45,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:45,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 438039640, now seen corresponding path program 1 times [2023-01-27 22:48:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:45,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569416677] [2023-01-27 22:48:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:46,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569416677] [2023-01-27 22:48:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569416677] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:48:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972436265] [2023-01-27 22:48:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:48:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:48:46,272 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) [2023-01-27 22:48:46,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 22:48:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:46,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-27 22:48:46,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:48:46,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:48:46,615 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 [2023-01-27 22:48:46,658 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 [2023-01-27 22:48:46,719 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 [2023-01-27 22:48:46,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:46,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:48:47,272 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1)))))))) is different from false [2023-01-27 22:48:47,346 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse2)) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~back~0 0)) is different from false [2023-01-27 22:48:47,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:47,379 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 68 treesize of output 56 [2023-01-27 22:48:47,393 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:47,393 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 644 treesize of output 620 [2023-01-27 22:48:47,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:47,426 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 296 treesize of output 280 [2023-01-27 22:48:47,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:47,442 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 205 treesize of output 201 [2023-01-27 22:48:47,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:47,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 220 [2023-01-27 22:48:48,019 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:48,020 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 68 treesize of output 56 [2023-01-27 22:48:48,030 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:48:48,031 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 644 treesize of output 616 [2023-01-27 22:48:48,064 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:48:48,064 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 296 treesize of output 252 [2023-01-27 22:48:48,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:48:48,080 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2023-01-27 22:48:48,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:48:48,092 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 181 treesize of output 161 [2023-01-27 22:48:48,210 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:48:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 22:48:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972436265] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:48:48,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:48:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2023-01-27 22:48:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233077884] [2023-01-27 22:48:48,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:48:48,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-27 22:48:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-27 22:48:48,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=615, Unknown=6, NotChecked=106, Total=870 [2023-01-27 22:48:48,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-27 22:48:48,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 120 flow. Second operand has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 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) [2023-01-27 22:48:48,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:48,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-27 22:48:48,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:48,411 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~back~0 4)) (.cse12 (* c_~front~0 4))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse4 (+ c_~queue~0.offset .cse12)) (.cse2 (< c_~back~0 0)) (.cse5 (+ c_~queue~0.offset .cse11))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0)) .cse2) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse4)) 1) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse6 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse6 .cse4))))))) .cse0 .cse1 .cse2) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse9 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse9)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse10 .cse9)) 1) (not (= (select .cse10 .cse8) 1))))))) .cse2) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse14 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 .cse1 (let ((.cse13 (+ c_~sum~0 (select .cse14 .cse4)))) (and (<= .cse13 1) (<= 0 .cse13))) .cse2 (not (= (select .cse14 .cse5) 1))))))) is different from false [2023-01-27 22:48:51,815 INFO L130 PetriNetUnfolder]: 1442/2387 cut-off events. [2023-01-27 22:48:51,815 INFO L131 PetriNetUnfolder]: For 2320/2320 co-relation queries the response was YES. [2023-01-27 22:48:51,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 2387 events. 1442/2387 cut-off events. For 2320/2320 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12028 event pairs, 66 based on Foata normal form. 140/2523 useless extension candidates. Maximal degree in co-relation 7441. Up to 465 conditions per place. [2023-01-27 22:48:51,826 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 266 selfloop transitions, 134 changer transitions 57/457 dead transitions. [2023-01-27 22:48:51,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 457 transitions, 2682 flow [2023-01-27 22:48:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-01-27 22:48:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-01-27 22:48:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 4980 transitions. [2023-01-27 22:48:51,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27731373204143 [2023-01-27 22:48:51,836 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 4980 transitions. [2023-01-27 22:48:51,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 4980 transitions. [2023-01-27 22:48:51,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:48:51,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 4980 transitions. [2023-01-27 22:48:51,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 68.21917808219177) internal successors, (4980), 73 states have internal predecessors, (4980), 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) [2023-01-27 22:48:51,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 246.0) internal successors, (18204), 74 states have internal predecessors, (18204), 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) [2023-01-27 22:48:51,860 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 246.0) internal successors, (18204), 74 states have internal predecessors, (18204), 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) [2023-01-27 22:48:51,860 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 73 states and 4980 transitions. [2023-01-27 22:48:51,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 457 transitions, 2682 flow [2023-01-27 22:48:51,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 457 transitions, 2666 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-27 22:48:51,868 INFO L231 Difference]: Finished difference. Result has 148 places, 174 transitions, 1386 flow [2023-01-27 22:48:51,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=1386, PETRI_PLACES=148, PETRI_TRANSITIONS=174} [2023-01-27 22:48:51,868 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2023-01-27 22:48:51,869 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 174 transitions, 1386 flow [2023-01-27 22:48:51,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.96666666666667) internal successors, (1919), 30 states have internal predecessors, (1919), 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) [2023-01-27 22:48:51,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:48:51,869 INFO L208 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] [2023-01-27 22:48:51,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 22:48:52,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 22:48:52,074 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:48:52,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:48:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash -657298170, now seen corresponding path program 2 times [2023-01-27 22:48:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:48:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348494534] [2023-01-27 22:48:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:48:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:48:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:48:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:52,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:48:52,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348494534] [2023-01-27 22:48:52,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348494534] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:48:52,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696980243] [2023-01-27 22:48:52,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:48:52,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:48:52,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:48:52,666 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) [2023-01-27 22:48:52,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 22:48:52,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:48:52,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:48:52,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-27 22:48:52,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:48:52,801 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 11 treesize of output 7 [2023-01-27 22:48:52,854 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 [2023-01-27 22:48:52,897 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 [2023-01-27 22:48:53,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:48:53,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 22:48:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:48:53,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:48:53,185 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0))))))) is different from false [2023-01-27 22:48:53,246 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2))))))) is different from false [2023-01-27 22:48:53,302 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse0)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-01-27 22:48:53,343 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) is different from false [2023-01-27 22:48:53,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:53,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-01-27 22:48:53,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:53,472 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 484 treesize of output 460 [2023-01-27 22:48:53,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-01-27 22:48:53,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:53,498 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 126 treesize of output 122 [2023-01-27 22:48:53,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:53,508 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 125 treesize of output 109 [2023-01-27 22:48:53,756 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:53,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-01-27 22:48:53,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:48:53,764 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:48:53,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2023-01-27 22:48:53,773 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:48:53,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 112 [2023-01-27 22:48:53,784 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:48:53,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 75 [2023-01-27 22:48:53,821 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:48:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 22:48:53,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696980243] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:48:53,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:48:53,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-01-27 22:48:53,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623246164] [2023-01-27 22:48:53,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:48:53,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:48:53,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:48:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:48:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=586, Unknown=5, NotChecked=212, Total=930 [2023-01-27 22:48:53,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-27 22:48:53,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 174 transitions, 1386 flow. Second operand has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 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) [2023-01-27 22:48:53,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:48:53,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-27 22:48:53,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:48:54,111 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse6 (< c_~back~0 0))) (and (<= c_~v_assert~0 1) (or .cse0 .cse1 (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3)) 1)) (not (= (select (select .cse2 c_~queue~0.base) .cse4) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse5 c_~queue~0.base) .cse4) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3)))))))) .cse6) (or .cse1 .cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse3))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse4) 1))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse6 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-27 22:48:54,226 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-27 22:48:55,133 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~back~0)) (.cse1 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 c_~sum~0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or .cse0 .cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse2)))))) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (or (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-27 22:49:00,486 INFO L130 PetriNetUnfolder]: 2114/3527 cut-off events. [2023-01-27 22:49:00,486 INFO L131 PetriNetUnfolder]: For 100378/100378 co-relation queries the response was YES. [2023-01-27 22:49:00,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23765 conditions, 3527 events. 2114/3527 cut-off events. For 100378/100378 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19528 event pairs, 147 based on Foata normal form. 90/3615 useless extension candidates. Maximal degree in co-relation 23716. Up to 809 conditions per place. [2023-01-27 22:49:00,515 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 317 selfloop transitions, 192 changer transitions 86/595 dead transitions. [2023-01-27 22:49:00,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 595 transitions, 6493 flow [2023-01-27 22:49:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-27 22:49:00,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-27 22:49:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3252 transitions. [2023-01-27 22:49:00,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27540650406504064 [2023-01-27 22:49:00,521 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3252 transitions. [2023-01-27 22:49:00,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3252 transitions. [2023-01-27 22:49:00,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:00,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3252 transitions. [2023-01-27 22:49:00,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 67.75) internal successors, (3252), 48 states have internal predecessors, (3252), 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) [2023-01-27 22:49:00,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 246.0) internal successors, (12054), 49 states have internal predecessors, (12054), 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) [2023-01-27 22:49:00,538 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 246.0) internal successors, (12054), 49 states have internal predecessors, (12054), 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) [2023-01-27 22:49:00,538 INFO L175 Difference]: Start difference. First operand has 148 places, 174 transitions, 1386 flow. Second operand 48 states and 3252 transitions. [2023-01-27 22:49:00,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 595 transitions, 6493 flow [2023-01-27 22:49:00,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 595 transitions, 5815 flow, removed 315 selfloop flow, removed 8 redundant places. [2023-01-27 22:49:00,699 INFO L231 Difference]: Finished difference. Result has 207 places, 307 transitions, 3046 flow [2023-01-27 22:49:00,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3046, PETRI_PLACES=207, PETRI_TRANSITIONS=307} [2023-01-27 22:49:00,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2023-01-27 22:49:00,699 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 307 transitions, 3046 flow [2023-01-27 22:49:00,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 63.903225806451616) internal successors, (1981), 31 states have internal predecessors, (1981), 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) [2023-01-27 22:49:00,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:00,700 INFO L208 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] [2023-01-27 22:49:00,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 22:49:00,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-01-27 22:49:00,906 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:00,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:00,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1429573320, now seen corresponding path program 3 times [2023-01-27 22:49:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:00,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674059968] [2023-01-27 22:49:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:00,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674059968] [2023-01-27 22:49:01,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674059968] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:01,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304643808] [2023-01-27 22:49:01,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:49:01,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:01,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:01,497 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) [2023-01-27 22:49:01,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 22:49:01,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:49:01,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:01,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-27 22:49:01,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:01,619 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 11 treesize of output 7 [2023-01-27 22:49:01,679 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 [2023-01-27 22:49:01,729 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 [2023-01-27 22:49:01,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:49:01,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 22:49:01,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:01,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:02,033 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)))))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-27 22:49:02,069 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2)))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-27 22:49:02,136 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2023-01-27 22:49:02,191 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2))))))) (forall ((v_ArrVal_246 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2)) 1)) (not (= (select (select .cse3 c_~queue~0.base) .cse1) 1))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0)) is different from false [2023-01-27 22:49:02,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:02,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-01-27 22:49:02,335 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:02,335 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 402 treesize of output 386 [2023-01-27 22:49:02,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-01-27 22:49:02,365 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:02,365 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 138 treesize of output 122 [2023-01-27 22:49:02,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:02,373 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 114 treesize of output 110 [2023-01-27 22:49:02,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:02,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-01-27 22:49:02,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:49:02,555 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:49:02,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 316 treesize of output 288 [2023-01-27 22:49:02,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:49:02,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2023-01-27 22:49:02,583 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 22:49:02,583 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 95 treesize of output 75 [2023-01-27 22:49:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 22:49:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304643808] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:02,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2023-01-27 22:49:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287146188] [2023-01-27 22:49:02,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:02,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-27 22:49:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-27 22:49:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=632, Unknown=6, NotChecked=220, Total=992 [2023-01-27 22:49:02,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-27 22:49:02,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 307 transitions, 3046 flow. Second operand has 32 states, 32 states have (on average 63.78125) internal successors, (2041), 32 states have internal predecessors, (2041), 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) [2023-01-27 22:49:02,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:02,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-27 22:49:02,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:03,110 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~back~0 0) (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1)))) (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2) 1))))) (forall ((v_ArrVal_245 (Array Int Int)) (v_ArrVal_246 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_245) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_246))) (or (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1)) 1)) (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2) 1))))))))) is different from false [2023-01-27 22:49:03,365 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse5 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse5))))))) (.cse4 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (< c_~back~0 0))) (and (<= c_~v_assert~0 1) (or .cse0 .cse1 .cse2 .cse3 .cse4) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 .cse2 .cse3 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse4) (or .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse3 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-27 22:49:04,129 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 c_~sum~0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse0)))))) .cse1 .cse2 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (or (= (mod c_~v_assert~0 256) 0) (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0))))) is different from false [2023-01-27 22:49:04,234 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_247 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_247 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_247) c_~queue~0.base) .cse2))))))) (.cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (and (or .cse0 .cse1) (or .cse0 (<= c_~n~0 c_~back~0) (< c_~back~0 0) .cse1 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))))) is different from false [2023-01-27 22:49:13,492 INFO L130 PetriNetUnfolder]: 2149/3594 cut-off events. [2023-01-27 22:49:13,492 INFO L131 PetriNetUnfolder]: For 131960/131960 co-relation queries the response was YES. [2023-01-27 22:49:13,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28422 conditions, 3594 events. 2149/3594 cut-off events. For 131960/131960 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 20036 event pairs, 200 based on Foata normal form. 64/3649 useless extension candidates. Maximal degree in co-relation 28353. Up to 1111 conditions per place. [2023-01-27 22:49:13,524 INFO L137 encePairwiseOnDemand]: 228/246 looper letters, 314 selfloop transitions, 200 changer transitions 69/583 dead transitions. [2023-01-27 22:49:13,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 583 transitions, 7412 flow [2023-01-27 22:49:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-01-27 22:49:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-01-27 22:49:13,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 3301 transitions. [2023-01-27 22:49:13,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2738510038161606 [2023-01-27 22:49:13,528 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 3301 transitions. [2023-01-27 22:49:13,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 3301 transitions. [2023-01-27 22:49:13,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:13,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 3301 transitions. [2023-01-27 22:49:13,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 67.36734693877551) internal successors, (3301), 49 states have internal predecessors, (3301), 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) [2023-01-27 22:49:13,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 246.0) internal successors, (12300), 50 states have internal predecessors, (12300), 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) [2023-01-27 22:49:13,542 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 246.0) internal successors, (12300), 50 states have internal predecessors, (12300), 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) [2023-01-27 22:49:13,542 INFO L175 Difference]: Start difference. First operand has 207 places, 307 transitions, 3046 flow. Second operand 49 states and 3301 transitions. [2023-01-27 22:49:13,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 583 transitions, 7412 flow [2023-01-27 22:49:13,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 583 transitions, 6869 flow, removed 248 selfloop flow, removed 19 redundant places. [2023-01-27 22:49:13,783 INFO L231 Difference]: Finished difference. Result has 246 places, 326 transitions, 3531 flow [2023-01-27 22:49:13,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2657, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=3531, PETRI_PLACES=246, PETRI_TRANSITIONS=326} [2023-01-27 22:49:13,784 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 215 predicate places. [2023-01-27 22:49:13,784 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 326 transitions, 3531 flow [2023-01-27 22:49:13,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 63.78125) internal successors, (2041), 32 states have internal predecessors, (2041), 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) [2023-01-27 22:49:13,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:13,785 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:49:13,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 22:49:13,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:13,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:13,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -578987259, now seen corresponding path program 4 times [2023-01-27 22:49:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:13,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130771442] [2023-01-27 22:49:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:13,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130771442] [2023-01-27 22:49:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130771442] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875020123] [2023-01-27 22:49:14,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:49:14,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:14,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:14,822 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) [2023-01-27 22:49:14,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 22:49:14,896 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:49:14,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:14,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-27 22:49:14,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:15,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:49:15,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:15,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:15,147 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 68 treesize of output 44 [2023-01-27 22:49:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:49:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875020123] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:15,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2023-01-27 22:49:15,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565160918] [2023-01-27 22:49:15,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:15,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-27 22:49:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:15,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-27 22:49:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2023-01-27 22:49:15,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-27 22:49:15,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 326 transitions, 3531 flow. Second operand has 25 states, 25 states have (on average 74.48) internal successors, (1862), 25 states have internal predecessors, (1862), 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) [2023-01-27 22:49:15,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:15,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-27 22:49:15,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:17,059 INFO L130 PetriNetUnfolder]: 2437/4060 cut-off events. [2023-01-27 22:49:17,059 INFO L131 PetriNetUnfolder]: For 143104/143104 co-relation queries the response was YES. [2023-01-27 22:49:17,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32444 conditions, 4060 events. 2437/4060 cut-off events. For 143104/143104 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22827 event pairs, 125 based on Foata normal form. 56/4115 useless extension candidates. Maximal degree in co-relation 32367. Up to 1270 conditions per place. [2023-01-27 22:49:17,086 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 263 selfloop transitions, 272 changer transitions 38/573 dead transitions. [2023-01-27 22:49:17,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 573 transitions, 7607 flow [2023-01-27 22:49:17,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 22:49:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-27 22:49:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2716 transitions. [2023-01-27 22:49:17,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3154471544715447 [2023-01-27 22:49:17,089 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2716 transitions. [2023-01-27 22:49:17,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2716 transitions. [2023-01-27 22:49:17,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:17,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2716 transitions. [2023-01-27 22:49:17,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 77.6) internal successors, (2716), 35 states have internal predecessors, (2716), 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) [2023-01-27 22:49:17,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 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) [2023-01-27 22:49:17,099 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 246.0) internal successors, (8856), 36 states have internal predecessors, (8856), 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) [2023-01-27 22:49:17,099 INFO L175 Difference]: Start difference. First operand has 246 places, 326 transitions, 3531 flow. Second operand 35 states and 2716 transitions. [2023-01-27 22:49:17,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 573 transitions, 7607 flow [2023-01-27 22:49:17,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 573 transitions, 7327 flow, removed 83 selfloop flow, removed 31 redundant places. [2023-01-27 22:49:17,338 INFO L231 Difference]: Finished difference. Result has 252 places, 393 transitions, 4929 flow [2023-01-27 22:49:17,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=3345, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4929, PETRI_PLACES=252, PETRI_TRANSITIONS=393} [2023-01-27 22:49:17,339 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2023-01-27 22:49:17,339 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 393 transitions, 4929 flow [2023-01-27 22:49:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 74.48) internal successors, (1862), 25 states have internal predecessors, (1862), 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) [2023-01-27 22:49:17,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:17,339 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:49:17,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 22:49:17,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:17,541 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:17,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1028482245, now seen corresponding path program 5 times [2023-01-27 22:49:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279185033] [2023-01-27 22:49:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:18,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279185033] [2023-01-27 22:49:18,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279185033] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114480350] [2023-01-27 22:49:18,201 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:49:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:18,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:18,202 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) [2023-01-27 22:49:18,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 22:49:18,274 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:49:18,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:18,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-27 22:49:18,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:18,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:49:18,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:49:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:49:18,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:18,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:49:18,620 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 110 treesize of output 86 [2023-01-27 22:49:18,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-01-27 22:49:18,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-01-27 22:49:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:49:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114480350] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:18,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2023-01-27 22:49:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056618911] [2023-01-27 22:49:18,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:18,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-27 22:49:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:18,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-27 22:49:18,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=597, Unknown=3, NotChecked=0, Total=702 [2023-01-27 22:49:18,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 246 [2023-01-27 22:49:18,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 393 transitions, 4929 flow. Second operand has 27 states, 27 states have (on average 72.11111111111111) internal successors, (1947), 27 states have internal predecessors, (1947), 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) [2023-01-27 22:49:18,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:18,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 246 [2023-01-27 22:49:18,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:20,325 INFO L130 PetriNetUnfolder]: 2723/4534 cut-off events. [2023-01-27 22:49:20,325 INFO L131 PetriNetUnfolder]: For 158448/158448 co-relation queries the response was YES. [2023-01-27 22:49:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38400 conditions, 4534 events. 2723/4534 cut-off events. For 158448/158448 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 26083 event pairs, 198 based on Foata normal form. 82/4607 useless extension candidates. Maximal degree in co-relation 38321. Up to 1489 conditions per place. [2023-01-27 22:49:20,356 INFO L137 encePairwiseOnDemand]: 237/246 looper letters, 274 selfloop transitions, 151 changer transitions 179/604 dead transitions. [2023-01-27 22:49:20,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 604 transitions, 9225 flow [2023-01-27 22:49:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 22:49:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 22:49:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1378 transitions. [2023-01-27 22:49:20,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3112014453477868 [2023-01-27 22:49:20,360 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1378 transitions. [2023-01-27 22:49:20,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1378 transitions. [2023-01-27 22:49:20,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:20,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1378 transitions. [2023-01-27 22:49:20,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 76.55555555555556) internal successors, (1378), 18 states have internal predecessors, (1378), 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) [2023-01-27 22:49:20,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 246.0) internal successors, (4674), 19 states have internal predecessors, (4674), 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) [2023-01-27 22:49:20,367 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 246.0) internal successors, (4674), 19 states have internal predecessors, (4674), 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) [2023-01-27 22:49:20,367 INFO L175 Difference]: Start difference. First operand has 252 places, 393 transitions, 4929 flow. Second operand 18 states and 1378 transitions. [2023-01-27 22:49:20,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 604 transitions, 9225 flow [2023-01-27 22:49:20,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 604 transitions, 8539 flow, removed 118 selfloop flow, removed 18 redundant places. [2023-01-27 22:49:20,773 INFO L231 Difference]: Finished difference. Result has 251 places, 336 transitions, 4248 flow [2023-01-27 22:49:20,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=4349, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4248, PETRI_PLACES=251, PETRI_TRANSITIONS=336} [2023-01-27 22:49:20,774 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 220 predicate places. [2023-01-27 22:49:20,774 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 336 transitions, 4248 flow [2023-01-27 22:49:20,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 72.11111111111111) internal successors, (1947), 27 states have internal predecessors, (1947), 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) [2023-01-27 22:49:20,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:20,775 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:49:20,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-27 22:49:20,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-27 22:49:20,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:20,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1297298077, now seen corresponding path program 6 times [2023-01-27 22:49:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978717698] [2023-01-27 22:49:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:20,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978717698] [2023-01-27 22:49:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978717698] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632519644] [2023-01-27 22:49:21,104 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:49:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:21,105 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) [2023-01-27 22:49:21,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 22:49:21,230 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-27 22:49:21,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:21,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-27 22:49:21,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:21,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632519644] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:21,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:21,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-01-27 22:49:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825495399] [2023-01-27 22:49:21,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:21,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-27 22:49:21,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-27 22:49:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-01-27 22:49:21,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 246 [2023-01-27 22:49:21,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 336 transitions, 4248 flow. Second operand has 17 states, 17 states have (on average 102.82352941176471) internal successors, (1748), 17 states have internal predecessors, (1748), 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) [2023-01-27 22:49:21,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:21,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 246 [2023-01-27 22:49:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:21,873 INFO L130 PetriNetUnfolder]: 931/1813 cut-off events. [2023-01-27 22:49:21,873 INFO L131 PetriNetUnfolder]: For 98842/98975 co-relation queries the response was YES. [2023-01-27 22:49:21,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16955 conditions, 1813 events. 931/1813 cut-off events. For 98842/98975 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10835 event pairs, 268 based on Foata normal form. 139/1881 useless extension candidates. Maximal degree in co-relation 16879. Up to 905 conditions per place. [2023-01-27 22:49:21,888 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 123 selfloop transitions, 3 changer transitions 61/249 dead transitions. [2023-01-27 22:49:21,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 249 transitions, 3488 flow [2023-01-27 22:49:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 22:49:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 22:49:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 847 transitions. [2023-01-27 22:49:21,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303861788617886 [2023-01-27 22:49:21,889 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 847 transitions. [2023-01-27 22:49:21,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 847 transitions. [2023-01-27 22:49:21,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:21,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 847 transitions. [2023-01-27 22:49:21,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.875) internal successors, (847), 8 states have internal predecessors, (847), 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) [2023-01-27 22:49:21,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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) [2023-01-27 22:49:21,891 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 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) [2023-01-27 22:49:21,892 INFO L175 Difference]: Start difference. First operand has 251 places, 336 transitions, 4248 flow. Second operand 8 states and 847 transitions. [2023-01-27 22:49:21,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 249 transitions, 3488 flow [2023-01-27 22:49:22,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 249 transitions, 3062 flow, removed 121 selfloop flow, removed 31 redundant places. [2023-01-27 22:49:22,017 INFO L231 Difference]: Finished difference. Result has 202 places, 188 transitions, 2111 flow [2023-01-27 22:49:22,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2502, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2111, PETRI_PLACES=202, PETRI_TRANSITIONS=188} [2023-01-27 22:49:22,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 171 predicate places. [2023-01-27 22:49:22,018 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 188 transitions, 2111 flow [2023-01-27 22:49:22,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 102.82352941176471) internal successors, (1748), 17 states have internal predecessors, (1748), 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) [2023-01-27 22:49:22,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:22,018 INFO L208 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] [2023-01-27 22:49:22,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-27 22:49:22,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:22,223 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:22,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -595027192, now seen corresponding path program 7 times [2023-01-27 22:49:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:22,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258983608] [2023-01-27 22:49:22,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:49:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258983608] [2023-01-27 22:49:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258983608] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:49:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:49:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 22:49:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470916486] [2023-01-27 22:49:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:49:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 22:49:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 22:49:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 22:49:22,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-27 22:49:22,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 188 transitions, 2111 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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) [2023-01-27 22:49:22,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:22,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-27 22:49:22,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:22,800 INFO L130 PetriNetUnfolder]: 1282/2471 cut-off events. [2023-01-27 22:49:22,800 INFO L131 PetriNetUnfolder]: For 56942/57099 co-relation queries the response was YES. [2023-01-27 22:49:22,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18592 conditions, 2471 events. 1282/2471 cut-off events. For 56942/57099 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14869 event pairs, 172 based on Foata normal form. 161/2552 useless extension candidates. Maximal degree in co-relation 18535. Up to 896 conditions per place. [2023-01-27 22:49:22,826 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 137 selfloop transitions, 83 changer transitions 0/282 dead transitions. [2023-01-27 22:49:22,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 282 transitions, 3765 flow [2023-01-27 22:49:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:49:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:49:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-01-27 22:49:22,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902439024390244 [2023-01-27 22:49:22,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-01-27 22:49:22,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-01-27 22:49:22,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:22,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-01-27 22:49:22,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 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) [2023-01-27 22:49:22,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-27 22:49:22,830 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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) [2023-01-27 22:49:22,830 INFO L175 Difference]: Start difference. First operand has 202 places, 188 transitions, 2111 flow. Second operand 5 states and 603 transitions. [2023-01-27 22:49:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 282 transitions, 3765 flow [2023-01-27 22:49:22,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 282 transitions, 3510 flow, removed 80 selfloop flow, removed 15 redundant places. [2023-01-27 22:49:22,890 INFO L231 Difference]: Finished difference. Result has 161 places, 233 transitions, 3033 flow [2023-01-27 22:49:22,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3033, PETRI_PLACES=161, PETRI_TRANSITIONS=233} [2023-01-27 22:49:22,891 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2023-01-27 22:49:22,891 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 233 transitions, 3033 flow [2023-01-27 22:49:22,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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) [2023-01-27 22:49:22,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:22,891 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:49:22,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 22:49:22,891 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:22,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1935538290, now seen corresponding path program 8 times [2023-01-27 22:49:22,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:22,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116734455] [2023-01-27 22:49:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116734455] [2023-01-27 22:49:23,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116734455] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200765681] [2023-01-27 22:49:23,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:49:23,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:23,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:23,683 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) [2023-01-27 22:49:23,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 22:49:23,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:49:23,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:23,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-27 22:49:23,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:24,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:24,748 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-27 22:49:24,748 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 224 treesize of output 178 [2023-01-27 22:49:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200765681] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:25,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 35 [2023-01-27 22:49:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633311313] [2023-01-27 22:49:25,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 22:49:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 22:49:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1047, Unknown=0, NotChecked=0, Total=1260 [2023-01-27 22:49:25,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-27 22:49:25,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 233 transitions, 3033 flow. Second operand has 36 states, 36 states have (on average 74.05555555555556) internal successors, (2666), 36 states have internal predecessors, (2666), 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) [2023-01-27 22:49:25,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:25,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-27 22:49:25,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:33,429 INFO L130 PetriNetUnfolder]: 8805/14803 cut-off events. [2023-01-27 22:49:33,429 INFO L131 PetriNetUnfolder]: For 173392/173392 co-relation queries the response was YES. [2023-01-27 22:49:33,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101468 conditions, 14803 events. 8805/14803 cut-off events. For 173392/173392 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 104373 event pairs, 361 based on Foata normal form. 617/15419 useless extension candidates. Maximal degree in co-relation 101420. Up to 4608 conditions per place. [2023-01-27 22:49:33,523 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 668 selfloop transitions, 674 changer transitions 304/1646 dead transitions. [2023-01-27 22:49:33,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1646 transitions, 23714 flow [2023-01-27 22:49:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-01-27 22:49:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2023-01-27 22:49:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 9254 transitions. [2023-01-27 22:49:33,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3187956455835745 [2023-01-27 22:49:33,532 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 9254 transitions. [2023-01-27 22:49:33,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 9254 transitions. [2023-01-27 22:49:33,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:33,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 9254 transitions. [2023-01-27 22:49:33,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 119 states, 118 states have (on average 78.42372881355932) internal successors, (9254), 118 states have internal predecessors, (9254), 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) [2023-01-27 22:49:33,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 119 states, 119 states have (on average 246.0) internal successors, (29274), 119 states have internal predecessors, (29274), 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) [2023-01-27 22:49:33,568 INFO L81 ComplementDD]: Finished complementDD. Result has 119 states, 119 states have (on average 246.0) internal successors, (29274), 119 states have internal predecessors, (29274), 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) [2023-01-27 22:49:33,568 INFO L175 Difference]: Start difference. First operand has 161 places, 233 transitions, 3033 flow. Second operand 118 states and 9254 transitions. [2023-01-27 22:49:33,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1646 transitions, 23714 flow [2023-01-27 22:49:34,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1646 transitions, 23391 flow, removed 139 selfloop flow, removed 2 redundant places. [2023-01-27 22:49:34,193 INFO L231 Difference]: Finished difference. Result has 333 places, 789 transitions, 14003 flow [2023-01-27 22:49:34,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=2942, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=14003, PETRI_PLACES=333, PETRI_TRANSITIONS=789} [2023-01-27 22:49:34,194 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 302 predicate places. [2023-01-27 22:49:34,194 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 789 transitions, 14003 flow [2023-01-27 22:49:34,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 74.05555555555556) internal successors, (2666), 36 states have internal predecessors, (2666), 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) [2023-01-27 22:49:34,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:34,195 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:49:34,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 22:49:34,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:34,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:34,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1229050224, now seen corresponding path program 9 times [2023-01-27 22:49:34,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:34,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768955450] [2023-01-27 22:49:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768955450] [2023-01-27 22:49:35,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768955450] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432535734] [2023-01-27 22:49:35,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:49:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:35,048 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) [2023-01-27 22:49:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 22:49:35,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-01-27 22:49:35,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:35,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-27 22:49:35,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:35,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:36,079 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-27 22:49:36,080 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 224 treesize of output 178 [2023-01-27 22:49:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:36,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432535734] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:36,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:36,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2023-01-27 22:49:36,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444012763] [2023-01-27 22:49:36,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:36,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-27 22:49:36,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:36,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-27 22:49:36,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2023-01-27 22:49:36,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-27 22:49:36,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 789 transitions, 14003 flow. Second operand has 35 states, 35 states have (on average 74.22857142857143) internal successors, (2598), 35 states have internal predecessors, (2598), 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) [2023-01-27 22:49:36,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:36,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-27 22:49:36,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:45,144 INFO L130 PetriNetUnfolder]: 11177/18827 cut-off events. [2023-01-27 22:49:45,144 INFO L131 PetriNetUnfolder]: For 838053/838053 co-relation queries the response was YES. [2023-01-27 22:49:45,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182963 conditions, 18827 events. 11177/18827 cut-off events. For 838053/838053 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 137792 event pairs, 1149 based on Foata normal form. 438/19264 useless extension candidates. Maximal degree in co-relation 182859. Up to 5966 conditions per place. [2023-01-27 22:49:45,353 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 752 selfloop transitions, 963 changer transitions 395/2110 dead transitions. [2023-01-27 22:49:45,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 2110 transitions, 41149 flow [2023-01-27 22:49:45,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-01-27 22:49:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-01-27 22:49:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 7165 transitions. [2023-01-27 22:49:45,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.316587133262637 [2023-01-27 22:49:45,360 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 7165 transitions. [2023-01-27 22:49:45,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 7165 transitions. [2023-01-27 22:49:45,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:49:45,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 7165 transitions. [2023-01-27 22:49:45,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 77.8804347826087) internal successors, (7165), 92 states have internal predecessors, (7165), 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) [2023-01-27 22:49:45,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 246.0) internal successors, (22878), 93 states have internal predecessors, (22878), 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) [2023-01-27 22:49:45,378 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 246.0) internal successors, (22878), 93 states have internal predecessors, (22878), 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) [2023-01-27 22:49:45,378 INFO L175 Difference]: Start difference. First operand has 333 places, 789 transitions, 14003 flow. Second operand 92 states and 7165 transitions. [2023-01-27 22:49:45,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 2110 transitions, 41149 flow [2023-01-27 22:49:51,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 2110 transitions, 34857 flow, removed 2186 selfloop flow, removed 21 redundant places. [2023-01-27 22:49:51,958 INFO L231 Difference]: Finished difference. Result has 434 places, 1325 transitions, 23445 flow [2023-01-27 22:49:51,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=11350, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=789, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=454, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=23445, PETRI_PLACES=434, PETRI_TRANSITIONS=1325} [2023-01-27 22:49:51,959 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 403 predicate places. [2023-01-27 22:49:51,959 INFO L495 AbstractCegarLoop]: Abstraction has has 434 places, 1325 transitions, 23445 flow [2023-01-27 22:49:51,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 74.22857142857143) internal successors, (2598), 35 states have internal predecessors, (2598), 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) [2023-01-27 22:49:51,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:49:51,959 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:49:51,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-01-27 22:49:52,164 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,SelfDestructingSolverStorable13 [2023-01-27 22:49:52,164 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:49:52,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:49:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1752078756, now seen corresponding path program 10 times [2023-01-27 22:49:52,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:49:52,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047422157] [2023-01-27 22:49:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:49:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:49:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:49:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:52,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:49:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047422157] [2023-01-27 22:49:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047422157] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:49:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665259185] [2023-01-27 22:49:52,968 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:49:52,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:49:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:49:52,969 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) [2023-01-27 22:49:52,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 22:49:53,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:49:53,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:49:53,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-27 22:49:53,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:49:53,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:49:53,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-01-27 22:49:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:49:53,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:49:53,641 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse0) c_~sum~0))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse0) c_~sum~0) 1)))) is different from false [2023-01-27 22:49:53,670 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0) 1)))) (< c_~back~0 0)) is different from false [2023-01-27 22:49:53,712 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) is different from false [2023-01-27 22:49:53,872 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-27 22:49:53,872 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 286 treesize of output 224 [2023-01-27 22:49:53,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-01-27 22:49:53,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-01-27 22:49:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-01-27 22:49:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665259185] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:49:54,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:49:54,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2023-01-27 22:49:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697936861] [2023-01-27 22:49:54,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:49:54,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-27 22:49:54,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:49:54,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-27 22:49:54,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=957, Unknown=3, NotChecked=198, Total=1332 [2023-01-27 22:49:54,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 246 [2023-01-27 22:49:54,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 1325 transitions, 23445 flow. Second operand has 37 states, 37 states have (on average 71.83783783783784) internal successors, (2658), 37 states have internal predecessors, (2658), 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) [2023-01-27 22:49:54,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:49:54,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 246 [2023-01-27 22:49:54,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:49:55,875 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:49:56,371 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:49:57,637 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0) 1)))) (< c_~back~0 0)) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-27 22:49:58,632 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse6))) (and (<= c_~v_assert~0 1) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse0) c_~sum~0))) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse0) c_~sum~0) 1)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (<= c_~n~0 c_~back~0) (let ((.cse4 (select .cse3 .cse0)) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse5)))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))))) is different from false [2023-01-27 22:49:58,639 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:49:58,994 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0) 1)))) (< c_~back~0 0)) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-27 22:49:59,085 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:49:59,420 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0))) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse2) c_~sum~0) 1)))) (< c_~back~0 0)) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0)) is different from false [2023-01-27 22:49:59,799 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse0) c_~sum~0))) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse0) c_~sum~0) 1)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2023-01-27 22:50:01,619 WARN L839 $PredicateComparison]: unable to prove that (and (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:50:08,653 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_557 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_557 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_557) c_~queue~0.base) .cse4))))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:50:13,878 INFO L130 PetriNetUnfolder]: 25082/41479 cut-off events. [2023-01-27 22:50:13,878 INFO L131 PetriNetUnfolder]: For 2318747/2318747 co-relation queries the response was YES. [2023-01-27 22:50:14,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418905 conditions, 41479 events. 25082/41479 cut-off events. For 2318747/2318747 co-relation queries the response was YES. Maximal size of possible extension queue 1736. Compared 336324 event pairs, 1785 based on Foata normal form. 434/41910 useless extension candidates. Maximal degree in co-relation 418774. Up to 13820 conditions per place. [2023-01-27 22:50:14,644 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 1599 selfloop transitions, 1932 changer transitions 820/4351 dead transitions. [2023-01-27 22:50:14,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 4351 transitions, 86280 flow [2023-01-27 22:50:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-01-27 22:50:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2023-01-27 22:50:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 6153 transitions. [2023-01-27 22:50:14,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3126524390243902 [2023-01-27 22:50:14,650 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 6153 transitions. [2023-01-27 22:50:14,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 6153 transitions. [2023-01-27 22:50:14,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:50:14,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 6153 transitions. [2023-01-27 22:50:14,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 76.9125) internal successors, (6153), 80 states have internal predecessors, (6153), 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) [2023-01-27 22:50:14,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 246.0) internal successors, (19926), 81 states have internal predecessors, (19926), 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) [2023-01-27 22:50:14,668 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 246.0) internal successors, (19926), 81 states have internal predecessors, (19926), 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) [2023-01-27 22:50:14,668 INFO L175 Difference]: Start difference. First operand has 434 places, 1325 transitions, 23445 flow. Second operand 80 states and 6153 transitions. [2023-01-27 22:50:14,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 4351 transitions, 86280 flow [2023-01-27 22:50:43,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 4351 transitions, 78497 flow, removed 3405 selfloop flow, removed 23 redundant places. [2023-01-27 22:50:43,445 INFO L231 Difference]: Finished difference. Result has 540 places, 2847 transitions, 55810 flow [2023-01-27 22:50:43,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=20924, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=681, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=55810, PETRI_PLACES=540, PETRI_TRANSITIONS=2847} [2023-01-27 22:50:43,447 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 509 predicate places. [2023-01-27 22:50:43,447 INFO L495 AbstractCegarLoop]: Abstraction has has 540 places, 2847 transitions, 55810 flow [2023-01-27 22:50:43,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 71.83783783783784) internal successors, (2658), 37 states have internal predecessors, (2658), 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) [2023-01-27 22:50:43,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:50:43,447 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:50:43,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 22:50:43,649 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,SelfDestructingSolverStorable14 [2023-01-27 22:50:43,649 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:50:43,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:50:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash 194702976, now seen corresponding path program 11 times [2023-01-27 22:50:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:50:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892707781] [2023-01-27 22:50:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:50:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:50:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:50:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:50:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:50:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892707781] [2023-01-27 22:50:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892707781] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:50:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655291209] [2023-01-27 22:50:44,415 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:50:44,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:50:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:50:44,417 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) [2023-01-27 22:50:44,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 22:50:44,501 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-01-27 22:50:44,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:50:44,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjunts are in the unsatisfiable core [2023-01-27 22:50:44,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:50:44,591 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 11 treesize of output 7 [2023-01-27 22:50:44,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 [2023-01-27 22:50:44,695 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 [2023-01-27 22:50:44,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:50:44,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:50:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:50:45,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:50:45,515 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9 4)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse5 (<= c_~back~0 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2)) 1) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 (not .cse6)) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2))) (not (= (select .cse7 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2)) 1) (not (= (select .cse8 .cse3) 1)))))) .cse5 .cse6)))) (<= c_~n~0 c_~back~0) (< c_~front~0 0)) is different from false [2023-01-27 22:50:46,075 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~back~0 1))) (or (let ((.cse9 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (+ c_~queue~0.offset .cse9)) (.cse5 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_609 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse2 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4)) 1) (not (= 0 (+ (select .cse2 .cse5) 1))))))))) (forall ((v_ArrVal_609 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse6 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse7 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse3) (select .cse7 .cse4))) (not (= 0 (+ (select .cse7 .cse5) 1)))))))))))) (= (mod c_~v_assert~0 256) 0) (<= .cse10 c_~front~0) (<= c_~n~0 .cse10) (< c_~front~0 0))) is different from false [2023-01-27 22:50:46,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:50:46,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 96 [2023-01-27 22:50:46,398 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 22:50:46,398 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 1822 treesize of output 1728 [2023-01-27 22:50:46,442 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:50:46,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:50:46,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 330 treesize of output 330 [2023-01-27 22:50:46,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:50:46,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:50:46,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 356 treesize of output 284 [2023-01-27 22:50:46,521 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 22:50:46,521 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 275 treesize of output 249 [2023-01-27 22:50:47,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:50:47,608 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 132 treesize of output 96 [2023-01-27 22:50:47,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:50:47,628 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:50:47,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 240 [2023-01-27 22:50:47,647 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:50:47,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 188 [2023-01-27 22:50:47,668 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:50:47,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 135 [2023-01-27 22:50:47,756 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:50:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:50:47,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655291209] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:50:47,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:50:47,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 38 [2023-01-27 22:50:47,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46745595] [2023-01-27 22:50:47,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:50:47,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-01-27 22:50:47,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:50:47,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-01-27 22:50:47,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1082, Unknown=9, NotChecked=142, Total=1482 [2023-01-27 22:50:47,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-27 22:50:47,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 2847 transitions, 55810 flow. Second operand has 39 states, 39 states have (on average 63.794871794871796) internal successors, (2488), 39 states have internal predecessors, (2488), 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) [2023-01-27 22:50:47,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:50:47,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-27 22:50:47,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:50:53,435 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~back~0 4))) (let ((.cse23 (* c_~front~0 4)) (.cse15 (+ c_~queue~0.offset .cse22))) (let ((.cse19 (+ c_~back~0 1)) (.cse11 (select (select |c_#memory_int| c_~queue~0.base) .cse15)) (.cse7 (+ c_~queue~0.offset .cse23 4)) (.cse8 (+ c_~queue~0.offset .cse23)) (.cse9 (+ c_~queue~0.offset .cse22 4))) (let ((.cse1 (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse20 .cse7) (select .cse20 .cse8)) 1) (not (= (+ (select .cse20 .cse9) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse21 .cse7) (select .cse21 .cse8))) (not (= (+ (select .cse21 .cse9) 1) 0))))))) (.cse5 (not (= .cse11 1))) (.cse13 (<= 0 c_~sum~0)) (.cse12 (= (mod c_~v_assert~0 256) 0)) (.cse2 (<= .cse19 c_~front~0)) (.cse4 (<= c_~n~0 .cse19)) (.cse0 (< c_~front~0 0))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse0 (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8)) 1) (not (= (select .cse6 .cse9) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse7) (select .cse10 .cse8))) (not (= (select .cse10 .cse9) 1)))))) .cse2 (not .cse3) .cse4 (not (= (+ .cse11 1) 0)))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (or .cse12 .cse1 .cse2 .cse4 .cse0 .cse5) (<= 1 c_~v_assert~0) .cse13 (or (and (forall ((v_ArrVal_609 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse14 c_~queue~0.base) .cse15) 1)) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse16 (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse16 .cse7) (select .cse16 .cse8)) 1) (not (= 0 (+ (select .cse16 .cse9) 1))))))))) (forall ((v_ArrVal_609 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_609))) (or (not (= (select (select .cse17 c_~queue~0.base) .cse15) 1)) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse18 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse18 .cse7) (select .cse18 .cse8))) (not (= 0 (+ (select .cse18 .cse9) 1)))))))))) .cse12 .cse2 .cse4 .cse0) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse13 (<= c_~sum~0 1)) .cse12 .cse2 .cse4 .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))))) is different from false [2023-01-27 22:50:53,944 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse7 (+ c_~back~0 1)) (.cse5 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse6 4)) (.cse2 (+ c_~queue~0.offset .cse6)) (.cse3 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))))) (<= .cse7 c_~front~0) (<= c_~n~0 .cse7) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse5)) 1)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-27 22:50:55,063 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4)) (.cse15 (* c_~back~0 4))) (let ((.cse11 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse15))) (.cse12 (+ c_~back~0 1)) (.cse7 (+ c_~queue~0.offset .cse16 4)) (.cse8 (+ c_~queue~0.offset .cse16)) (.cse9 (+ c_~queue~0.offset .cse15 4))) (let ((.cse1 (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse13 .cse7) (select .cse13 .cse8)) 1) (not (= (+ (select .cse13 .cse9) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse14 .cse7) (select .cse14 .cse8))) (not (= (+ (select .cse14 .cse9) 1) 0))))))) (.cse2 (<= .cse12 c_~front~0)) (.cse4 (<= c_~n~0 .cse12)) (.cse0 (< c_~front~0 0)) (.cse5 (not (= .cse11 1)))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse0 (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8)) 1) (not (= (select .cse6 .cse9) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse7) (select .cse10 .cse8))) (not (= (select .cse10 .cse9) 1)))))) .cse2 (not .cse3) .cse4 (not (= (+ .cse11 1) 0)))))) (or (= (mod c_~v_assert~0 256) 0) .cse1 .cse2 .cse4 .cse0 .cse5))))) is different from false [2023-01-27 22:50:55,509 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (or (let ((.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9 4)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse5 (<= c_~back~0 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2)) 1) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 (not .cse6)) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2))) (not (= (select .cse7 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2)) 1) (not (= (select .cse8 .cse3) 1)))))) .cse5 .cse6)))) (<= c_~n~0 c_~back~0) (< c_~front~0 0)) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-27 22:50:56,389 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4)) (.cse15 (* c_~back~0 4))) (let ((.cse11 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse15))) (.cse12 (+ c_~back~0 1)) (.cse7 (+ c_~queue~0.offset .cse16 4)) (.cse8 (+ c_~queue~0.offset .cse16)) (.cse9 (+ c_~queue~0.offset .cse15 4))) (let ((.cse1 (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse13 .cse7) (select .cse13 .cse8)) 1) (not (= (+ (select .cse13 .cse9) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse14 .cse7) (select .cse14 .cse8))) (not (= (+ (select .cse14 .cse9) 1) 0))))))) (.cse2 (<= .cse12 c_~front~0)) (.cse4 (<= c_~n~0 .cse12)) (.cse0 (< c_~front~0 0)) (.cse5 (not (= .cse11 1)))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse0 (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse1 .cse2 .cse3 .cse4 .cse5) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8)) 1) (not (= (select .cse6 .cse9) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse7) (select .cse10 .cse8))) (not (= (select .cse10 .cse9) 1)))))) .cse2 (not .cse3) .cse4 (not (= (+ .cse11 1) 0)))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (or (= (mod c_~v_assert~0 256) 0) .cse1 .cse2 .cse4 .cse0 .cse5) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))))) is different from false [2023-01-27 22:50:57,110 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse13 (* c_~back~0 4))) (let ((.cse17 (+ c_~back~0 1)) (.cse7 (select .cse1 (+ c_~queue~0.offset .cse13))) (.cse18 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse18 4)) (.cse2 (+ c_~queue~0.offset .cse18)) (.cse6 (not (= .cse7 1))) (.cse16 (<= 0 c_~sum~0)) (.cse9 (= (mod c_~v_assert~0 256) 0)) (.cse14 (<= .cse17 c_~front~0)) (.cse15 (<= c_~n~0 .cse17)) (.cse8 (< c_~front~0 0))) (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)))) (and (<= .cse0 1) (<= 0 .cse0))) (let ((.cse4 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or .cse4 .cse5 .cse6) (or .cse4 (not .cse5) (not (= (+ .cse7 1) 0))))) (<= c_~n~0 c_~back~0) .cse8) (or .cse9 (let ((.cse11 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse10 .cse3) (select .cse10 .cse2)) 1) (not (= (+ (select .cse10 .cse11) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse12 .cse3) (select .cse12 .cse2))) (not (= (+ (select .cse12 .cse11) 1) 0))))))) .cse14 .cse15 .cse8 .cse6) (<= 1 c_~v_assert~0) .cse16 (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse16 (<= c_~sum~0 1)) .cse9 .cse14 .cse15 .cse8 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)))))) is different from false [2023-01-27 22:51:05,613 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (+ c_~back~0 1)) (.cse14 (* c_~front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (+ c_~queue~0.offset .cse14)) (.cse6 (<= .cse16 c_~front~0)) (.cse8 (<= c_~n~0 .cse16)) (.cse0 (< c_~front~0 0))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse0 (let ((.cse13 (* c_~back~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse14 4)) (.cse4 (+ c_~queue~0.offset .cse13 4)) (.cse7 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse9 (select .cse12 (+ c_~queue~0.offset .cse13)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 .cse7 .cse8 (not (= .cse9 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse10 .cse2) (select .cse10 .cse3)) 1) (not (= (select .cse10 .cse4) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse11 .cse2) (select .cse11 .cse3))) (not (= (select .cse11 .cse4) 1)))))) .cse6 (not .cse7) .cse8 (not (= (+ .cse9 1) 0))))))) (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse15 (+ c_~sum~0 (select .cse12 .cse3)))) (and (<= .cse15 1) (<= 0 .cse15))) .cse0) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) (= (mod c_~v_assert~0 256) 0) .cse6 .cse8 .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) is different from false [2023-01-27 22:51:05,739 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (+ c_~back~0 1))) (let ((.cse6 (<= .cse14 c_~front~0)) (.cse8 (<= c_~n~0 .cse14)) (.cse0 (< c_~front~0 0))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse0 (let ((.cse12 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse13 4)) (.cse3 (+ c_~queue~0.offset .cse13)) (.cse4 (+ c_~queue~0.offset .cse12 4)) (.cse7 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse9 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse12)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 .cse7 .cse8 (not (= .cse9 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse10 .cse2) (select .cse10 .cse3)) 1) (not (= (select .cse10 .cse4) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse11 .cse2) (select .cse11 .cse3))) (not (= (select .cse11 .cse4) 1)))))) .cse6 (not .cse7) .cse8 (not (= (+ .cse9 1) 0))))))) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) (= (mod c_~v_assert~0 256) 0) .cse6 .cse8 .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) is different from false [2023-01-27 22:51:09,257 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-27 22:51:09,334 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-27 22:51:12,646 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-27 22:51:13,860 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (+ c_~back~0 1))) (let ((.cse14 (<= 0 c_~sum~0)) (.cse15 (<= c_~sum~0 1)) (.cse6 (<= .cse16 c_~front~0)) (.cse8 (<= c_~n~0 .cse16)) (.cse0 (< c_~front~0 0))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse0 (let ((.cse12 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse13 4)) (.cse3 (+ c_~queue~0.offset .cse13)) (.cse4 (+ c_~queue~0.offset .cse12 4)) (.cse7 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse9 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse12)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)) 1) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 .cse7 .cse8 (not (= .cse9 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse10 .cse2) (select .cse10 .cse3)) 1) (not (= (select .cse10 .cse4) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse11 .cse2) (select .cse11 .cse3))) (not (= (select .cse11 .cse4) 1)))))) .cse6 (not .cse7) .cse8 (not (= (+ .cse9 1) 0))))))) .cse14 .cse15 (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0) .cse14 .cse15) (= (mod c_~v_assert~0 256) 0) .cse6 .cse8 .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|))))) is different from false [2023-01-27 22:51:16,301 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-27 22:51:16,313 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0)) is different from false [2023-01-27 22:51:17,735 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= 0 c_~sum~0) (<= c_~sum~0 1) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-27 22:51:17,763 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-27 22:51:21,378 WARN L839 $PredicateComparison]: unable to prove that (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse12 (+ c_~back~0 1)) (.cse11 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse5 (<= .cse12 c_~front~0)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (<= c_~n~0 .cse12)) (.cse8 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse11)))) (and (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (+ (select .cse0 .cse3) 1) 0))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))) (not (= (+ (select .cse4 .cse3) 1) 0)))))) .cse5 .cse6 .cse7 (not (= .cse8 1))) (or (and (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1) (not (= (select .cse9 .cse3) 1))))) (forall ((v_ArrVal_610 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_610) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse10 .cse1) (select .cse10 .cse2))) (not (= (select .cse10 .cse3) 1)))))) .cse5 (not .cse6) .cse7 (not (= (+ .cse8 1) 0))))))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-01-27 22:51:32,306 INFO L130 PetriNetUnfolder]: 30051/50132 cut-off events. [2023-01-27 22:51:32,306 INFO L131 PetriNetUnfolder]: For 6963987/6963987 co-relation queries the response was YES. [2023-01-27 22:51:33,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870298 conditions, 50132 events. 30051/50132 cut-off events. For 6963987/6963987 co-relation queries the response was YES. Maximal size of possible extension queue 2149. Compared 421639 event pairs, 3115 based on Foata normal form. 527/50659 useless extension candidates. Maximal degree in co-relation 870123. Up to 21283 conditions per place. [2023-01-27 22:51:33,735 INFO L137 encePairwiseOnDemand]: 226/246 looper letters, 2725 selfloop transitions, 2723 changer transitions 190/5638 dead transitions. [2023-01-27 22:51:33,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 5638 transitions, 129518 flow [2023-01-27 22:51:33,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-01-27 22:51:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2023-01-27 22:51:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 7419 transitions. [2023-01-27 22:51:33,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27416851441241685 [2023-01-27 22:51:33,742 INFO L72 ComplementDD]: Start complementDD. Operand 110 states and 7419 transitions. [2023-01-27 22:51:33,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 7419 transitions. [2023-01-27 22:51:33,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:51:33,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 110 states and 7419 transitions. [2023-01-27 22:51:33,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 111 states, 110 states have (on average 67.44545454545455) internal successors, (7419), 110 states have internal predecessors, (7419), 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) [2023-01-27 22:51:33,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 111 states, 111 states have (on average 246.0) internal successors, (27306), 111 states have internal predecessors, (27306), 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) [2023-01-27 22:51:33,762 INFO L81 ComplementDD]: Finished complementDD. Result has 111 states, 111 states have (on average 246.0) internal successors, (27306), 111 states have internal predecessors, (27306), 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) [2023-01-27 22:51:33,762 INFO L175 Difference]: Start difference. First operand has 540 places, 2847 transitions, 55810 flow. Second operand 110 states and 7419 transitions. [2023-01-27 22:51:33,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 5638 transitions, 129518 flow [2023-01-27 22:52:34,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 5638 transitions, 123579 flow, removed 2884 selfloop flow, removed 24 redundant places. [2023-01-27 22:52:34,847 INFO L231 Difference]: Finished difference. Result has 673 places, 4423 transitions, 100091 flow [2023-01-27 22:52:34,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=47632, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=110, PETRI_FLOW=100091, PETRI_PLACES=673, PETRI_TRANSITIONS=4423} [2023-01-27 22:52:34,849 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 642 predicate places. [2023-01-27 22:52:34,849 INFO L495 AbstractCegarLoop]: Abstraction has has 673 places, 4423 transitions, 100091 flow [2023-01-27 22:52:34,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 63.794871794871796) internal successors, (2488), 39 states have internal predecessors, (2488), 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) [2023-01-27 22:52:34,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:52:34,849 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:52:34,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-01-27 22:52:35,054 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,SelfDestructingSolverStorable15 [2023-01-27 22:52:35,054 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:52:35,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:52:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1832587668, now seen corresponding path program 12 times [2023-01-27 22:52:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:52:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011391706] [2023-01-27 22:52:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:52:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:52:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:52:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:52:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:52:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011391706] [2023-01-27 22:52:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011391706] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:52:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105734417] [2023-01-27 22:52:35,832 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:52:35,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:52:35,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:52:35,837 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) [2023-01-27 22:52:35,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 22:52:35,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-27 22:52:35,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:52:35,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-27 22:52:35,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:52:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:52:36,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-01-27 22:52:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:52:36,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:52:36,621 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~back~0 0)) is different from false [2023-01-27 22:52:36,839 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-27 22:52:36,839 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 282 treesize of output 236 [2023-01-27 22:52:36,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:52:36,860 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 71 treesize of output 58 [2023-01-27 22:52:36,873 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:52:36,873 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 58 treesize of output 45 [2023-01-27 22:52:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-27 22:52:37,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105734417] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:52:37,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:52:37,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2023-01-27 22:52:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513016885] [2023-01-27 22:52:37,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:52:37,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:52:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:52:37,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:52:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1124, Unknown=14, NotChecked=70, Total=1406 [2023-01-27 22:52:37,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-01-27 22:52:37,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 4423 transitions, 100091 flow. Second operand has 38 states, 38 states have (on average 69.94736842105263) internal successors, (2658), 38 states have internal predecessors, (2658), 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) [2023-01-27 22:52:37,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:52:37,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-01-27 22:52:37,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:52:38,773 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0))) is different from false [2023-01-27 22:52:38,992 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0))) is different from false [2023-01-27 22:52:39,012 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~back~0 0)) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2023-01-27 22:52:39,937 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (+ c_~queue~0.offset .cse8))) (let ((.cse0 (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and .cse0 .cse1 (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~back~0 0)))))) is different from false [2023-01-27 22:52:40,009 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0)) (<= c_~sum~0 1)) is different from false [2023-01-27 22:52:46,830 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse1 4)) (.cse4 (+ c_~queue~0.offset .cse1)) (.cse0 (select |c_#memory_int| c_~queue~0.base))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (= (select .cse0 (+ .cse1 (- 4))) 1) (= c_~sum~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))))) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (= c_~queue~0.offset 0) (= (+ (select .cse0 .cse1) 1) 0) (<= 1 c_~v_assert~0) (<= c_~front~0 1) (<= 1 c_~front~0)))) is different from false [2023-01-27 22:52:52,791 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0))) is different from false [2023-01-27 22:52:52,991 WARN L839 $PredicateComparison]: unable to prove that (and (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0))) is different from false [2023-01-27 22:52:56,822 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0))) is different from false [2023-01-27 22:52:56,998 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (+ c_~queue~0.offset .cse8))) (let ((.cse0 (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))) 1))) (.cse1 (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) .cse0 .cse1 (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~back~0 0)) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0))))) is different from false [2023-01-27 22:53:07,363 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse9 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse10 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse9) (not (= (+ .cse10 1) 0))) (or .cse9 (not (= .cse10 1)))))) (.cse1 (let ((.cse8 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_659 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse5) (select .cse4 .cse6))) 1)) (forall ((v_ArrVal_659 (Array Int Int))) (<= 0 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_659) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse5) (select .cse7 .cse6))))))))) (.cse2 (<= c_~n~0 c_~back~0)) (.cse3 (< c_~back~0 0))) (and (or .cse0 .cse1 .cse2 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) .cse3) (or .cse0 .cse1 (= (mod c_~v_assert~0 256) 0) .cse2 .cse3) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256)))) is different from false [2023-01-27 22:54:03,770 INFO L130 PetriNetUnfolder]: 42124/70113 cut-off events. [2023-01-27 22:54:03,770 INFO L131 PetriNetUnfolder]: For 11789444/11789444 co-relation queries the response was YES. [2023-01-27 22:54:06,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319411 conditions, 70113 events. 42124/70113 cut-off events. For 11789444/11789444 co-relation queries the response was YES. Maximal size of possible extension queue 2843. Compared 610659 event pairs, 3442 based on Foata normal form. 429/70542 useless extension candidates. Maximal degree in co-relation 1319183. Up to 30360 conditions per place. [2023-01-27 22:54:06,569 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 3029 selfloop transitions, 4723 changer transitions 404/8156 dead transitions. [2023-01-27 22:54:06,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 8156 transitions, 209335 flow [2023-01-27 22:54:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-01-27 22:54:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-01-27 22:54:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 6821 transitions. [2023-01-27 22:54:06,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3013874160480735 [2023-01-27 22:54:06,575 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 6821 transitions. [2023-01-27 22:54:06,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 6821 transitions. [2023-01-27 22:54:06,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:54:06,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 6821 transitions. [2023-01-27 22:54:06,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 74.1413043478261) internal successors, (6821), 92 states have internal predecessors, (6821), 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) [2023-01-27 22:54:06,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 246.0) internal successors, (22878), 93 states have internal predecessors, (22878), 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) [2023-01-27 22:54:06,591 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 246.0) internal successors, (22878), 93 states have internal predecessors, (22878), 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) [2023-01-27 22:54:06,591 INFO L175 Difference]: Start difference. First operand has 673 places, 4423 transitions, 100091 flow. Second operand 92 states and 6821 transitions. [2023-01-27 22:54:06,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 758 places, 8156 transitions, 209335 flow [2023-01-27 22:59:30,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 730 places, 8156 transitions, 197657 flow, removed 5705 selfloop flow, removed 28 redundant places. [2023-01-27 22:59:30,719 INFO L231 Difference]: Finished difference. Result has 787 places, 6630 transitions, 165474 flow [2023-01-27 22:59:30,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=93663, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2687, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=165474, PETRI_PLACES=787, PETRI_TRANSITIONS=6630} [2023-01-27 22:59:30,722 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 756 predicate places. [2023-01-27 22:59:30,722 INFO L495 AbstractCegarLoop]: Abstraction has has 787 places, 6630 transitions, 165474 flow [2023-01-27 22:59:30,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 69.94736842105263) internal successors, (2658), 38 states have internal predecessors, (2658), 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) [2023-01-27 22:59:30,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:59:30,723 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:59:30,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 22:59:30,927 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,SelfDestructingSolverStorable16 [2023-01-27 22:59:30,928 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 22:59:30,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:59:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1426780942, now seen corresponding path program 13 times [2023-01-27 22:59:30,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:59:30,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730550174] [2023-01-27 22:59:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:59:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:59:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:59:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:59:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:59:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730550174] [2023-01-27 22:59:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730550174] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:59:31,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812549225] [2023-01-27 22:59:31,680 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:59:31,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:59:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:59:31,681 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) [2023-01-27 22:59:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 22:59:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:59:31,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-27 22:59:31,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:59:32,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:59:32,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-01-27 22:59:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:59:32,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:59:32,306 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-01-27 22:59:32,394 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)) 1))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) is different from false [2023-01-27 22:59:32,545 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-27 22:59:32,545 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 286 treesize of output 224 [2023-01-27 22:59:32,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2023-01-27 22:59:32,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2023-01-27 22:59:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-27 22:59:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812549225] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:59:33,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:59:33,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2023-01-27 22:59:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344628329] [2023-01-27 22:59:33,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:59:33,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:59:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:59:33,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:59:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1058, Unknown=9, NotChecked=138, Total=1406 [2023-01-27 22:59:33,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 246 [2023-01-27 22:59:33,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 787 places, 6630 transitions, 165474 flow. Second operand has 38 states, 38 states have (on average 71.86842105263158) internal successors, (2731), 38 states have internal predecessors, (2731), 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) [2023-01-27 22:59:33,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:59:33,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 246 [2023-01-27 22:59:33,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:59:34,757 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)) 1))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (= c_~sum~0 0)) is different from false [2023-01-27 22:59:35,243 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)) 1))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (= c_~sum~0 0)) is different from false [2023-01-27 22:59:36,232 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)) 1))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 22:59:37,782 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (= |c_thread1Thread1of1ForFork2_~cond~0#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (<= c_~n~0 c_~back~0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse4)) 1))))) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)))) is different from false [2023-01-27 23:00:42,740 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (select .cse4 (+ c_~queue~0.offset .cse7))) (.cse6 (+ c_~queue~0.offset .cse7 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse6)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse6)) 1)))))) (.cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0))) (and (or .cse0 .cse1) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (<= c_~n~0 c_~back~0) .cse0 (< c_~back~0 0) .cse1)))) is different from false [2023-01-27 23:01:23,529 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse0)) 1)) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|))) is different from false [2023-01-27 23:01:23,571 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) (and (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_708 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_708 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_708) c_~queue~0.base) .cse1)) 1))))) (= .cse3 0)) (< 0 .cse3))) is different from false Received shutdown request... [2023-01-27 23:01:56,921 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 23:01:56,921 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 [2023-01-27 23:01:57,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-27 23:01:57,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-01-27 23:02:00,344 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-27 23:02:00,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-01-27 23:02:00,344 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-27 23:02:00,345 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-27 23:02:00,345 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-27 23:02:00,346 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-27 23:02:00,346 INFO L445 BasicCegarLoop]: Path program histogram: [13, 3, 1, 1] [2023-01-27 23:02:00,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 23:02:00,348 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 23:02:00,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:02:00 BasicIcfg [2023-01-27 23:02:00,350 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 23:02:00,350 INFO L158 Benchmark]: Toolchain (without parser) took 800406.48ms. Allocated memory was 367.0MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 316.4MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-01-27 23:02:00,350 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 23:02:00,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.43ms. Allocated memory is still 367.0MB. Free memory was 316.1MB in the beginning and 304.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 23:02:00,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.06ms. Allocated memory is still 367.0MB. Free memory was 304.6MB in the beginning and 302.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 23:02:00,351 INFO L158 Benchmark]: Boogie Preprocessor took 36.46ms. Allocated memory is still 367.0MB. Free memory was 302.5MB in the beginning and 300.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 23:02:00,351 INFO L158 Benchmark]: RCFGBuilder took 428.07ms. Allocated memory is still 367.0MB. Free memory was 300.9MB in the beginning and 325.0MB in the end (delta: -24.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.0GB. [2023-01-27 23:02:00,351 INFO L158 Benchmark]: TraceAbstraction took 799661.47ms. Allocated memory was 367.0MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 324.4MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-01-27 23:02:00,352 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 235.43ms. Allocated memory is still 367.0MB. Free memory was 316.1MB in the beginning and 304.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.06ms. Allocated memory is still 367.0MB. Free memory was 304.6MB in the beginning and 302.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.46ms. Allocated memory is still 367.0MB. Free memory was 302.5MB in the beginning and 300.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 428.07ms. Allocated memory is still 367.0MB. Free memory was 300.9MB in the beginning and 325.0MB in the end (delta: -24.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.0GB. * TraceAbstraction took 799661.47ms. Allocated memory was 367.0MB in the beginning and 7.6GB in the end (delta: 7.2GB). Free memory was 324.4MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 122 PlacesBefore, 31 PlacesAfterwards, 122 TransitionsBefore, 24 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 7 ConcurrentYvCompositions, 7 ChoiceCompositions, 111 TotalNumberOfCompositions, 2055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1573, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 696, independent: 675, independent conditional: 0, independent unconditional: 675, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1573, independent: 841, independent conditional: 0, independent unconditional: 841, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 696, unknown conditional: 0, unknown unconditional: 696] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 157 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 799.6s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 767.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 625 mSolverCounterUnknown, 6247 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6247 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17304 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 670 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17399 IncrementalHoareTripleChecker+Invalid, 35998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 670 mSolverCounterUnsat, 11 mSDtfsCounter, 17399 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 625 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 393 SyntacticMatches, 52 SemanticMatches, 1048 ConstructedPredicates, 72 IntricatePredicates, 0 DeprecatedPredicates, 31735 ImplicationChecksByTransitivity, 67.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165474occurred in iteration=17, InterpolantAutomatonStates: 752, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 772 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1052 ConstructedInterpolants, 42 QuantifiedInterpolants, 20319 SizeOfPredicates, 294 NumberOfNonLiveVariables, 2862 ConjunctsInSsa, 494 ConjunctsInUnsatCore, 42 InterpolantComputations, 6 PerfectInterpolantSequences, 75/284 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