/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -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-28 05:22:00,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 05:22:00,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 05:22:00,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 05:22:00,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 05:22:00,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 05:22:00,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 05:22:00,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 05:22:00,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 05:22:00,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 05:22:00,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 05:22:00,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 05:22:00,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 05:22:00,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 05:22:00,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 05:22:00,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 05:22:00,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 05:22:00,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 05:22:00,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 05:22:00,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 05:22:00,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 05:22:00,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 05:22:00,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 05:22:00,679 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 05:22:00,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 05:22:00,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 05:22:00,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 05:22:00,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 05:22:00,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 05:22:00,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 05:22:00,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 05:22:00,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 05:22:00,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 05:22:00,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 05:22:00,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 05:22:00,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 05:22:00,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 05:22:00,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 05:22:00,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 05:22:00,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 05:22:00,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 05:22:00,691 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-28 05:22:00,715 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 05:22:00,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 05:22:00,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 05:22:00,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 05:22:00,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 05:22:00,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 05:22:00,717 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 05:22:00,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 05:22:00,717 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 05:22:00,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 05:22:00,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 05:22:00,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 05:22:00,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 05:22:00,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 05:22:00,722 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 05:22:00,722 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 05:22:00,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 05:22:00,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 05:22:00,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 05:22:00,953 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 05:22:00,953 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 05:22:00,955 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-28 05:22:01,860 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 05:22:02,009 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 05:22:02,010 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-01-28 05:22:02,014 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d153118/30b5b1ecba6b467b9182d61e72b3ad4d/FLAG6d85b760f [2023-01-28 05:22:02,023 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96d153118/30b5b1ecba6b467b9182d61e72b3ad4d [2023-01-28 05:22:02,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 05:22:02,026 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 05:22:02,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 05:22:02,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 05:22:02,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 05:22:02,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c26c25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02, skipping insertion in model container [2023-01-28 05:22:02,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 05:22:02,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 05:22:02,160 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-28 05:22:02,166 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 05:22:02,172 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 05:22:02,219 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-28 05:22:02,223 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 05:22:02,234 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 05:22:02,234 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 05:22:02,239 INFO L208 MainTranslator]: Completed translation [2023-01-28 05:22:02,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02 WrapperNode [2023-01-28 05:22:02,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 05:22:02,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 05:22:02,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 05:22:02,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 05:22:02,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,263 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-01-28 05:22:02,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 05:22:02,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 05:22:02,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 05:22:02,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 05:22:02,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,280 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 05:22:02,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 05:22:02,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 05:22:02,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 05:22:02,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (1/1) ... [2023-01-28 05:22:02,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 05:22:02,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:02,303 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-28 05:22:02,311 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-28 05:22:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 05:22:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 05:22:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 05:22:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 05:22:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 05:22:02,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 05:22:02,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 05:22:02,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 05:22:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 05:22:02,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 05:22:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 05:22:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 05:22:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 05:22:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 05:22:02,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 05:22:02,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 05:22:02,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 05:22:02,342 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 05:22:02,433 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 05:22:02,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 05:22:02,691 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 05:22:02,788 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 05:22:02,796 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 05:22:02,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 05:22:02 BoogieIcfgContainer [2023-01-28 05:22:02,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 05:22:02,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 05:22:02,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 05:22:02,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 05:22:02,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 05:22:02" (1/3) ... [2023-01-28 05:22:02,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a550b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 05:22:02, skipping insertion in model container [2023-01-28 05:22:02,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 05:22:02" (2/3) ... [2023-01-28 05:22:02,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a550b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 05:22:02, skipping insertion in model container [2023-01-28 05:22:02,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 05:22:02" (3/3) ... [2023-01-28 05:22:02,804 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-01-28 05:22:02,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 05:22:02,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 05:22:02,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 05:22:02,886 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 05:22:02,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 135 transitions, 294 flow [2023-01-28 05:22:02,970 INFO L130 PetriNetUnfolder]: 10/132 cut-off events. [2023-01-28 05:22:02,970 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 05:22:02,974 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-28 05:22:02,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 135 transitions, 294 flow [2023-01-28 05:22:02,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 262 flow [2023-01-28 05:22:02,989 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 05:22:02,999 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 122 transitions, 262 flow [2023-01-28 05:22:03,001 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 122 transitions, 262 flow [2023-01-28 05:22:03,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 262 flow [2023-01-28 05:22:03,040 INFO L130 PetriNetUnfolder]: 10/122 cut-off events. [2023-01-28 05:22:03,041 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 05:22:03,041 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-28 05:22:03,042 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-01-28 05:22:06,566 INFO L134 LiptonReduction]: Checked pairs total: 2055 [2023-01-28 05:22:06,566 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-01-28 05:22:06,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 05:22:06,580 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;@2c105acf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 05:22:06,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 05:22:06,584 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-01-28 05:22:06,584 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 05:22:06,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:06,585 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-28 05:22:06,585 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-28 05:22:06,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:06,588 INFO L85 PathProgramCache]: Analyzing trace with hash 839295690, now seen corresponding path program 1 times [2023-01-28 05:22:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:06,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717274962] [2023-01-28 05:22:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:06,923 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-28 05:22:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717274962] [2023-01-28 05:22:06,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717274962] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:22:06,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:22:06,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:22:06,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525116372] [2023-01-28 05:22:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:22:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:22:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:22:06,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:22:06,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-28 05:22:06,995 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-28 05:22:06,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:06,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-28 05:22:06,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:07,145 INFO L130 PetriNetUnfolder]: 214/342 cut-off events. [2023-01-28 05:22:07,146 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-01-28 05:22:07,148 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-28 05:22:07,152 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-01-28 05:22:07,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-01-28 05:22:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 05:22:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 05:22:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-01-28 05:22:07,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.491869918699187 [2023-01-28 05:22:07,171 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-01-28 05:22:07,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-01-28 05:22:07,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:07,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-01-28 05:22:07,181 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-28 05:22:07,187 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-28 05:22:07,188 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-28 05:22:07,189 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 605 transitions. [2023-01-28 05:22:07,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-01-28 05:22:07,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-01-28 05:22:07,193 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-01-28 05:22:07,194 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-28 05:22:07,197 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-01-28 05:22:07,197 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-01-28 05:22:07,198 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-28 05:22:07,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:07,198 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-28 05:22:07,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 05:22:07,198 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-28 05:22:07,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash 712380104, now seen corresponding path program 2 times [2023-01-28 05:22:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556829808] [2023-01-28 05:22:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:07,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:07,317 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-28 05:22:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:07,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556829808] [2023-01-28 05:22:07,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556829808] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:22:07,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:22:07,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:22:07,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759605934] [2023-01-28 05:22:07,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:22:07,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:22:07,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:22:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:22:07,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 246 [2023-01-28 05:22:07,328 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-28 05:22:07,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:07,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 246 [2023-01-28 05:22:07,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:07,425 INFO L130 PetriNetUnfolder]: 209/341 cut-off events. [2023-01-28 05:22:07,426 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2023-01-28 05:22:07,427 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-28 05:22:07,429 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-01-28 05:22:07,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-01-28 05:22:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 05:22:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 05:22:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2023-01-28 05:22:07,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4869918699186992 [2023-01-28 05:22:07,430 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2023-01-28 05:22:07,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2023-01-28 05:22:07,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:07,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2023-01-28 05:22:07,432 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-28 05:22:07,433 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-28 05:22:07,434 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-28 05:22:07,434 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 599 transitions. [2023-01-28 05:22:07,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-01-28 05:22:07,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 05:22:07,437 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-01-28 05:22:07,438 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-28 05:22:07,438 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-01-28 05:22:07,438 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-01-28 05:22:07,439 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-28 05:22:07,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:07,439 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-28 05:22:07,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 05:22:07,439 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-28 05:22:07,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:07,441 INFO L85 PathProgramCache]: Analyzing trace with hash 109437294, now seen corresponding path program 3 times [2023-01-28 05:22:07,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:07,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707673885] [2023-01-28 05:22:07,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:07,603 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-28 05:22:07,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:07,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707673885] [2023-01-28 05:22:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707673885] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:22:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:22:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 05:22:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477027770] [2023-01-28 05:22:07,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:22:07,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 05:22:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:07,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 05:22:07,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 05:22:07,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246 [2023-01-28 05:22:07,607 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-28 05:22:07,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:07,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246 [2023-01-28 05:22:07,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:07,799 INFO L130 PetriNetUnfolder]: 360/594 cut-off events. [2023-01-28 05:22:07,799 INFO L131 PetriNetUnfolder]: For 409/409 co-relation queries the response was YES. [2023-01-28 05:22:07,800 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-28 05:22:07,802 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 52 selfloop transitions, 8 changer transitions 24/84 dead transitions. [2023-01-28 05:22:07,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 84 transitions, 475 flow [2023-01-28 05:22:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 05:22:07,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 05:22:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-01-28 05:22:07,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48606271777003485 [2023-01-28 05:22:07,805 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-01-28 05:22:07,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-01-28 05:22:07,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:07,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-01-28 05:22:07,808 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-28 05:22:07,811 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-28 05:22:07,812 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-28 05:22:07,812 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 7 states and 837 transitions. [2023-01-28 05:22:07,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 84 transitions, 475 flow [2023-01-28 05:22:07,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 84 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 05:22:07,815 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 152 flow [2023-01-28 05:22:07,815 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-28 05:22:07,816 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-01-28 05:22:07,816 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 152 flow [2023-01-28 05:22:07,817 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-28 05:22:07,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:07,817 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-28 05:22:07,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 05:22:07,817 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-28 05:22:07,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:07,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2055038813, now seen corresponding path program 1 times [2023-01-28 05:22:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878092593] [2023-01-28 05:22:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:07,894 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-28 05:22:07,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:07,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878092593] [2023-01-28 05:22:07,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878092593] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:22:07,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:22:07,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 05:22:07,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737787577] [2023-01-28 05:22:07,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:22:07,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 05:22:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 05:22:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 05:22:07,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246 [2023-01-28 05:22:07,897 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-28 05:22:07,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:07,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246 [2023-01-28 05:22:07,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:07,944 INFO L130 PetriNetUnfolder]: 80/163 cut-off events. [2023-01-28 05:22:07,945 INFO L131 PetriNetUnfolder]: For 323/336 co-relation queries the response was YES. [2023-01-28 05:22:07,945 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-28 05:22:07,946 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-01-28 05:22:07,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 179 flow [2023-01-28 05:22:07,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 05:22:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 05:22:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-01-28 05:22:07,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48644986449864497 [2023-01-28 05:22:07,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-01-28 05:22:07,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-01-28 05:22:07,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:07,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-01-28 05:22:07,950 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-28 05:22:07,951 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-28 05:22:07,952 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-28 05:22:07,952 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 152 flow. Second operand 3 states and 359 transitions. [2023-01-28 05:22:07,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 179 flow [2023-01-28 05:22:07,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 157 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-01-28 05:22:07,955 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 108 flow [2023-01-28 05:22:07,955 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-28 05:22:07,955 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-01-28 05:22:07,956 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 108 flow [2023-01-28 05:22:07,956 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-28 05:22:07,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:07,956 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-28 05:22:07,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 05:22:07,957 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-28 05:22:07,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1140643143, now seen corresponding path program 1 times [2023-01-28 05:22:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386500051] [2023-01-28 05:22:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:08,067 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-28 05:22:08,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:08,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386500051] [2023-01-28 05:22:08,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386500051] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:22:08,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 05:22:08,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 05:22:08,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775368206] [2023-01-28 05:22:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:22:08,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:22:08,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:08,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:22:08,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 05:22:08,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-01-28 05:22:08,070 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-28 05:22:08,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:08,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-01-28 05:22:08,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:08,127 INFO L130 PetriNetUnfolder]: 83/178 cut-off events. [2023-01-28 05:22:08,127 INFO L131 PetriNetUnfolder]: For 228/250 co-relation queries the response was YES. [2023-01-28 05:22:08,128 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-28 05:22:08,129 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-01-28 05:22:08,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 197 flow [2023-01-28 05:22:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:22:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:22:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-01-28 05:22:08,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45426829268292684 [2023-01-28 05:22:08,131 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-01-28 05:22:08,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-01-28 05:22:08,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:08,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-01-28 05:22:08,132 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-28 05:22:08,133 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-28 05:22:08,133 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-28 05:22:08,134 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 108 flow. Second operand 4 states and 447 transitions. [2023-01-28 05:22:08,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 197 flow [2023-01-28 05:22:08,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 05:22:08,135 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 120 flow [2023-01-28 05:22:08,135 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-28 05:22:08,136 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-01-28 05:22:08,136 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 120 flow [2023-01-28 05:22:08,136 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-28 05:22:08,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:08,136 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-28 05:22:08,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 05:22:08,136 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-28 05:22:08,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash 438039640, now seen corresponding path program 1 times [2023-01-28 05:22:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:08,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973635306] [2023-01-28 05:22:08,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:08,731 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-28 05:22:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:08,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973635306] [2023-01-28 05:22:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973635306] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:08,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777015548] [2023-01-28 05:22:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:08,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:08,734 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-28 05:22:08,735 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-28 05:22:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:08,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-28 05:22:08,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:08,958 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-28 05:22:09,018 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-28 05:22:09,063 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-28 05:22:09,110 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-28 05:22:09,268 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-28 05:22:09,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:09,715 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-28 05:22:09,811 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-28 05:22:09,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:09,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-01-28 05:22:09,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:09,855 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-28 05:22:09,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:09,881 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-28 05:22:09,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:09,894 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-28 05:22:09,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:09,909 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-28 05:22:10,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:10,427 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-28 05:22:10,437 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:10,438 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-28 05:22:10,466 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:10,466 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-28 05:22:10,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:22:10,480 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-28 05:22:10,497 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:10,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 181 treesize of output 161 [2023-01-28 05:22:10,604 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 05:22:10,682 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-28 05:22:10,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777015548] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:10,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:10,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2023-01-28 05:22:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442686393] [2023-01-28 05:22:10,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:10,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 05:22:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 05:22:10,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=615, Unknown=6, NotChecked=106, Total=870 [2023-01-28 05:22:10,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:22:10,691 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-28 05:22:10,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:10,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:22:10,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:10,802 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-28 05:22:14,260 INFO L130 PetriNetUnfolder]: 1442/2387 cut-off events. [2023-01-28 05:22:14,260 INFO L131 PetriNetUnfolder]: For 2320/2320 co-relation queries the response was YES. [2023-01-28 05:22:14,263 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-28 05:22:14,269 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 266 selfloop transitions, 134 changer transitions 57/457 dead transitions. [2023-01-28 05:22:14,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 457 transitions, 2682 flow [2023-01-28 05:22:14,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-01-28 05:22:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-01-28 05:22:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 4980 transitions. [2023-01-28 05:22:14,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27731373204143 [2023-01-28 05:22:14,282 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 4980 transitions. [2023-01-28 05:22:14,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 4980 transitions. [2023-01-28 05:22:14,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:14,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 4980 transitions. [2023-01-28 05:22:14,293 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-28 05:22:14,313 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-28 05:22:14,316 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-28 05:22:14,316 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 120 flow. Second operand 73 states and 4980 transitions. [2023-01-28 05:22:14,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 457 transitions, 2682 flow [2023-01-28 05:22:14,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 457 transitions, 2666 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-28 05:22:14,325 INFO L231 Difference]: Finished difference. Result has 148 places, 174 transitions, 1386 flow [2023-01-28 05:22:14,326 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-28 05:22:14,327 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2023-01-28 05:22:14,327 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 174 transitions, 1386 flow [2023-01-28 05:22:14,328 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-28 05:22:14,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:14,329 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-28 05:22:14,334 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-28 05:22:14,534 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-28 05:22:14,534 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-28 05:22:14,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:14,535 INFO L85 PathProgramCache]: Analyzing trace with hash -657298170, now seen corresponding path program 2 times [2023-01-28 05:22:14,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:14,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218331152] [2023-01-28 05:22:14,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:14,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:15,027 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-28 05:22:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218331152] [2023-01-28 05:22:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218331152] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549958328] [2023-01-28 05:22:15,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:22:15,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:15,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:15,028 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-28 05:22:15,060 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-28 05:22:15,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:22:15,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:15,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-28 05:22:15,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:15,162 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-28 05:22:15,202 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-28 05:22:15,238 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-28 05:22:15,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:22:15,379 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-28 05:22:15,452 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-28 05:22:15,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:15,550 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-28 05:22:15,590 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-28 05:22:15,652 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-28 05:22:15,698 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-28 05:22:15,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:15,835 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-28 05:22:15,847 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:15,847 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-28 05:22:15,860 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-28 05:22:15,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:15,877 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-28 05:22:15,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:15,887 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-28 05:22:16,139 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:16,140 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-28 05:22:16,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:22:16,147 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:16,148 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-28 05:22:16,156 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:16,157 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-28 05:22:16,167 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:16,167 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-28 05:22:16,201 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 05:22:16,250 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-28 05:22:16,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549958328] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:16,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:16,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2023-01-28 05:22:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632364672] [2023-01-28 05:22:16,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:16,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 05:22:16,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 05:22:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=586, Unknown=5, NotChecked=212, Total=930 [2023-01-28 05:22:16,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:22:16,255 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-28 05:22:16,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:16,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:22:16,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:16,474 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-28 05:22:16,594 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-28 05:22:17,458 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-28 05:22:20,725 INFO L130 PetriNetUnfolder]: 2114/3527 cut-off events. [2023-01-28 05:22:20,725 INFO L131 PetriNetUnfolder]: For 100378/100378 co-relation queries the response was YES. [2023-01-28 05:22:20,735 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-28 05:22:20,754 INFO L137 encePairwiseOnDemand]: 229/246 looper letters, 317 selfloop transitions, 192 changer transitions 86/595 dead transitions. [2023-01-28 05:22:20,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 595 transitions, 6493 flow [2023-01-28 05:22:20,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 05:22:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 05:22:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3252 transitions. [2023-01-28 05:22:20,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27540650406504064 [2023-01-28 05:22:20,760 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3252 transitions. [2023-01-28 05:22:20,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3252 transitions. [2023-01-28 05:22:20,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:20,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3252 transitions. [2023-01-28 05:22:20,765 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-28 05:22:20,774 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-28 05:22:20,775 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-28 05:22:20,776 INFO L175 Difference]: Start difference. First operand has 148 places, 174 transitions, 1386 flow. Second operand 48 states and 3252 transitions. [2023-01-28 05:22:20,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 595 transitions, 6493 flow [2023-01-28 05:22:20,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 595 transitions, 5815 flow, removed 315 selfloop flow, removed 8 redundant places. [2023-01-28 05:22:20,930 INFO L231 Difference]: Finished difference. Result has 207 places, 307 transitions, 3046 flow [2023-01-28 05:22:20,931 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-28 05:22:20,931 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2023-01-28 05:22:20,931 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 307 transitions, 3046 flow [2023-01-28 05:22:20,932 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-28 05:22:20,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:20,932 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-28 05:22:20,937 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-28 05:22:21,137 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-28 05:22:21,139 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-28 05:22:21,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:21,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1429573320, now seen corresponding path program 3 times [2023-01-28 05:22:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286953388] [2023-01-28 05:22:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:21,731 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-28 05:22:21,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:21,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286953388] [2023-01-28 05:22:21,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286953388] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:21,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707572527] [2023-01-28 05:22:21,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:22:21,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:21,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:21,732 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-28 05:22:21,734 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-28 05:22:21,815 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 05:22:21,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:21,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-01-28 05:22:21,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:21,866 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-28 05:22:21,918 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-28 05:22:21,960 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-28 05:22:22,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:22:22,093 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-28 05:22:22,158 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-28 05:22:22,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:22,258 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-28 05:22:22,414 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-28 05:22:22,454 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-28 05:22:22,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:22,594 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-28 05:22:22,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:22,604 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-28 05:22:22,618 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-28 05:22:22,637 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:22,638 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-28 05:22:22,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:22,648 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-28 05:22:22,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:22,825 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-28 05:22:22,827 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:22:22,833 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:22,833 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-28 05:22:22,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:22:22,845 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-28 05:22:22,860 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 05:22:22,861 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-28 05:22:22,924 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-28 05:22:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707572527] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:22,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2023-01-28 05:22:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204370431] [2023-01-28 05:22:22,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:22,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-28 05:22:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-28 05:22:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=677, Unknown=9, NotChecked=168, Total=992 [2023-01-28 05:22:22,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:22:22,929 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-28 05:22:22,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:22,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:22:22,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:24,551 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 1) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~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)))))) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (= (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)))) is different from false [2023-01-28 05:22:25,118 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (let ((.cse0 (let ((.cse7 (+ 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) .cse7)) 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) .cse7))))))) (.cse5 (<= c_~n~0 c_~back~0)) (.cse6 (< c_~back~0 0)) (.cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse4 (not (= .cse3 1)))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 .cse1) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 .cse4))) .cse0 .cse5 .cse6 .cse1) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 .cse5 .cse6 .cse1 .cse4)))) is different from false [2023-01-28 05:22:25,296 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (let ((.cse3 (let ((.cse7 (+ 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) .cse7)) 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) .cse7))))))) (.cse6 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse2 (not (= .cse1 1))) (.cse4 (<= c_~n~0 c_~back~0)) (.cse5 (< c_~back~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= 1 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 .cse2))) .cse3 .cse4 .cse5 .cse6) (<= 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 .cse3 .cse4 .cse5 .cse6 .cse2) (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|) .cse4 .cse5 (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-28 05:22:26,084 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (let ((.cse0 (let ((.cse7 (+ 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) .cse7)) 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) .cse7))))))) (.cse5 (<= c_~n~0 c_~back~0)) (.cse6 (< c_~back~0 0)) (.cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse4 (not (= .cse3 1)))) (and (or .cse0 .cse1) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 .cse4))) .cse0 .cse5 .cse6 .cse1) (or .cse0 .cse5 .cse6 .cse1 .cse4)))) is different from false [2023-01-28 05:22:27,671 INFO L130 PetriNetUnfolder]: 2467/4134 cut-off events. [2023-01-28 05:22:27,671 INFO L131 PetriNetUnfolder]: For 154118/154118 co-relation queries the response was YES. [2023-01-28 05:22:27,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32710 conditions, 4134 events. 2467/4134 cut-off events. For 154118/154118 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23789 event pairs, 145 based on Foata normal form. 84/4209 useless extension candidates. Maximal degree in co-relation 32641. Up to 1292 conditions per place. [2023-01-28 05:22:27,705 INFO L137 encePairwiseOnDemand]: 226/246 looper letters, 326 selfloop transitions, 287 changer transitions 75/688 dead transitions. [2023-01-28 05:22:27,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 688 transitions, 8816 flow [2023-01-28 05:22:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-01-28 05:22:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-01-28 05:22:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 4230 transitions. [2023-01-28 05:22:27,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27293844367015097 [2023-01-28 05:22:27,710 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 4230 transitions. [2023-01-28 05:22:27,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 4230 transitions. [2023-01-28 05:22:27,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:27,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 4230 transitions. [2023-01-28 05:22:27,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 67.14285714285714) internal successors, (4230), 63 states have internal predecessors, (4230), 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-28 05:22:27,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 246.0) internal successors, (15744), 64 states have internal predecessors, (15744), 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-28 05:22:27,727 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 246.0) internal successors, (15744), 64 states have internal predecessors, (15744), 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-28 05:22:27,727 INFO L175 Difference]: Start difference. First operand has 207 places, 307 transitions, 3046 flow. Second operand 63 states and 4230 transitions. [2023-01-28 05:22:27,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 688 transitions, 8816 flow [2023-01-28 05:22:28,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 688 transitions, 8175 flow, removed 297 selfloop flow, removed 19 redundant places. [2023-01-28 05:22:28,125 INFO L231 Difference]: Finished difference. Result has 272 places, 408 transitions, 4818 flow [2023-01-28 05:22:28,126 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=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=4818, PETRI_PLACES=272, PETRI_TRANSITIONS=408} [2023-01-28 05:22:28,126 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 241 predicate places. [2023-01-28 05:22:28,126 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 408 transitions, 4818 flow [2023-01-28 05:22:28,127 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-28 05:22:28,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:28,127 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-28 05:22:28,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-28 05:22:28,332 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-28 05:22:28,332 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-28 05:22:28,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash 794830231, now seen corresponding path program 4 times [2023-01-28 05:22:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467018952] [2023-01-28 05:22:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:29,530 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-28 05:22:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467018952] [2023-01-28 05:22:29,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467018952] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438968021] [2023-01-28 05:22:29,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 05:22:29,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:29,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:29,532 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-28 05:22:29,534 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-28 05:22:29,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 05:22:29,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:29,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-28 05:22:29,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:29,788 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-28 05:22:29,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:29,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:29,877 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-28 05:22:30,040 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-28 05:22:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438968021] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:30,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 25 [2023-01-28 05:22:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729816360] [2023-01-28 05:22:30,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:30,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 05:22:30,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 05:22:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2023-01-28 05:22:30,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:22:30,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 408 transitions, 4818 flow. Second operand has 26 states, 26 states have (on average 64.23076923076923) internal successors, (1670), 26 states have internal predecessors, (1670), 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-28 05:22:30,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:30,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:22:30,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:32,528 INFO L130 PetriNetUnfolder]: 2802/4729 cut-off events. [2023-01-28 05:22:32,529 INFO L131 PetriNetUnfolder]: For 208963/208963 co-relation queries the response was YES. [2023-01-28 05:22:32,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44201 conditions, 4729 events. 2802/4729 cut-off events. For 208963/208963 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 27917 event pairs, 148 based on Foata normal form. 40/4768 useless extension candidates. Maximal degree in co-relation 44112. Up to 1466 conditions per place. [2023-01-28 05:22:32,663 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 369 selfloop transitions, 243 changer transitions 97/709 dead transitions. [2023-01-28 05:22:32,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 709 transitions, 10316 flow [2023-01-28 05:22:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-01-28 05:22:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-01-28 05:22:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2504 transitions. [2023-01-28 05:22:32,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27510437266534826 [2023-01-28 05:22:32,668 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2504 transitions. [2023-01-28 05:22:32,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2504 transitions. [2023-01-28 05:22:32,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:32,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2504 transitions. [2023-01-28 05:22:32,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 67.67567567567568) internal successors, (2504), 37 states have internal predecessors, (2504), 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-28 05:22:32,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 246.0) internal successors, (9348), 38 states have internal predecessors, (9348), 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-28 05:22:32,681 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 246.0) internal successors, (9348), 38 states have internal predecessors, (9348), 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-28 05:22:32,682 INFO L175 Difference]: Start difference. First operand has 272 places, 408 transitions, 4818 flow. Second operand 37 states and 2504 transitions. [2023-01-28 05:22:32,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 709 transitions, 10316 flow [2023-01-28 05:22:33,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 709 transitions, 9693 flow, removed 259 selfloop flow, removed 27 redundant places. [2023-01-28 05:22:33,246 INFO L231 Difference]: Finished difference. Result has 287 places, 456 transitions, 5878 flow [2023-01-28 05:22:33,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=4413, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5878, PETRI_PLACES=287, PETRI_TRANSITIONS=456} [2023-01-28 05:22:33,247 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 256 predicate places. [2023-01-28 05:22:33,247 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 456 transitions, 5878 flow [2023-01-28 05:22:33,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 64.23076923076923) internal successors, (1670), 26 states have internal predecessors, (1670), 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-28 05:22:33,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:33,247 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-28 05:22:33,253 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-28 05:22:33,448 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-28 05:22:33,448 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-28 05:22:33,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 238639103, now seen corresponding path program 5 times [2023-01-28 05:22:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238131922] [2023-01-28 05:22:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:33,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:34,486 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-28 05:22:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238131922] [2023-01-28 05:22:34,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238131922] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942090200] [2023-01-28 05:22:34,487 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 05:22:34,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:34,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:34,488 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-28 05:22:34,490 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-28 05:22:34,559 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:22:34,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:34,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-28 05:22:34,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:34,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:22:34,733 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-28 05:22:34,798 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-28 05:22:34,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:34,905 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_344 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) .cse0) c_~sum~0))) (forall ((v_ArrVal_344 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_344) c_~queue~0.base) .cse0) c_~sum~0) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) is different from false [2023-01-28 05:22:34,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:34,926 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-28 05:22:34,930 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-28 05:22:34,933 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-28 05:22:35,163 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-28 05:22:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942090200] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:35,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:35,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2023-01-28 05:22:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478546291] [2023-01-28 05:22:35,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:35,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 05:22:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 05:22:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=663, Unknown=1, NotChecked=52, Total=812 [2023-01-28 05:22:35,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-01-28 05:22:35,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 456 transitions, 5878 flow. Second operand has 29 states, 29 states have (on average 70.03448275862068) internal successors, (2031), 29 states have internal predecessors, (2031), 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-28 05:22:35,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:35,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-01-28 05:22:35,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:46,392 WARN L222 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:22:46,780 INFO L130 PetriNetUnfolder]: 3072/5151 cut-off events. [2023-01-28 05:22:46,781 INFO L131 PetriNetUnfolder]: For 252404/252404 co-relation queries the response was YES. [2023-01-28 05:22:46,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51808 conditions, 5151 events. 3072/5151 cut-off events. For 252404/252404 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 30816 event pairs, 158 based on Foata normal form. 86/5237 useless extension candidates. Maximal degree in co-relation 51716. Up to 1573 conditions per place. [2023-01-28 05:22:46,893 INFO L137 encePairwiseOnDemand]: 230/246 looper letters, 312 selfloop transitions, 240 changer transitions 213/765 dead transitions. [2023-01-28 05:22:46,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 765 transitions, 12003 flow [2023-01-28 05:22:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-01-28 05:22:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-01-28 05:22:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 3156 transitions. [2023-01-28 05:22:46,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29835507657402155 [2023-01-28 05:22:46,899 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 3156 transitions. [2023-01-28 05:22:46,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 3156 transitions. [2023-01-28 05:22:46,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:46,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 3156 transitions. [2023-01-28 05:22:46,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 73.3953488372093) internal successors, (3156), 43 states have internal predecessors, (3156), 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-28 05:22:46,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 246.0) internal successors, (10824), 44 states have internal predecessors, (10824), 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-28 05:22:46,907 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 246.0) internal successors, (10824), 44 states have internal predecessors, (10824), 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-28 05:22:46,907 INFO L175 Difference]: Start difference. First operand has 287 places, 456 transitions, 5878 flow. Second operand 43 states and 3156 transitions. [2023-01-28 05:22:46,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 765 transitions, 12003 flow [2023-01-28 05:22:47,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 765 transitions, 10988 flow, removed 277 selfloop flow, removed 20 redundant places. [2023-01-28 05:22:47,658 INFO L231 Difference]: Finished difference. Result has 311 places, 417 transitions, 5518 flow [2023-01-28 05:22:47,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=5181, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=5518, PETRI_PLACES=311, PETRI_TRANSITIONS=417} [2023-01-28 05:22:47,659 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 280 predicate places. [2023-01-28 05:22:47,659 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 417 transitions, 5518 flow [2023-01-28 05:22:47,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 70.03448275862068) internal successors, (2031), 29 states have internal predecessors, (2031), 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-28 05:22:47,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:47,659 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:22:47,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 05:22:47,860 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-28 05:22:47,860 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-28 05:22:47,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:47,860 INFO L85 PathProgramCache]: Analyzing trace with hash 960179920, now seen corresponding path program 6 times [2023-01-28 05:22:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:47,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863400146] [2023-01-28 05:22:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:47,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:22:48,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863400146] [2023-01-28 05:22:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863400146] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935577135] [2023-01-28 05:22:48,686 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 05:22:48,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:48,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:48,687 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-28 05:22:48,689 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-28 05:22:48,768 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 05:22:48,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:48,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 27 conjunts are in the unsatisfiable core [2023-01-28 05:22:48,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:48,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:22:48,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:49,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:49,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 68 treesize of output 44 [2023-01-28 05:22:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:22:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935577135] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:49,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 24 [2023-01-28 05:22:49,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626405077] [2023-01-28 05:22:49,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:49,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 05:22:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:49,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 05:22:49,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2023-01-28 05:22:49,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-28 05:22:49,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 417 transitions, 5518 flow. Second operand has 25 states, 25 states have (on average 74.52) internal successors, (1863), 25 states have internal predecessors, (1863), 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-28 05:22:49,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:49,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-28 05:22:49,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:51,322 INFO L130 PetriNetUnfolder]: 2613/4292 cut-off events. [2023-01-28 05:22:51,322 INFO L131 PetriNetUnfolder]: For 201606/201606 co-relation queries the response was YES. [2023-01-28 05:22:51,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44841 conditions, 4292 events. 2613/4292 cut-off events. For 201606/201606 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 24335 event pairs, 173 based on Foata normal form. 56/4348 useless extension candidates. Maximal degree in co-relation 44748. Up to 1443 conditions per place. [2023-01-28 05:22:51,360 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 293 selfloop transitions, 288 changer transitions 42/623 dead transitions. [2023-01-28 05:22:51,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 623 transitions, 10136 flow [2023-01-28 05:22:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-01-28 05:22:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-01-28 05:22:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2797 transitions. [2023-01-28 05:22:51,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3158310749774164 [2023-01-28 05:22:51,363 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2797 transitions. [2023-01-28 05:22:51,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2797 transitions. [2023-01-28 05:22:51,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:51,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2797 transitions. [2023-01-28 05:22:51,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 77.69444444444444) internal successors, (2797), 36 states have internal predecessors, (2797), 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-28 05:22:51,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 246.0) internal successors, (9102), 37 states have internal predecessors, (9102), 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-28 05:22:51,371 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 246.0) internal successors, (9102), 37 states have internal predecessors, (9102), 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-28 05:22:51,371 INFO L175 Difference]: Start difference. First operand has 311 places, 417 transitions, 5518 flow. Second operand 36 states and 2797 transitions. [2023-01-28 05:22:51,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 623 transitions, 10136 flow [2023-01-28 05:22:51,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 623 transitions, 9493 flow, removed 138 selfloop flow, removed 38 redundant places. [2023-01-28 05:22:51,862 INFO L231 Difference]: Finished difference. Result has 299 places, 453 transitions, 6528 flow [2023-01-28 05:22:51,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=5110, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=6528, PETRI_PLACES=299, PETRI_TRANSITIONS=453} [2023-01-28 05:22:51,863 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 268 predicate places. [2023-01-28 05:22:51,863 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 453 transitions, 6528 flow [2023-01-28 05:22:51,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 74.52) internal successors, (1863), 25 states have internal predecessors, (1863), 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-28 05:22:51,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:51,863 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:22:51,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 05:22:52,068 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-28 05:22:52,068 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-28 05:22:52,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -274856926, now seen corresponding path program 7 times [2023-01-28 05:22:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030585666] [2023-01-28 05:22:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:52,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:22:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030585666] [2023-01-28 05:22:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030585666] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765821580] [2023-01-28 05:22:52,863 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 05:22:52,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:52,864 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-28 05:22:52,871 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-28 05:22:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:52,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 05:22:52,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:53,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:22:53,133 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-28 05:22:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:22:53,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:53,324 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_449 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_449) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_449 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_449) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-01-28 05:22:53,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:22:53,354 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-28 05:22:53,357 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-28 05:22:53,359 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-28 05:22:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:22:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765821580] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:53,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 29 [2023-01-28 05:22:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346064975] [2023-01-28 05:22:53,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:53,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 05:22:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 05:22:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=703, Unknown=1, NotChecked=54, Total=870 [2023-01-28 05:22:53,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-01-28 05:22:53,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 453 transitions, 6528 flow. Second operand has 30 states, 30 states have (on average 70.23333333333333) internal successors, (2107), 30 states have internal predecessors, (2107), 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-28 05:22:53,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:53,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-01-28 05:22:53,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:56,087 INFO L130 PetriNetUnfolder]: 2673/4388 cut-off events. [2023-01-28 05:22:56,087 INFO L131 PetriNetUnfolder]: For 191293/191293 co-relation queries the response was YES. [2023-01-28 05:22:56,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45594 conditions, 4388 events. 2673/4388 cut-off events. For 191293/191293 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 24881 event pairs, 173 based on Foata normal form. 56/4444 useless extension candidates. Maximal degree in co-relation 45507. Up to 1465 conditions per place. [2023-01-28 05:22:56,169 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 301 selfloop transitions, 281 changer transitions 54/636 dead transitions. [2023-01-28 05:22:56,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 636 transitions, 10735 flow [2023-01-28 05:22:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-28 05:22:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-28 05:22:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2588 transitions. [2023-01-28 05:22:56,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3005807200929152 [2023-01-28 05:22:56,174 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2588 transitions. [2023-01-28 05:22:56,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2588 transitions. [2023-01-28 05:22:56,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:56,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2588 transitions. [2023-01-28 05:22:56,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 73.94285714285714) internal successors, (2588), 35 states have internal predecessors, (2588), 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-28 05:22:56,181 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-28 05:22:56,181 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-28 05:22:56,181 INFO L175 Difference]: Start difference. First operand has 299 places, 453 transitions, 6528 flow. Second operand 35 states and 2588 transitions. [2023-01-28 05:22:56,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 636 transitions, 10735 flow [2023-01-28 05:22:56,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 636 transitions, 10262 flow, removed 97 selfloop flow, removed 18 redundant places. [2023-01-28 05:22:56,630 INFO L231 Difference]: Finished difference. Result has 317 places, 463 transitions, 7030 flow [2023-01-28 05:22:56,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=6144, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=7030, PETRI_PLACES=317, PETRI_TRANSITIONS=463} [2023-01-28 05:22:56,630 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 286 predicate places. [2023-01-28 05:22:56,630 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 463 transitions, 7030 flow [2023-01-28 05:22:56,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 70.23333333333333) internal successors, (2107), 30 states have internal predecessors, (2107), 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-28 05:22:56,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:56,631 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-28 05:22:56,637 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-28 05:22:56,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:56,835 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-28 05:22:56,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2047561495, now seen corresponding path program 8 times [2023-01-28 05:22:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834344169] [2023-01-28 05:22:56,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:56,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:56,963 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-28 05:22:56,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834344169] [2023-01-28 05:22:56,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834344169] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:56,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517133718] [2023-01-28 05:22:56,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:22:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:56,964 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-28 05:22:56,966 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-28 05:22:57,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:22:57,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:57,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 05:22:57,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:57,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 92 [2023-01-28 05:22:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:22:57,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 05:22:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517133718] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 05:22:57,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 05:22:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2023-01-28 05:22:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817882243] [2023-01-28 05:22:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 05:22:57,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 05:22:57,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:57,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 05:22:57,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-01-28 05:22:57,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 246 [2023-01-28 05:22:57,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 463 transitions, 7030 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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-28 05:22:57,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:57,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 246 [2023-01-28 05:22:57,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:22:58,303 INFO L130 PetriNetUnfolder]: 3250/5992 cut-off events. [2023-01-28 05:22:58,303 INFO L131 PetriNetUnfolder]: For 330628/332274 co-relation queries the response was YES. [2023-01-28 05:22:58,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64624 conditions, 5992 events. 3250/5992 cut-off events. For 330628/332274 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 42064 event pairs, 458 based on Foata normal form. 675/6396 useless extension candidates. Maximal degree in co-relation 64537. Up to 2302 conditions per place. [2023-01-28 05:22:58,363 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 321 selfloop transitions, 154 changer transitions 1/637 dead transitions. [2023-01-28 05:22:58,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 637 transitions, 10983 flow [2023-01-28 05:22:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 05:22:58,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 05:22:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-01-28 05:22:58,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132113821138211 [2023-01-28 05:22:58,365 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-01-28 05:22:58,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-01-28 05:22:58,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:22:58,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-01-28 05:22:58,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 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-28 05:22:58,366 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-28 05:22:58,366 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-28 05:22:58,366 INFO L175 Difference]: Start difference. First operand has 317 places, 463 transitions, 7030 flow. Second operand 4 states and 505 transitions. [2023-01-28 05:22:58,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 637 transitions, 10983 flow [2023-01-28 05:22:58,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 637 transitions, 10347 flow, removed 68 selfloop flow, removed 28 redundant places. [2023-01-28 05:22:58,740 INFO L231 Difference]: Finished difference. Result has 294 places, 561 transitions, 9286 flow [2023-01-28 05:22:58,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=6494, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=9286, PETRI_PLACES=294, PETRI_TRANSITIONS=561} [2023-01-28 05:22:58,741 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2023-01-28 05:22:58,741 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 561 transitions, 9286 flow [2023-01-28 05:22:58,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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-28 05:22:58,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:22:58,741 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:22:58,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 05:22:58,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-28 05:22:58,945 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-28 05:22:58,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:22:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1469162885, now seen corresponding path program 9 times [2023-01-28 05:22:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:22:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280005730] [2023-01-28 05:22:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:22:58,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:22:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:22:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 05:22:59,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:22:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280005730] [2023-01-28 05:22:59,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280005730] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:22:59,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11928669] [2023-01-28 05:22:59,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:22:59,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:22:59,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:22:59,040 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-28 05:22:59,042 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-28 05:22:59,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 05:22:59,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:22:59,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 05:22:59,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:22:59,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 92 [2023-01-28 05:22:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 05:22:59,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:22:59,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 104 [2023-01-28 05:22:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 05:22:59,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11928669] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:22:59,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:22:59,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 05:22:59,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532639697] [2023-01-28 05:22:59,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:22:59,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 05:22:59,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:22:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 05:22:59,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-28 05:22:59,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 246 [2023-01-28 05:22:59,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 561 transitions, 9286 flow. Second operand has 12 states, 12 states have (on average 104.66666666666667) internal successors, (1256), 12 states have internal predecessors, (1256), 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-28 05:22:59,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:22:59,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 246 [2023-01-28 05:22:59,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:23:00,230 INFO L130 PetriNetUnfolder]: 1850/3615 cut-off events. [2023-01-28 05:23:00,230 INFO L131 PetriNetUnfolder]: For 211916/212944 co-relation queries the response was YES. [2023-01-28 05:23:00,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41052 conditions, 3615 events. 1850/3615 cut-off events. For 211916/212944 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 24452 event pairs, 778 based on Foata normal form. 395/3907 useless extension candidates. Maximal degree in co-relation 40963. Up to 2530 conditions per place. [2023-01-28 05:23:00,269 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 275 selfloop transitions, 3 changer transitions 32/407 dead transitions. [2023-01-28 05:23:00,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 407 transitions, 7607 flow [2023-01-28 05:23:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 05:23:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 05:23:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-01-28 05:23:00,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43970189701897017 [2023-01-28 05:23:00,270 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-01-28 05:23:00,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-01-28 05:23:00,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:23:00,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-01-28 05:23:00,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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-28 05:23:00,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 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-28 05:23:00,272 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 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-28 05:23:00,272 INFO L175 Difference]: Start difference. First operand has 294 places, 561 transitions, 9286 flow. Second operand 6 states and 649 transitions. [2023-01-28 05:23:00,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 407 transitions, 7607 flow [2023-01-28 05:23:00,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 407 transitions, 7143 flow, removed 131 selfloop flow, removed 18 redundant places. [2023-01-28 05:23:00,586 INFO L231 Difference]: Finished difference. Result has 252 places, 375 transitions, 6177 flow [2023-01-28 05:23:00,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=6451, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6177, PETRI_PLACES=252, PETRI_TRANSITIONS=375} [2023-01-28 05:23:00,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2023-01-28 05:23:00,587 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 375 transitions, 6177 flow [2023-01-28 05:23:00,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 104.66666666666667) internal successors, (1256), 12 states have internal predecessors, (1256), 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-28 05:23:00,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:23:00,587 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-28 05:23:00,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-28 05:23:00,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 05:23:00,788 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-28 05:23:00,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:23:00,788 INFO L85 PathProgramCache]: Analyzing trace with hash 63561626, now seen corresponding path program 10 times [2023-01-28 05:23:00,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:23:00,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347971786] [2023-01-28 05:23:00,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:23:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:23:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:23:01,931 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-28 05:23:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:23:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347971786] [2023-01-28 05:23:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347971786] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:23:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437792944] [2023-01-28 05:23:01,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 05:23:01,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:23:01,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:23:01,932 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-28 05:23:01,934 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-28 05:23:02,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 05:23:02,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:23:02,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 56 conjunts are in the unsatisfiable core [2023-01-28 05:23:02,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:23:02,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-28 05:23:02,151 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-28 05:23:02,188 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-28 05:23:02,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:23:02,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 05:23:02,551 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-28 05:23:02,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:23:03,861 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (+ c_~front~0 1))) (or (let ((.cse11 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse12 4)) (.cse3 (+ c_~queue~0.offset .cse12)) (.cse4 (+ c_~queue~0.offset .cse11 4)) (.cse5 (+ c_~queue~0.offset .cse11)) (.cse7 (<= (+ c_~back~0 1) c_~front~0))) (and (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_589))) (let ((.cse0 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base)) (.cse2 (select .cse6 c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (not (= (select .cse2 .cse3) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse4) (select .cse2 .cse5))))))) .cse7) (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_589))) (let ((.cse8 (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base)) (.cse9 (select .cse10 c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (not (= (select .cse9 .cse3) 1)) (<= (+ c_~sum~0 (select .cse8 .cse4) (select .cse9 .cse5)) 1))))) .cse7)))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< .cse13 0) (< c_~back~0 0) (<= c_~n~0 .cse13))) is different from false [2023-01-28 05:23:04,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:04,098 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 129 treesize of output 93 [2023-01-28 05:23:04,139 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 05:23:04,140 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 16854 treesize of output 15192 [2023-01-28 05:23:04,197 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:23:04,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:04,210 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 324 treesize of output 318 [2023-01-28 05:23:04,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:04,226 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 344 treesize of output 296 [2023-01-28 05:23:04,257 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 05:23:04,257 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 287 treesize of output 249 [2023-01-28 05:23:05,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:05,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2023-01-28 05:23:05,634 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 05:23:05,634 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 2328 treesize of output 2110 [2023-01-28 05:23:05,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:23:05,674 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 370 treesize of output 314 [2023-01-28 05:23:05,691 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 05:23:05,692 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 378 treesize of output 322 [2023-01-28 05:23:05,715 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 05:23:05,715 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 255 treesize of output 231 [2023-01-28 05:23:05,901 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 05:23:06,087 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-28 05:23:06,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437792944] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:23:06,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:23:06,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2023-01-28 05:23:06,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857759295] [2023-01-28 05:23:06,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:23:06,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-28 05:23:06,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:23:06,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-28 05:23:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1305, Unknown=11, NotChecked=76, Total=1640 [2023-01-28 05:23:06,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 246 [2023-01-28 05:23:06,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 375 transitions, 6177 flow. Second operand has 41 states, 41 states have (on average 65.70731707317073) internal successors, (2694), 41 states have internal predecessors, (2694), 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-28 05:23:06,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:23:06,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 246 [2023-01-28 05:23:06,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:23:06,352 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse30 (* c_~back~0 4))) (let ((.cse29 (* c_~front~0 4)) (.cse28 (select |c_#memory_int| c_~queue~0.base)) (.cse21 (+ c_~queue~0.offset .cse30))) (let ((.cse10 (select .cse28 .cse21)) (.cse6 (+ c_~queue~0.offset .cse30 4)) (.cse7 (+ c_~queue~0.offset .cse29 4)) (.cse8 (select .cse28 (+ c_~queue~0.offset .cse29))) (.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse25 (+ c_~front~0 1)) (.cse0 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse3 (not .cse0)) (.cse16 (<= c_~back~0 c_~front~0)) (.cse14 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse18 (= (mod c_~v_assert~0 256) 0)) (.cse11 (<= c_~n~0 c_~back~0)) (.cse12 (< .cse25 0)) (.cse13 (< c_~back~0 0)) (.cse1 (and (or .cse4 (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (+ (select .cse26 .cse6) 1) 0)) (<= (+ c_~sum~0 (select .cse26 .cse7) .cse8) 1))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (+ (select .cse27 .cse6) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse27 .cse7) .cse8))))) .cse4))) (.cse2 (not (= .cse10 1))) (.cse15 (<= c_~n~0 .cse25)) (.cse19 (<= 0 c_~sum~0))) (and (or (and (or .cse0 .cse1 .cse2) (or .cse3 (and (or .cse4 (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (select .cse5 .cse6) 1)) (<= (+ c_~sum~0 (select .cse5 .cse7) .cse8) 1))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (select .cse9 .cse6) 1)) (<= 0 (+ c_~sum~0 (select .cse9 .cse7) .cse8))))) .cse4)) (not (= (+ .cse10 1) 0)))) .cse11 .cse12 .cse13 .cse14 .cse15) (or (<= c_~n~0 c_~front~0) .cse16 (let ((.cse17 (+ c_~sum~0 .cse8))) (and (<= .cse17 1) (<= 0 .cse17))) (< c_~front~0 0)) (<= c_~sum~0 0) (or .cse18 .cse11 .cse12 .cse13 (and (or .cse4 (<= c_~sum~0 1)) (or (and (= c_~back~0 c_~front~0) .cse19) .cse4)) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or .cse11 .cse12 .cse13 .cse14 .cse1 .cse2 .cse15) (<= c_~v_assert~0 1) (or (and (or .cse16 .cse0 (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (select .cse20 .cse21) 1)) (<= 0 (+ c_~sum~0 (select .cse20 .cse7) .cse8)))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse22 .cse7) .cse8)) (not (= (+ (select .cse22 .cse21) 1) 0))))) .cse16 .cse3) (or .cse16 .cse3 (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse23 .cse7) .cse8) 1) (not (= (+ (select .cse23 .cse21) 1) 0)))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (select .cse24 .cse21) 1)) (<= (+ c_~sum~0 (select .cse24 .cse7) .cse8) 1)))) .cse16 .cse0)) .cse12 .cse14 .cse15) (or .cse18 .cse11 .cse12 .cse13 .cse1 .cse2 .cse15) (<= 1 c_~v_assert~0) .cse19))))) is different from false [2023-01-28 05:23:06,495 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~front~0 4)) (.cse21 (* c_~back~0 4)) (.cse20 (+ c_~front~0 1))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< .cse20 0)) (.cse3 (< c_~back~0 0)) (.cse7 (+ c_~queue~0.offset .cse21 4)) (.cse10 (+ c_~queue~0.offset .cse22 4)) (.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse11 (+ c_~queue~0.offset .cse22)) (.cse9 (+ c_~queue~0.offset .cse21)) (.cse5 (<= c_~n~0 .cse20))) (and (or .cse0 .cse1 .cse2 .cse3 (and (or .cse4 (<= c_~sum~0 1)) (or (and (= c_~back~0 c_~front~0) (<= 0 c_~sum~0)) .cse4)) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (or (and (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_589))) (let ((.cse6 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base)) (.cse8 (select .cse12 c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse7) 1) 0)) (not (= (select .cse8 .cse9) 1)) (<= 0 (+ c_~sum~0 (select .cse6 .cse10) (select .cse8 .cse11))))))) .cse4) (or (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_590 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_589))) (let ((.cse13 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base)) (.cse14 (select .cse15 c_~queue~0.base))) (or (not (= (+ (select .cse13 .cse7) 1) 0)) (not (= (select .cse14 .cse9) 1)) (<= (+ c_~sum~0 (select .cse13 .cse10) (select .cse14 .cse11)) 1))))) .cse4)) .cse0 .cse1 .cse2 .cse3 .cse5) (let ((.cse19 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 .cse1 .cse2 .cse3 (let ((.cse17 (select .cse19 .cse11))) (and (or .cse4 (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (+ (select .cse16 .cse7) 1) 0)) (<= (+ c_~sum~0 (select .cse16 .cse10) .cse17) 1))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (+ (select .cse18 .cse7) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse18 .cse10) .cse17))))) .cse4))) (not (= (select .cse19 .cse9) 1)) .cse5))))) is different from false [2023-01-28 05:23:09,225 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (< c_~front~0 0) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse1)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse4 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse0 (<= (+ c_~back~0 1) c_~front~0))) (and (or .cse0 .cse1 (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (select .cse2 .cse3) 1)) (<= (+ (select .cse2 .cse4) c_~sum~0) 1))))) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse3) 1) 0)) (<= (+ (select .cse5 .cse4) c_~sum~0) 1)))) .cse0 .cse6) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (<= 0 (+ (select .cse7 .cse4) c_~sum~0)) (not (= (+ (select .cse7 .cse3) 1) 0))))) .cse0 .cse6) (or (forall ((v_ArrVal_590 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_590) c_~queue~0.base))) (or (not (= (select .cse8 .cse3) 1)) (<= 0 (+ (select .cse8 .cse4) c_~sum~0))))) .cse0 .cse1))))) (< 0 (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256))) is different from false [2023-01-28 05:23:13,370 INFO L130 PetriNetUnfolder]: 4212/7294 cut-off events. [2023-01-28 05:23:13,370 INFO L131 PetriNetUnfolder]: For 245605/245605 co-relation queries the response was YES. [2023-01-28 05:23:13,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72222 conditions, 7294 events. 4212/7294 cut-off events. For 245605/245605 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 47064 event pairs, 733 based on Foata normal form. 405/7699 useless extension candidates. Maximal degree in co-relation 72150. Up to 2636 conditions per place. [2023-01-28 05:23:13,425 INFO L137 encePairwiseOnDemand]: 232/246 looper letters, 284 selfloop transitions, 298 changer transitions 210/792 dead transitions. [2023-01-28 05:23:13,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 792 transitions, 14449 flow [2023-01-28 05:23:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-28 05:23:13,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-01-28 05:23:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3285 transitions. [2023-01-28 05:23:13,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2841203943954333 [2023-01-28 05:23:13,429 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3285 transitions. [2023-01-28 05:23:13,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3285 transitions. [2023-01-28 05:23:13,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:23:13,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3285 transitions. [2023-01-28 05:23:13,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 69.8936170212766) internal successors, (3285), 47 states have internal predecessors, (3285), 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-28 05:23:13,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 246.0) internal successors, (11808), 48 states have internal predecessors, (11808), 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-28 05:23:13,438 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 246.0) internal successors, (11808), 48 states have internal predecessors, (11808), 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-28 05:23:13,438 INFO L175 Difference]: Start difference. First operand has 252 places, 375 transitions, 6177 flow. Second operand 47 states and 3285 transitions. [2023-01-28 05:23:13,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 792 transitions, 14449 flow [2023-01-28 05:23:13,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 792 transitions, 13476 flow, removed 329 selfloop flow, removed 12 redundant places. [2023-01-28 05:23:13,808 INFO L231 Difference]: Finished difference. Result has 294 places, 455 transitions, 8372 flow [2023-01-28 05:23:13,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=5893, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=8372, PETRI_PLACES=294, PETRI_TRANSITIONS=455} [2023-01-28 05:23:13,809 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2023-01-28 05:23:13,809 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 455 transitions, 8372 flow [2023-01-28 05:23:13,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 65.70731707317073) internal successors, (2694), 41 states have internal predecessors, (2694), 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-28 05:23:13,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:23:13,810 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-28 05:23:13,820 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-28 05:23:14,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 05:23:14,017 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-28 05:23:14,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:23:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash 485129310, now seen corresponding path program 11 times [2023-01-28 05:23:14,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:23:14,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990476851] [2023-01-28 05:23:14,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:23:14,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:23:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:23:14,877 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-28 05:23:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:23:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990476851] [2023-01-28 05:23:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990476851] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:23:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926119052] [2023-01-28 05:23:14,878 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 05:23:14,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:23:14,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:23:14,879 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-28 05:23:14,881 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-28 05:23:14,968 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-01-28 05:23:14,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:23:14,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-28 05:23:14,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:23:15,064 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-28 05:23:15,108 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-28 05:23:15,154 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-28 05:23:15,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:23:15,339 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-28 05:23:15,526 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-28 05:23:15,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:23:15,670 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4)) (.cse2 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_643 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (< c_~front~0 0)) is different from false [2023-01-28 05:23:16,279 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 2) c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (let ((.cse10 (* c_~back~0 4)) (.cse11 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse11 4)) (.cse4 (+ c_~queue~0.offset .cse11)) (.cse1 (+ c_~queue~0.offset .cse10)) (.cse6 (+ c_~queue~0.offset .cse10 4))) (and (forall ((v_ArrVal_642 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_642))) (let ((.cse0 (select .cse5 c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_ArrVal_643 (Array Int Int))) (<= (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (not (= (+ (select .cse0 .cse6) 1) 0)))))) (forall ((v_ArrVal_642 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_642))) (let ((.cse9 (select .cse8 c_~queue~0.base))) (or (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse3) (select .cse7 .cse4))))) (not (= (select .cse9 .cse1) 1)) (not (= (+ (select .cse9 .cse6) 1) 0))))))))) (< c_~front~0 0)) is different from false [2023-01-28 05:23:16,352 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse10 (* c_~back~0 4)) (.cse11 (* c_~front~0 4))) (let ((.cse4 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_641 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_641) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_642))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (not (= (select .cse0 .cse2) 1)) (forall ((v_ArrVal_643 (Array Int Int))) (<= (let ((.cse3 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ c_~sum~0 (select .cse3 .cse4) (select .cse3 .cse5))) 1)))))) (forall ((v_ArrVal_641 (Array Int Int)) (v_ArrVal_642 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_641) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_642))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ c_~sum~0 (select .cse7 .cse4) (select .cse7 .cse5))))) (not (= (+ (select .cse9 .cse1) 1) 0)) (not (= (select .cse9 .cse2) 1))))))))) (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 2) c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0)) is different from false [2023-01-28 05:23:16,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:16,394 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 129 treesize of output 93 [2023-01-28 05:23:16,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:16,416 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 2210 treesize of output 2076 [2023-01-28 05:23:16,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:16,455 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 238 treesize of output 248 [2023-01-28 05:23:16,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:16,478 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 212 treesize of output 196 [2023-01-28 05:23:17,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:17,317 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 106 treesize of output 54 [2023-01-28 05:23:17,328 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:17,329 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 129 treesize of output 93 [2023-01-28 05:23:17,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:23:17,353 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 05:23:17,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 502 [2023-01-28 05:23:17,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:23:17,373 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 05:23:17,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:23:17,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-01-28 05:23:17,390 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 05:23:17,391 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 179 treesize of output 135 [2023-01-28 05:23:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 05:23:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926119052] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:23:17,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:23:17,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2023-01-28 05:23:17,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127466106] [2023-01-28 05:23:17,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:23:17,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-28 05:23:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:23:17,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-28 05:23:17,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1123, Unknown=9, NotChecked=216, Total=1560 [2023-01-28 05:23:17,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:23:17,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 455 transitions, 8372 flow. Second operand has 40 states, 40 states have (on average 63.825) internal successors, (2553), 40 states have internal predecessors, (2553), 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-28 05:23:17,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:23:17,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:23:17,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:23:18,875 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= (+ c_~back~0 2) c_~front~0)) (.cse2 (<= c_~n~0 (+ c_~back~0 1))) (.cse3 (< c_~front~0 0))) (and (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)) .cse0 .cse1 .cse2 .cse3 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~back~0 4))) (or .cse0 (not (= (+ (select .cse4 (+ c_~queue~0.offset .cse5 4)) 1) 0)) .cse1 .cse2 (let ((.cse10 (* c_~front~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse10)) (.cse8 (+ c_~queue~0.offset .cse10 4))) (and (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse7) (select .cse6 .cse8))))) (forall ((v_ArrVal_643 (Array Int Int))) (<= (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse9 .cse7) (select .cse9 .cse8))) 1))))) .cse3 (not (= (select .cse4 (+ c_~queue~0.offset .cse5)) 1)))) (<= 1 c_~v_assert~0) (= c_~sum~0 0))) is different from false [2023-01-28 05:23:19,343 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1) 0)) (<= (+ c_~back~0 2) c_~front~0) (<= c_~n~0 (+ c_~back~0 1)) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_643 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_643 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))) (< c_~front~0 0) (not (= (select .cse0 (+ c_~queue~0.offset .cse1)) 1)))) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-01-28 05:23:23,622 INFO L130 PetriNetUnfolder]: 4827/8218 cut-off events. [2023-01-28 05:23:23,622 INFO L131 PetriNetUnfolder]: For 305385/305385 co-relation queries the response was YES. [2023-01-28 05:23:23,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85715 conditions, 8218 events. 4827/8218 cut-off events. For 305385/305385 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 53911 event pairs, 767 based on Foata normal form. 64/8282 useless extension candidates. Maximal degree in co-relation 85625. Up to 2956 conditions per place. [2023-01-28 05:23:23,704 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 373 selfloop transitions, 376 changer transitions 166/915 dead transitions. [2023-01-28 05:23:23,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 915 transitions, 18060 flow [2023-01-28 05:23:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-01-28 05:23:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-01-28 05:23:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3952 transitions. [2023-01-28 05:23:23,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27228882458316106 [2023-01-28 05:23:23,709 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3952 transitions. [2023-01-28 05:23:23,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3952 transitions. [2023-01-28 05:23:23,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:23:23,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3952 transitions. [2023-01-28 05:23:23,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 66.98305084745763) internal successors, (3952), 59 states have internal predecessors, (3952), 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-28 05:23:23,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 246.0) internal successors, (14760), 60 states have internal predecessors, (14760), 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-28 05:23:23,722 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 246.0) internal successors, (14760), 60 states have internal predecessors, (14760), 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-28 05:23:23,722 INFO L175 Difference]: Start difference. First operand has 294 places, 455 transitions, 8372 flow. Second operand 59 states and 3952 transitions. [2023-01-28 05:23:23,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 915 transitions, 18060 flow [2023-01-28 05:23:24,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 915 transitions, 17288 flow, removed 356 selfloop flow, removed 15 redundant places. [2023-01-28 05:23:24,818 INFO L231 Difference]: Finished difference. Result has 349 places, 570 transitions, 11498 flow [2023-01-28 05:23:24,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=7876, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=455, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=11498, PETRI_PLACES=349, PETRI_TRANSITIONS=570} [2023-01-28 05:23:24,819 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 318 predicate places. [2023-01-28 05:23:24,819 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 570 transitions, 11498 flow [2023-01-28 05:23:24,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 63.825) internal successors, (2553), 40 states have internal predecessors, (2553), 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-28 05:23:24,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:23:24,820 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-28 05:23:24,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-28 05:23:25,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 05:23:25,020 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-28 05:23:25,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:23:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1503467000, now seen corresponding path program 12 times [2023-01-28 05:23:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:23:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429306007] [2023-01-28 05:23:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:23:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:23:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:23:25,775 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-28 05:23:25,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:23:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429306007] [2023-01-28 05:23:25,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429306007] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:23:25,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130732441] [2023-01-28 05:23:25,776 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 05:23:25,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:23:25,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:23:25,777 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-28 05:23:25,778 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-28 05:23:25,957 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-28 05:23:25,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:23:25,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 05:23:25,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:23:25,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:23:25,977 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 66 treesize of output 70 [2023-01-28 05:23:26,312 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 32 treesize of output 32 [2023-01-28 05:23:26,400 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-28 05:23:26,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:23:26,730 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1))))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) is different from false [2023-01-28 05:23:26,762 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) is different from false [2023-01-28 05:23:26,919 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:23:26,919 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 296 treesize of output 234 [2023-01-28 05:23:26,930 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-28 05:23:26,939 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-28 05:23:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-01-28 05:23:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130732441] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:23:27,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:23:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2023-01-28 05:23:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316183641] [2023-01-28 05:23:27,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:23:27,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-28 05:23:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:23:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-28 05:23:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1065, Unknown=12, NotChecked=138, Total=1406 [2023-01-28 05:23:27,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-01-28 05:23:27,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 570 transitions, 11498 flow. Second operand has 38 states, 38 states have (on average 70.05263157894737) internal successors, (2662), 38 states have internal predecessors, (2662), 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-28 05:23:27,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:23:27,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-01-28 05:23:27,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:23:28,768 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 05:23:29,036 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-01-28 05:23:29,040 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1))))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1)) is different from false [2023-01-28 05:23:29,223 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse1))))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0) (let ((.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse6 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse4 (not .cse5) (not (= (+ .cse6 1) 0))) (or .cse4 .cse5 (not (= .cse6 1))))))) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|)) is different from false [2023-01-28 05:23:30,276 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_695 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_695 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_695) c_~queue~0.base) .cse0)) 1)) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256)))) is different from false [2023-01-28 05:23:41,129 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 58 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:23:49,873 INFO L130 PetriNetUnfolder]: 7059/11936 cut-off events. [2023-01-28 05:23:49,873 INFO L131 PetriNetUnfolder]: For 485544/485544 co-relation queries the response was YES. [2023-01-28 05:23:49,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131508 conditions, 11936 events. 7059/11936 cut-off events. For 485544/485544 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 82678 event pairs, 747 based on Foata normal form. 156/12092 useless extension candidates. Maximal degree in co-relation 131402. Up to 4393 conditions per place. [2023-01-28 05:23:50,012 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 766 selfloop transitions, 486 changer transitions 234/1486 dead transitions. [2023-01-28 05:23:50,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 1486 transitions, 32777 flow [2023-01-28 05:23:50,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-01-28 05:23:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-01-28 05:23:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 5531 transitions. [2023-01-28 05:23:50,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2997831978319783 [2023-01-28 05:23:50,021 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 5531 transitions. [2023-01-28 05:23:50,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 5531 transitions. [2023-01-28 05:23:50,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:23:50,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 5531 transitions. [2023-01-28 05:23:50,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 73.74666666666667) internal successors, (5531), 75 states have internal predecessors, (5531), 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-28 05:23:50,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 246.0) internal successors, (18696), 76 states have internal predecessors, (18696), 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-28 05:23:50,044 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 246.0) internal successors, (18696), 76 states have internal predecessors, (18696), 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-28 05:23:50,044 INFO L175 Difference]: Start difference. First operand has 349 places, 570 transitions, 11498 flow. Second operand 75 states and 5531 transitions. [2023-01-28 05:23:50,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 1486 transitions, 32777 flow [2023-01-28 05:23:51,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1486 transitions, 31593 flow, removed 411 selfloop flow, removed 26 redundant places. [2023-01-28 05:23:51,787 INFO L231 Difference]: Finished difference. Result has 422 places, 856 transitions, 19255 flow [2023-01-28 05:23:51,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=10893, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=254, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=19255, PETRI_PLACES=422, PETRI_TRANSITIONS=856} [2023-01-28 05:23:51,788 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 391 predicate places. [2023-01-28 05:23:51,789 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 856 transitions, 19255 flow [2023-01-28 05:23:51,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 70.05263157894737) internal successors, (2662), 38 states have internal predecessors, (2662), 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-28 05:23:51,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:23:51,789 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:23:51,794 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-28 05:23:51,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 05:23:51,990 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-28 05:23:51,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:23:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash -118743781, now seen corresponding path program 13 times [2023-01-28 05:23:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:23:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195509531] [2023-01-28 05:23:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:23:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:23:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:23:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:23:53,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:23:53,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195509531] [2023-01-28 05:23:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195509531] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:23:53,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45315536] [2023-01-28 05:23:53,196 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 05:23:53,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:23:53,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:23:53,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:23:53,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 05:23:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:23:53,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 05:23:53,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:23:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:23:53,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:23:53,823 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:23:53,824 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-28 05:23:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:23:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45315536] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:23:54,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:23:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 29 [2023-01-28 05:23:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744926033] [2023-01-28 05:23:54,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:23:54,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 05:23:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:23:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 05:23:54,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2023-01-28 05:23:54,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 246 [2023-01-28 05:23:54,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 856 transitions, 19255 flow. Second operand has 30 states, 30 states have (on average 74.36666666666666) internal successors, (2231), 30 states have internal predecessors, (2231), 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-28 05:23:54,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:23:54,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 246 [2023-01-28 05:23:54,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:24:03,067 INFO L130 PetriNetUnfolder]: 13009/21540 cut-off events. [2023-01-28 05:24:03,067 INFO L131 PetriNetUnfolder]: For 1276356/1276356 co-relation queries the response was YES. [2023-01-28 05:24:03,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286980 conditions, 21540 events. 13009/21540 cut-off events. For 1276356/1276356 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 158505 event pairs, 959 based on Foata normal form. 344/21884 useless extension candidates. Maximal degree in co-relation 286847. Up to 7947 conditions per place. [2023-01-28 05:24:03,310 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 655 selfloop transitions, 678 changer transitions 532/1865 dead transitions. [2023-01-28 05:24:03,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 1865 transitions, 47084 flow [2023-01-28 05:24:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-01-28 05:24:03,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-01-28 05:24:03,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4041 transitions. [2023-01-28 05:24:03,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31590056285178236 [2023-01-28 05:24:03,313 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4041 transitions. [2023-01-28 05:24:03,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4041 transitions. [2023-01-28 05:24:03,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:24:03,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4041 transitions. [2023-01-28 05:24:03,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 77.71153846153847) internal successors, (4041), 52 states have internal predecessors, (4041), 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-28 05:24:03,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 246.0) internal successors, (13038), 53 states have internal predecessors, (13038), 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-28 05:24:03,323 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 246.0) internal successors, (13038), 53 states have internal predecessors, (13038), 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-28 05:24:03,323 INFO L175 Difference]: Start difference. First operand has 422 places, 856 transitions, 19255 flow. Second operand 52 states and 4041 transitions. [2023-01-28 05:24:03,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 1865 transitions, 47084 flow [2023-01-28 05:24:13,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1865 transitions, 44106 flow, removed 1392 selfloop flow, removed 27 redundant places. [2023-01-28 05:24:13,384 INFO L231 Difference]: Finished difference. Result has 459 places, 1046 transitions, 25621 flow [2023-01-28 05:24:13,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=17602, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=506, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=25621, PETRI_PLACES=459, PETRI_TRANSITIONS=1046} [2023-01-28 05:24:13,385 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 428 predicate places. [2023-01-28 05:24:13,385 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 1046 transitions, 25621 flow [2023-01-28 05:24:13,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 74.36666666666666) internal successors, (2231), 30 states have internal predecessors, (2231), 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-28 05:24:13,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:24:13,385 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:24:13,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-28 05:24:13,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 05:24:13,586 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 05:24:13,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:24:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1736107353, now seen corresponding path program 14 times [2023-01-28 05:24:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:24:13,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562207681] [2023-01-28 05:24:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:24:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:24:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:24:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:24:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:24:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562207681] [2023-01-28 05:24:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562207681] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:24:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724169055] [2023-01-28 05:24:14,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 05:24:14,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:24:14,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:24:14,873 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:24:14,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 05:24:14,964 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 05:24:14,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:24:14,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 05:24:14,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:24:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:24:15,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:24:15,661 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:24:15,661 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-28 05:24:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:24:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724169055] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:24:16,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:24:16,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 32 [2023-01-28 05:24:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727224145] [2023-01-28 05:24:16,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:24:16,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 05:24:16,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:24:16,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 05:24:16,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2023-01-28 05:24:16,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:24:16,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1046 transitions, 25621 flow. Second operand has 33 states, 33 states have (on average 64.15151515151516) internal successors, (2117), 33 states have internal predecessors, (2117), 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-28 05:24:16,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:24:16,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:24:16,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:24:25,208 INFO L130 PetriNetUnfolder]: 11429/18928 cut-off events. [2023-01-28 05:24:25,208 INFO L131 PetriNetUnfolder]: For 1199531/1199531 co-relation queries the response was YES. [2023-01-28 05:24:25,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256734 conditions, 18928 events. 11429/18928 cut-off events. For 1199531/1199531 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 137833 event pairs, 1296 based on Foata normal form. 80/19008 useless extension candidates. Maximal degree in co-relation 256584. Up to 7895 conditions per place. [2023-01-28 05:24:25,490 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 641 selfloop transitions, 724 changer transitions 235/1600 dead transitions. [2023-01-28 05:24:25,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 1600 transitions, 42347 flow [2023-01-28 05:24:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 05:24:25,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 05:24:25,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 3243 transitions. [2023-01-28 05:24:25,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27464430894308944 [2023-01-28 05:24:25,493 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 3243 transitions. [2023-01-28 05:24:25,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 3243 transitions. [2023-01-28 05:24:25,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:24:25,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 3243 transitions. [2023-01-28 05:24:25,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 67.5625) internal successors, (3243), 48 states have internal predecessors, (3243), 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-28 05:24:25,502 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-28 05:24:25,503 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-28 05:24:25,503 INFO L175 Difference]: Start difference. First operand has 459 places, 1046 transitions, 25621 flow. Second operand 48 states and 3243 transitions. [2023-01-28 05:24:25,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 1600 transitions, 42347 flow [2023-01-28 05:24:31,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 1600 transitions, 39430 flow, removed 1068 selfloop flow, removed 32 redundant places. [2023-01-28 05:24:31,920 INFO L231 Difference]: Finished difference. Result has 479 places, 1118 transitions, 27905 flow [2023-01-28 05:24:31,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=23647, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=662, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=27905, PETRI_PLACES=479, PETRI_TRANSITIONS=1118} [2023-01-28 05:24:31,921 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 448 predicate places. [2023-01-28 05:24:31,921 INFO L495 AbstractCegarLoop]: Abstraction has has 479 places, 1118 transitions, 27905 flow [2023-01-28 05:24:31,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 64.15151515151516) internal successors, (2117), 33 states have internal predecessors, (2117), 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-28 05:24:31,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:24:31,922 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:24:31,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-28 05:24:32,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:24:32,126 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 05:24:32,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:24:32,126 INFO L85 PathProgramCache]: Analyzing trace with hash 29481971, now seen corresponding path program 15 times [2023-01-28 05:24:32,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:24:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018180179] [2023-01-28 05:24:32,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:24:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:24:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:24:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:24:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:24:33,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018180179] [2023-01-28 05:24:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018180179] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:24:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420992153] [2023-01-28 05:24:33,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 05:24:33,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:24:33,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:24:33,586 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:24:33,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 05:24:33,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-28 05:24:33,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:24:33,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2023-01-28 05:24:33,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:24:33,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:24:33,914 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-28 05:24:34,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 05:24:34,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:24:34,500 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse9 (* c_~front~0 4)) (.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse0 (not .cse6)) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (+ c_~queue~0.offset .cse9))) (and (or .cse0 (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_852) c_~queue~0.base))) (or (not (= (+ (select .cse1 .cse2) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse1 .cse3) (select .cse1 .cse4))))))) (or (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_852) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) (not (= (select .cse5 .cse2) 1))))) .cse6) (or .cse6 (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_852) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse3) (select .cse7 .cse4)) 1) (not (= (select .cse7 .cse2) 1)))))) (or .cse0 (forall ((v_ArrVal_852 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_852) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse2) 1) 0)) (<= (+ c_~sum~0 (select .cse8 .cse3) (select .cse8 .cse4)) 1))))))))) is different from false [2023-01-28 05:24:34,613 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:24:34,614 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 504 treesize of output 408 [2023-01-28 05:24:34,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:24:34,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 267 [2023-01-28 05:24:34,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:24:34,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 248 [2023-01-28 05:24:34,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:24:34,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 229 [2023-01-28 05:24:34,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:24:34,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 210 [2023-01-28 05:24:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:24:36,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420992153] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:24:36,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:24:36,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2023-01-28 05:24:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770889612] [2023-01-28 05:24:36,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:24:36,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-28 05:24:36,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:24:36,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-28 05:24:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1045, Unknown=1, NotChecked=66, Total=1260 [2023-01-28 05:24:36,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:24:36,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 1118 transitions, 27905 flow. Second operand has 36 states, 36 states have (on average 64.05555555555556) internal successors, (2306), 36 states have internal predecessors, (2306), 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-28 05:24:36,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:24:36,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:24:36,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:24:52,455 INFO L130 PetriNetUnfolder]: 17618/29175 cut-off events. [2023-01-28 05:24:52,455 INFO L131 PetriNetUnfolder]: For 1725662/1725662 co-relation queries the response was YES. [2023-01-28 05:24:52,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386452 conditions, 29175 events. 17618/29175 cut-off events. For 1725662/1725662 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 223139 event pairs, 1036 based on Foata normal form. 424/29599 useless extension candidates. Maximal degree in co-relation 386301. Up to 11174 conditions per place. [2023-01-28 05:24:52,977 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 831 selfloop transitions, 1292 changer transitions 259/2382 dead transitions. [2023-01-28 05:24:52,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 2382 transitions, 64047 flow [2023-01-28 05:24:52,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-01-28 05:24:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2023-01-28 05:24:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 4415 transitions. [2023-01-28 05:24:52,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2761100687929956 [2023-01-28 05:24:52,983 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 4415 transitions. [2023-01-28 05:24:52,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 4415 transitions. [2023-01-28 05:24:52,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:24:52,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 4415 transitions. [2023-01-28 05:24:52,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 67.92307692307692) internal successors, (4415), 65 states have internal predecessors, (4415), 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-28 05:24:52,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 246.0) internal successors, (16236), 66 states have internal predecessors, (16236), 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-28 05:24:52,997 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 246.0) internal successors, (16236), 66 states have internal predecessors, (16236), 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-28 05:24:52,997 INFO L175 Difference]: Start difference. First operand has 479 places, 1118 transitions, 27905 flow. Second operand 65 states and 4415 transitions. [2023-01-28 05:24:52,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 2382 transitions, 64047 flow [2023-01-28 05:25:03,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 2382 transitions, 61609 flow, removed 483 selfloop flow, removed 35 redundant places. [2023-01-28 05:25:03,141 INFO L231 Difference]: Finished difference. Result has 526 places, 1646 transitions, 44597 flow [2023-01-28 05:25:03,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=26016, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=807, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=44597, PETRI_PLACES=526, PETRI_TRANSITIONS=1646} [2023-01-28 05:25:03,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 495 predicate places. [2023-01-28 05:25:03,143 INFO L495 AbstractCegarLoop]: Abstraction has has 526 places, 1646 transitions, 44597 flow [2023-01-28 05:25:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 64.05555555555556) internal successors, (2306), 36 states have internal predecessors, (2306), 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-28 05:25:03,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:25:03,143 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:25:03,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 05:25:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:25:03,344 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 05:25:03,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:25:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 547821997, now seen corresponding path program 16 times [2023-01-28 05:25:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:25:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852215791] [2023-01-28 05:25:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:25:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:25:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:25:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:25:04,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:25:04,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852215791] [2023-01-28 05:25:04,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852215791] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:25:04,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912605753] [2023-01-28 05:25:04,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 05:25:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:25:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:25:04,691 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:25:04,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-28 05:25:04,799 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 05:25:04,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:25:04,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 05:25:04,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:25:05,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:25:05,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-28 05:25:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:25:05,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:25:05,702 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:25:05,702 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 504 treesize of output 408 [2023-01-28 05:25:05,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:25:05,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 267 [2023-01-28 05:25:05,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:25:05,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 248 [2023-01-28 05:25:05,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:25:05,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 229 [2023-01-28 05:25:05,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 05:25:05,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 210 [2023-01-28 05:25:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:25:06,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912605753] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:25:06,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:25:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 37 [2023-01-28 05:25:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119821794] [2023-01-28 05:25:06,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:25:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-28 05:25:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:25:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-28 05:25:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1239, Unknown=1, NotChecked=0, Total=1406 [2023-01-28 05:25:06,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:25:06,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 1646 transitions, 44597 flow. Second operand has 38 states, 38 states have (on average 63.921052631578945) internal successors, (2429), 38 states have internal predecessors, (2429), 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-28 05:25:06,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:25:06,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:25:06,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:25:56,078 WARN L222 SmtUtils]: Spent 46.80s on a formula simplification. DAG size of input: 88 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:26:29,437 WARN L222 SmtUtils]: Spent 32.43s on a formula simplification. DAG size of input: 65 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:26:54,550 WARN L222 SmtUtils]: Spent 14.13s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:27:04,876 WARN L222 SmtUtils]: Spent 10.18s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:27:23,152 WARN L222 SmtUtils]: Spent 18.19s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:27:40,619 WARN L222 SmtUtils]: Spent 16.24s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:27:57,386 WARN L222 SmtUtils]: Spent 16.26s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:28:17,122 WARN L222 SmtUtils]: Spent 18.25s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:28:37,659 WARN L222 SmtUtils]: Spent 20.36s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:29:00,156 WARN L222 SmtUtils]: Spent 22.22s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:29:15,787 WARN L222 SmtUtils]: Spent 14.35s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:29:35,223 WARN L222 SmtUtils]: Spent 18.24s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:29:47,645 WARN L222 SmtUtils]: Spent 12.21s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:30:02,679 WARN L222 SmtUtils]: Spent 14.20s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 05:30:04,286 INFO L130 PetriNetUnfolder]: 22141/36736 cut-off events. [2023-01-28 05:30:04,286 INFO L131 PetriNetUnfolder]: For 2757092/2757092 co-relation queries the response was YES. [2023-01-28 05:30:04,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545266 conditions, 36736 events. 22141/36736 cut-off events. For 2757092/2757092 co-relation queries the response was YES. Maximal size of possible extension queue 1351. Compared 292819 event pairs, 2498 based on Foata normal form. 104/36840 useless extension candidates. Maximal degree in co-relation 545100. Up to 14480 conditions per place. [2023-01-28 05:30:04,965 INFO L137 encePairwiseOnDemand]: 233/246 looper letters, 1385 selfloop transitions, 1511 changer transitions 316/3212 dead transitions. [2023-01-28 05:30:04,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 3212 transitions, 90505 flow [2023-01-28 05:30:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-01-28 05:30:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2023-01-28 05:30:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 5642 transitions. [2023-01-28 05:30:04,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2763248114408855 [2023-01-28 05:30:04,970 INFO L72 ComplementDD]: Start complementDD. Operand 83 states and 5642 transitions. [2023-01-28 05:30:04,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 5642 transitions. [2023-01-28 05:30:04,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:30:04,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 83 states and 5642 transitions. [2023-01-28 05:30:04,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 84 states, 83 states have (on average 67.97590361445783) internal successors, (5642), 83 states have internal predecessors, (5642), 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-28 05:30:04,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 84 states, 84 states have (on average 246.0) internal successors, (20664), 84 states have internal predecessors, (20664), 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-28 05:30:04,985 INFO L81 ComplementDD]: Finished complementDD. Result has 84 states, 84 states have (on average 246.0) internal successors, (20664), 84 states have internal predecessors, (20664), 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-28 05:30:04,985 INFO L175 Difference]: Start difference. First operand has 526 places, 1646 transitions, 44597 flow. Second operand 83 states and 5642 transitions. [2023-01-28 05:30:04,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 3212 transitions, 90505 flow [2023-01-28 05:30:29,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 3212 transitions, 84371 flow, removed 2437 selfloop flow, removed 21 redundant places. [2023-01-28 05:30:29,191 INFO L231 Difference]: Finished difference. Result has 615 places, 2298 transitions, 64166 flow [2023-01-28 05:30:29,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=41362, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=893, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=83, PETRI_FLOW=64166, PETRI_PLACES=615, PETRI_TRANSITIONS=2298} [2023-01-28 05:30:29,193 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 584 predicate places. [2023-01-28 05:30:29,193 INFO L495 AbstractCegarLoop]: Abstraction has has 615 places, 2298 transitions, 64166 flow [2023-01-28 05:30:29,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 63.921052631578945) internal successors, (2429), 38 states have internal predecessors, (2429), 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-28 05:30:29,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:30:29,194 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:30:29,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-28 05:30:29,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:30:29,398 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 05:30:29,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:30:29,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1324359769, now seen corresponding path program 17 times [2023-01-28 05:30:29,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:30:29,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114011606] [2023-01-28 05:30:29,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:30:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:30:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:30:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:30:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:30:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114011606] [2023-01-28 05:30:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114011606] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:30:30,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926987050] [2023-01-28 05:30:30,567 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 05:30:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:30:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:30:30,568 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:30:30,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-28 05:30:30,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 05:30:30,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:30:30,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 05:30:30,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:30:30,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:30:30,943 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 32 treesize of output 32 [2023-01-28 05:30:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:30:31,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:30:31,123 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_958 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_958) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_958) c_~queue~0.base) .cse0)))))) is different from false [2023-01-28 05:30:31,391 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:30:31,392 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-28 05:30:31,399 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-28 05:30:31,406 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-28 05:30:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 05:30:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926987050] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:30:31,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:30:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2023-01-28 05:30:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492977970] [2023-01-28 05:30:31,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:30:31,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-28 05:30:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:30:31,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-28 05:30:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1044, Unknown=2, NotChecked=66, Total=1260 [2023-01-28 05:30:31,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 246 [2023-01-28 05:30:31,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 2298 transitions, 64166 flow. Second operand has 36 states, 36 states have (on average 64.02777777777777) internal successors, (2305), 36 states have internal predecessors, (2305), 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-28 05:30:31,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:30:31,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 246 [2023-01-28 05:30:31,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:30:36,461 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse2 (forall ((v_ArrVal_958 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_958) c_~queue~0.base) .cse4)) 1))) (.cse3 (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_958) c_~queue~0.base) .cse4)))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 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))))) (and .cse2 .cse3)) .cse2 (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) .cse3))) is different from false [2023-01-28 05:30:40,677 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse2 (forall ((v_ArrVal_958 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_958) c_~queue~0.base) .cse4)) 1))) (.cse3 (forall ((v_ArrVal_958 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_958) c_~queue~0.base) .cse4)))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (<= |c_thread1Thread1of1ForFork2_~cond~0#1| 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))))) (and .cse2 .cse3)) .cse2 (<= (div |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) .cse3))) is different from false [2023-01-28 05:31:10,590 INFO L130 PetriNetUnfolder]: 32325/52419 cut-off events. [2023-01-28 05:31:10,590 INFO L131 PetriNetUnfolder]: For 4791812/4791812 co-relation queries the response was YES. [2023-01-28 05:31:11,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836331 conditions, 52419 events. 32325/52419 cut-off events. For 4791812/4791812 co-relation queries the response was YES. Maximal size of possible extension queue 2212. Compared 430336 event pairs, 2070 based on Foata normal form. 988/53407 useless extension candidates. Maximal degree in co-relation 836138. Up to 22882 conditions per place. [2023-01-28 05:31:12,325 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 993 selfloop transitions, 2334 changer transitions 933/4260 dead transitions. [2023-01-28 05:31:12,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 4260 transitions, 134650 flow [2023-01-28 05:31:12,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-01-28 05:31:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-01-28 05:31:12,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 4947 transitions. [2023-01-28 05:31:12,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2754761109254928 [2023-01-28 05:31:12,330 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 4947 transitions. [2023-01-28 05:31:12,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 4947 transitions. [2023-01-28 05:31:12,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:31:12,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 4947 transitions. [2023-01-28 05:31:12,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 67.76712328767124) internal successors, (4947), 73 states have internal predecessors, (4947), 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-28 05:31:12,342 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-28 05:31:12,343 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-28 05:31:12,343 INFO L175 Difference]: Start difference. First operand has 615 places, 2298 transitions, 64166 flow. Second operand 73 states and 4947 transitions. [2023-01-28 05:31:12,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 4260 transitions, 134650 flow [2023-01-28 05:31:59,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 4260 transitions, 129318 flow, removed 1563 selfloop flow, removed 38 redundant places. [2023-01-28 05:31:59,707 INFO L231 Difference]: Finished difference. Result has 663 places, 2963 transitions, 95085 flow [2023-01-28 05:31:59,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=56513, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2095, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=95085, PETRI_PLACES=663, PETRI_TRANSITIONS=2963} [2023-01-28 05:31:59,709 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 632 predicate places. [2023-01-28 05:31:59,709 INFO L495 AbstractCegarLoop]: Abstraction has has 663 places, 2963 transitions, 95085 flow [2023-01-28 05:31:59,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 64.02777777777777) internal successors, (2305), 36 states have internal predecessors, (2305), 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-28 05:31:59,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:31:59,709 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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-28 05:31:59,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-28 05:31:59,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:31:59,910 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 05:31:59,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:31:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1227971517, now seen corresponding path program 18 times [2023-01-28 05:31:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:31:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339407701] [2023-01-28 05:31:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:31:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:31:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:32:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:32:00,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:32:00,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339407701] [2023-01-28 05:32:00,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339407701] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:32:00,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084454956] [2023-01-28 05:32:00,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 05:32:00,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:32:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:32:00,791 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:32:00,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-28 05:32:00,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-28 05:32:00,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 05:32:00,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 05:32:00,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:32:01,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 05:32:01,209 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 32 treesize of output 32 [2023-01-28 05:32:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 05:32:01,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:32:01,397 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1011 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1011 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse0)))))) is different from false [2023-01-28 05:32:01,406 WARN L839 $PredicateComparison]: unable to prove that (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_1011 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1011 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse1))))))) is different from false [2023-01-28 05:32:01,534 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))))) (= (mod c_~v_assert~0 256) 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_1011 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_1011 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse4))))))))) is different from false [2023-01-28 05:32:01,645 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-28 05:32:01,646 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-28 05:32:01,654 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-28 05:32:01,661 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-28 05:32:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 4 not checked. [2023-01-28 05:32:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084454956] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:32:02,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:32:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2023-01-28 05:32:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705321051] [2023-01-28 05:32:02,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:32:02,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 05:32:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:32:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 05:32:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=968, Unknown=11, NotChecked=198, Total=1332 [2023-01-28 05:32:02,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 246 [2023-01-28 05:32:02,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 2963 transitions, 95085 flow. Second operand has 37 states, 37 states have (on average 70.13513513513513) internal successors, (2595), 37 states have internal predecessors, (2595), 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-28 05:32:02,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:32:02,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 246 [2023-01-28 05:32:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 05:32:04,554 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse7 (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse6) (not (= (+ .cse7 1) 0))) (or .cse6 (not (= .cse7 1)))))) (.cse1 (let ((.cse4 (* c_~front~0 4))) (let ((.cse2 (select .cse5 (+ c_~queue~0.offset .cse4))) (.cse3 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_1011 (Array Int Int))) (<= (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_1011 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse3))))))))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse0 .cse1 (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0)) (or .cse0 (= (mod c_~v_assert~0 256) 0) .cse1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2023-01-28 05:32:05,107 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~v_assert~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))))) (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_1011 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_1011 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse4))))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0))) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= 1 c_~v_assert~0)) is different from false [2023-01-28 05:32:24,944 WARN L839 $PredicateComparison]: unable to prove that (and (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))))) (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_1011 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_1011 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1011) c_~queue~0.base) .cse4))))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0))) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|)) is different from false [2023-01-28 05:32:54,797 INFO L130 PetriNetUnfolder]: 38648/63344 cut-off events. [2023-01-28 05:32:54,797 INFO L131 PetriNetUnfolder]: For 9686411/9686411 co-relation queries the response was YES. [2023-01-28 05:32:56,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311680 conditions, 63344 events. 38648/63344 cut-off events. For 9686411/9686411 co-relation queries the response was YES. Maximal size of possible extension queue 2940. Compared 545750 event pairs, 2787 based on Foata normal form. 248/63592 useless extension candidates. Maximal degree in co-relation 1311460. Up to 30241 conditions per place. [2023-01-28 05:32:57,329 INFO L137 encePairwiseOnDemand]: 231/246 looper letters, 2310 selfloop transitions, 2251 changer transitions 496/5057 dead transitions. [2023-01-28 05:32:57,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 5057 transitions, 175291 flow [2023-01-28 05:32:57,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-01-28 05:32:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-01-28 05:32:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 4291 transitions. [2023-01-28 05:32:57,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30074292122231566 [2023-01-28 05:32:57,332 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 4291 transitions. [2023-01-28 05:32:57,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 4291 transitions. [2023-01-28 05:32:57,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 05:32:57,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 4291 transitions. [2023-01-28 05:32:57,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 73.98275862068965) internal successors, (4291), 58 states have internal predecessors, (4291), 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-28 05:32:57,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 246.0) internal successors, (14514), 59 states have internal predecessors, (14514), 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-28 05:32:57,343 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 246.0) internal successors, (14514), 59 states have internal predecessors, (14514), 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-28 05:32:57,343 INFO L175 Difference]: Start difference. First operand has 663 places, 2963 transitions, 95085 flow. Second operand 58 states and 4291 transitions. [2023-01-28 05:32:57,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 5057 transitions, 175291 flow [2023-01-28 05:35:37,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 5057 transitions, 166125 flow, removed 3962 selfloop flow, removed 41 redundant places. [2023-01-28 05:35:37,116 INFO L231 Difference]: Finished difference. Result has 682 places, 3504 transitions, 114662 flow [2023-01-28 05:35:37,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=89471, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1737, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=963, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=114662, PETRI_PLACES=682, PETRI_TRANSITIONS=3504} [2023-01-28 05:35:37,119 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 651 predicate places. [2023-01-28 05:35:37,119 INFO L495 AbstractCegarLoop]: Abstraction has has 682 places, 3504 transitions, 114662 flow [2023-01-28 05:35:37,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 70.13513513513513) internal successors, (2595), 37 states have internal predecessors, (2595), 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-28 05:35:37,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 05:35:37,119 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 05:35:37,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-01-28 05:35:37,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:35:37,325 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 05:35:37,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 05:35:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1222989133, now seen corresponding path program 19 times [2023-01-28 05:35:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 05:35:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104311129] [2023-01-28 05:35:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 05:35:37,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 05:35:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:35:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:35:37,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 05:35:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104311129] [2023-01-28 05:35:37,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104311129] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 05:35:37,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597977847] [2023-01-28 05:35:37,476 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 05:35:37,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:35:37,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 05:35:37,477 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 05:35:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-28 05:35:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 05:35:37,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-28 05:35:37,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 05:35:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:35:37,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 05:35:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 05:35:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597977847] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 05:35:37,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 05:35:37,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-01-28 05:35:37,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602908726] [2023-01-28 05:35:37,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 05:35:37,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 05:35:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 05:35:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 05:35:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2023-01-28 05:35:37,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 246 [2023-01-28 05:35:37,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 3504 transitions, 114662 flow. Second operand has 24 states, 24 states have (on average 102.375) internal successors, (2457), 24 states have internal predecessors, (2457), 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-28 05:35:37,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 05:35:37,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 246 [2023-01-28 05:35:37,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-01-28 05:35:47,304 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 05:35:47,304 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-28 05:35:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 05:35:47,449 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 05:35:47,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-28 05:35:47,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 05:35:47,649 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 100/246 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 219110 conditions, 10291 events (5362/10290 cut-off events. For 2110938/2113252 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 103817 event pairs, 1065 based on Foata normal form. 226/12818 useless extension candidates. Maximal degree in co-relation 218876. Up to 4716 conditions per place.). [2023-01-28 05:35:47,651 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 05:35:47,651 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 05:35:47,651 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 05:35:47,651 INFO L445 BasicCegarLoop]: Path program histogram: [19, 3, 1, 1] [2023-01-28 05:35:47,653 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 05:35:47,653 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 05:35:47,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 05:35:47 BasicIcfg [2023-01-28 05:35:47,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 05:35:47,655 INFO L158 Benchmark]: Toolchain (without parser) took 825629.63ms. Allocated memory was 312.5MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 257.3MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-01-28 05:35:47,655 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 255.9MB. Free memory is still 212.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 05:35:47,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.73ms. Allocated memory is still 312.5MB. Free memory was 257.2MB in the beginning and 289.5MB in the end (delta: -32.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.0GB. [2023-01-28 05:35:47,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.82ms. Allocated memory is still 312.5MB. Free memory was 289.5MB in the beginning and 287.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:35:47,656 INFO L158 Benchmark]: Boogie Preprocessor took 17.99ms. Allocated memory is still 312.5MB. Free memory was 287.8MB in the beginning and 285.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 05:35:47,656 INFO L158 Benchmark]: RCFGBuilder took 516.64ms. Allocated memory is still 312.5MB. Free memory was 285.7MB in the beginning and 262.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-01-28 05:35:47,656 INFO L158 Benchmark]: TraceAbstraction took 824854.55ms. Allocated memory was 312.5MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 262.2MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-01-28 05:35:47,657 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.15ms. Allocated memory is still 255.9MB. Free memory is still 212.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 211.73ms. Allocated memory is still 312.5MB. Free memory was 257.2MB in the beginning and 289.5MB in the end (delta: -32.3MB). Peak memory consumption was 16.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.82ms. Allocated memory is still 312.5MB. Free memory was 289.5MB in the beginning and 287.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 17.99ms. Allocated memory is still 312.5MB. Free memory was 287.8MB in the beginning and 285.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 516.64ms. Allocated memory is still 312.5MB. Free memory was 285.7MB in the beginning and 262.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 824854.55ms. Allocated memory was 312.5MB in the beginning and 11.3GB in the end (delta: 11.0GB). Free memory was 262.2MB in the beginning and 3.8GB in the end (delta: -3.5GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 100/246 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 219110 conditions, 10291 events (5362/10290 cut-off events. For 2110938/2113252 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 103817 event pairs, 1065 based on Foata normal form. 226/12818 useless extension candidates. Maximal degree in co-relation 218876. Up to 4716 conditions per place.). - 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 100/246 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 219110 conditions, 10291 events (5362/10290 cut-off events. For 2110938/2113252 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 103817 event pairs, 1065 based on Foata normal form. 226/12818 useless extension candidates. Maximal degree in co-relation 218876. Up to 4716 conditions per place.). - 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 100/246 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 219110 conditions, 10291 events (5362/10290 cut-off events. For 2110938/2113252 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 103817 event pairs, 1065 based on Foata normal form. 226/12818 useless extension candidates. Maximal degree in co-relation 218876. Up to 4716 conditions per place.). - 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 CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 100/246 universal loopers) in iteration 24,while PetriNetUnfolder was constructing finite prefix that currently has 219110 conditions, 10291 events (5362/10290 cut-off events. For 2110938/2113252 co-relation queries the response was YES. Maximal size of possible extension queue 2433. Compared 103817 event pairs, 1065 based on Foata normal form. 226/12818 useless extension candidates. Maximal degree in co-relation 218876. Up to 4716 conditions per place.). - 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: 824.7s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 774.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 456 mSolverCounterUnknown, 8299 SdHoareTripleChecker+Valid, 15.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8299 mSDsluCounter, 370 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10803 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 809 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22097 IncrementalHoareTripleChecker+Invalid, 34165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 809 mSolverCounterUnsat, 11 mSDtfsCounter, 22097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 669 SyntacticMatches, 70 SemanticMatches, 1314 ConstructedPredicates, 45 IntricatePredicates, 1 DeprecatedPredicates, 27960 ImplicationChecksByTransitivity, 351.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114662occurred in iteration=23, InterpolantAutomatonStates: 929, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 40.3s InterpolantComputationTime, 1153 NumberOfCodeBlocks, 1151 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 1592 ConstructedInterpolants, 60 QuantifiedInterpolants, 32008 SizeOfPredicates, 441 NumberOfNonLiveVariables, 4634 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 61 InterpolantComputations, 6 PerfectInterpolantSequences, 195/546 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