/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 23:06:04,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 23:06:04,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 23:06:04,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 23:06:04,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 23:06:04,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 23:06:04,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 23:06:04,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 23:06:04,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 23:06:04,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 23:06:04,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 23:06:04,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 23:06:04,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 23:06:04,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 23:06:04,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 23:06:04,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 23:06:04,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 23:06:04,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 23:06:04,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 23:06:04,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 23:06:04,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 23:06:04,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 23:06:04,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 23:06:04,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 23:06:04,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 23:06:04,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 23:06:04,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 23:06:04,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 23:06:04,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 23:06:04,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 23:06:04,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 23:06:04,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 23:06:04,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 23:06:04,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 23:06:04,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 23:06:04,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 23:06:04,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 23:06:04,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 23:06:04,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 23:06:04,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 23:06:04,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 23:06:04,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 23:06:04,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 23:06:04,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 23:06:04,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 23:06:04,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 23:06:04,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 23:06:04,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 23:06:04,575 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 23:06:04,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 23:06:04,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 23:06:04,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 23:06:04,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 23:06:04,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 23:06:04,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 23:06:04,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 23:06:04,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 23:06:04,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 23:06:04,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 23:06:04,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 23:06:04,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 23:06:04,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 23:06:04,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 23:06:04,578 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 23:06:04,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 23:06:04,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:06:04,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 23:06:04,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 23:06:04,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 23:06:04,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 23:06:04,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 23:06:04,580 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 23:06:04,580 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 23:06:04,580 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 23:06:04,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 23:06:04,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 23:06:04,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 23:06:04,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 23:06:04,833 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 23:06:04,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-09-20 23:06:04,893 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562731426/24daa56d2a674756848d67c199c08972/FLAGbd64073af [2022-09-20 23:06:05,255 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 23:06:05,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-09-20 23:06:05,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562731426/24daa56d2a674756848d67c199c08972/FLAGbd64073af [2022-09-20 23:06:05,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/562731426/24daa56d2a674756848d67c199c08972 [2022-09-20 23:06:05,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 23:06:05,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 23:06:05,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 23:06:05,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 23:06:05,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 23:06:05,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d863b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05, skipping insertion in model container [2022-09-20 23:06:05,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 23:06:05,327 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 23:06:05,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-09-20 23:06:05,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:06:05,499 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 23:06:05,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-09-20 23:06:05,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:06:05,532 INFO L208 MainTranslator]: Completed translation [2022-09-20 23:06:05,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05 WrapperNode [2022-09-20 23:06:05,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 23:06:05,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 23:06:05,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 23:06:05,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 23:06:05,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,575 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2022-09-20 23:06:05,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 23:06:05,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 23:06:05,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 23:06:05,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 23:06:05,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 23:06:05,606 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 23:06:05,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 23:06:05,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 23:06:05,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (1/1) ... [2022-09-20 23:06:05,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:06:05,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:06:05,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 23:06:05,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 23:06:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 23:06:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 23:06:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 23:06:05,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 23:06:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 23:06:05,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 23:06:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 23:06:05,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 23:06:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 23:06:05,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 23:06:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 23:06:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 23:06:05,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 23:06:05,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 23:06:05,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 23:06:05,679 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 23:06:05,761 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 23:06:05,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 23:06:06,149 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 23:06:06,173 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 23:06:06,174 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-09-20 23:06:06,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:06:06 BoogieIcfgContainer [2022-09-20 23:06:06,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 23:06:06,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 23:06:06,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 23:06:06,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 23:06:06,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:06:05" (1/3) ... [2022-09-20 23:06:06,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18309d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:06:06, skipping insertion in model container [2022-09-20 23:06:06,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:06:05" (2/3) ... [2022-09-20 23:06:06,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18309d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:06:06, skipping insertion in model container [2022-09-20 23:06:06,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:06:06" (3/3) ... [2022-09-20 23:06:06,187 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-09-20 23:06:06,203 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 23:06:06,203 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 23:06:06,203 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 23:06:06,337 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 23:06:06,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 349 places, 368 transitions, 760 flow [2022-09-20 23:06:06,587 INFO L130 PetriNetUnfolder]: 29/365 cut-off events. [2022-09-20 23:06:06,587 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:06:06,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 365 events. 29/365 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 517 event pairs, 0 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 239. Up to 2 conditions per place. [2022-09-20 23:06:06,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 349 places, 368 transitions, 760 flow [2022-09-20 23:06:06,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 335 places, 354 transitions, 726 flow [2022-09-20 23:06:06,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 23:06:06,630 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;@6f0b2da8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 23:06:06,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 23:06:06,693 INFO L130 PetriNetUnfolder]: 28/347 cut-off events. [2022-09-20 23:06:06,694 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:06:06,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:06,694 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:06,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:06,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2024890432, now seen corresponding path program 1 times [2022-09-20 23:06:06,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:06,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528144654] [2022-09-20 23:06:06,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:06:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528144654] [2022-09-20 23:06:07,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528144654] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:06:07,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:06:07,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 23:06:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705335690] [2022-09-20 23:06:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:07,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 23:06:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:07,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 23:06:07,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 23:06:07,107 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 368 [2022-09-20 23:06:07,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 354 transitions, 726 flow. Second operand has 2 states, 2 states have (on average 343.0) internal successors, (686), 2 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:07,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:07,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 368 [2022-09-20 23:06:07,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:07,198 INFO L130 PetriNetUnfolder]: 6/331 cut-off events. [2022-09-20 23:06:07,198 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-09-20 23:06:07,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 331 events. 6/331 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 29/337 useless extension candidates. Maximal degree in co-relation 226. Up to 7 conditions per place. [2022-09-20 23:06:07,204 INFO L137 encePairwiseOnDemand]: 345/368 looper letters, 6 selfloop transitions, 0 changer transitions 9/331 dead transitions. [2022-09-20 23:06:07,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 331 transitions, 692 flow [2022-09-20 23:06:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 23:06:07,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 23:06:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 705 transitions. [2022-09-20 23:06:07,221 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9578804347826086 [2022-09-20 23:06:07,222 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 705 transitions. [2022-09-20 23:06:07,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 705 transitions. [2022-09-20 23:06:07,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:07,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 705 transitions. [2022-09-20 23:06:07,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 352.5) internal successors, (705), 2 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:07,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:07,241 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:07,243 INFO L175 Difference]: Start difference. First operand has 335 places, 354 transitions, 726 flow. Second operand 2 states and 705 transitions. [2022-09-20 23:06:07,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 331 transitions, 692 flow [2022-09-20 23:06:07,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 331 transitions, 680 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 23:06:07,255 INFO L231 Difference]: Finished difference. Result has 330 places, 322 transitions, 650 flow [2022-09-20 23:06:07,258 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=650, PETRI_PLACES=330, PETRI_TRANSITIONS=322} [2022-09-20 23:06:07,263 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, -5 predicate places. [2022-09-20 23:06:07,263 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 322 transitions, 650 flow [2022-09-20 23:06:07,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 343.0) internal successors, (686), 2 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:07,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:07,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:07,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 23:06:07,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:07,266 INFO L85 PathProgramCache]: Analyzing trace with hash 364182754, now seen corresponding path program 1 times [2022-09-20 23:06:07,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:07,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670511645] [2022-09-20 23:06:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:07,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:06:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:07,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670511645] [2022-09-20 23:06:07,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670511645] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:06:07,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:06:07,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 23:06:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80113968] [2022-09-20 23:06:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:07,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 23:06:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 23:06:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-09-20 23:06:07,832 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 368 [2022-09-20 23:06:07,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 322 transitions, 650 flow. Second operand has 12 states, 12 states have (on average 278.5833333333333) internal successors, (3343), 12 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:07,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:07,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 368 [2022-09-20 23:06:07,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:08,730 INFO L130 PetriNetUnfolder]: 189/2612 cut-off events. [2022-09-20 23:06:08,733 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-09-20 23:06:08,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3031 conditions, 2612 events. 189/2612 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 19496 event pairs, 34 based on Foata normal form. 1/2422 useless extension candidates. Maximal degree in co-relation 3028. Up to 155 conditions per place. [2022-09-20 23:06:08,762 INFO L137 encePairwiseOnDemand]: 354/368 looper letters, 123 selfloop transitions, 9 changer transitions 20/413 dead transitions. [2022-09-20 23:06:08,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 413 transitions, 1148 flow [2022-09-20 23:06:08,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-09-20 23:06:08,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-09-20 23:06:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3441 transitions. [2022-09-20 23:06:08,770 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7792119565217391 [2022-09-20 23:06:08,770 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3441 transitions. [2022-09-20 23:06:08,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3441 transitions. [2022-09-20 23:06:08,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:08,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3441 transitions. [2022-09-20 23:06:08,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 286.75) internal successors, (3441), 12 states have internal predecessors, (3441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:08,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 368.0) internal successors, (4784), 13 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:08,793 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 368.0) internal successors, (4784), 13 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:08,793 INFO L175 Difference]: Start difference. First operand has 330 places, 322 transitions, 650 flow. Second operand 12 states and 3441 transitions. [2022-09-20 23:06:08,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 413 transitions, 1148 flow [2022-09-20 23:06:08,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 413 transitions, 1148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 23:06:08,803 INFO L231 Difference]: Finished difference. Result has 341 places, 328 transitions, 713 flow [2022-09-20 23:06:08,804 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=713, PETRI_PLACES=341, PETRI_TRANSITIONS=328} [2022-09-20 23:06:08,805 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2022-09-20 23:06:08,805 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 328 transitions, 713 flow [2022-09-20 23:06:08,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 278.5833333333333) internal successors, (3343), 12 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:08,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:08,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:08,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 23:06:08,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:08,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash -127580788, now seen corresponding path program 1 times [2022-09-20 23:06:08,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:08,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138036851] [2022-09-20 23:06:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:06:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:08,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138036851] [2022-09-20 23:06:08,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138036851] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:06:08,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:06:08,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 23:06:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946832950] [2022-09-20 23:06:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:08,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:06:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:08,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:06:08,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 23:06:08,979 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-09-20 23:06:08,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 328 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:08,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:08,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-09-20 23:06:08,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:10,372 INFO L130 PetriNetUnfolder]: 994/5924 cut-off events. [2022-09-20 23:06:10,372 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-09-20 23:06:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7857 conditions, 5924 events. 994/5924 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 51029 event pairs, 395 based on Foata normal form. 0/5002 useless extension candidates. Maximal degree in co-relation 7844. Up to 852 conditions per place. [2022-09-20 23:06:10,435 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 113 selfloop transitions, 28 changer transitions 0/415 dead transitions. [2022-09-20 23:06:10,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 415 transitions, 1185 flow [2022-09-20 23:06:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:06:10,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:06:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3333 transitions. [2022-09-20 23:06:10,446 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8233695652173914 [2022-09-20 23:06:10,446 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3333 transitions. [2022-09-20 23:06:10,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3333 transitions. [2022-09-20 23:06:10,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:10,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3333 transitions. [2022-09-20 23:06:10,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:10,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:10,466 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:10,466 INFO L175 Difference]: Start difference. First operand has 341 places, 328 transitions, 713 flow. Second operand 11 states and 3333 transitions. [2022-09-20 23:06:10,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 415 transitions, 1185 flow [2022-09-20 23:06:10,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 415 transitions, 1171 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-09-20 23:06:10,476 INFO L231 Difference]: Finished difference. Result has 341 places, 345 transitions, 832 flow [2022-09-20 23:06:10,477 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=832, PETRI_PLACES=341, PETRI_TRANSITIONS=345} [2022-09-20 23:06:10,477 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 6 predicate places. [2022-09-20 23:06:10,478 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 345 transitions, 832 flow [2022-09-20 23:06:10,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:10,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:10,479 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:10,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 23:06:10,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:10,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:10,480 INFO L85 PathProgramCache]: Analyzing trace with hash 792017944, now seen corresponding path program 1 times [2022-09-20 23:06:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:10,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747958094] [2022-09-20 23:06:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:06:10,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:10,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747958094] [2022-09-20 23:06:10,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747958094] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:06:10,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:06:10,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 23:06:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903200102] [2022-09-20 23:06:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:10,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:06:10,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:10,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:06:10,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 23:06:10,601 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-09-20 23:06:10,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 345 transitions, 832 flow. Second operand has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:10,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:10,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-09-20 23:06:10,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:11,774 INFO L130 PetriNetUnfolder]: 821/5478 cut-off events. [2022-09-20 23:06:11,775 INFO L131 PetriNetUnfolder]: For 564/600 co-relation queries the response was YES. [2022-09-20 23:06:11,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7311 conditions, 5478 events. 821/5478 cut-off events. For 564/600 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 46470 event pairs, 507 based on Foata normal form. 36/4847 useless extension candidates. Maximal degree in co-relation 7300. Up to 965 conditions per place. [2022-09-20 23:06:11,837 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 109 selfloop transitions, 28 changer transitions 0/413 dead transitions. [2022-09-20 23:06:11,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 413 transitions, 1274 flow [2022-09-20 23:06:11,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:06:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:06:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3329 transitions. [2022-09-20 23:06:11,846 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8223814229249012 [2022-09-20 23:06:11,846 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3329 transitions. [2022-09-20 23:06:11,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3329 transitions. [2022-09-20 23:06:11,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:11,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3329 transitions. [2022-09-20 23:06:11,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 302.6363636363636) internal successors, (3329), 11 states have internal predecessors, (3329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:11,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:11,865 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:11,865 INFO L175 Difference]: Start difference. First operand has 341 places, 345 transitions, 832 flow. Second operand 11 states and 3329 transitions. [2022-09-20 23:06:11,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 413 transitions, 1274 flow [2022-09-20 23:06:11,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 413 transitions, 1269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 23:06:11,876 INFO L231 Difference]: Finished difference. Result has 351 places, 347 transitions, 895 flow [2022-09-20 23:06:11,876 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=895, PETRI_PLACES=351, PETRI_TRANSITIONS=347} [2022-09-20 23:06:11,877 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 16 predicate places. [2022-09-20 23:06:11,877 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 347 transitions, 895 flow [2022-09-20 23:06:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 295.7142857142857) internal successors, (2070), 7 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:11,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:11,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:11,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 23:06:11,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:11,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2099080781, now seen corresponding path program 1 times [2022-09-20 23:06:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:11,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335517679] [2022-09-20 23:06:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:06:12,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:12,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335517679] [2022-09-20 23:06:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335517679] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:06:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219016213] [2022-09-20 23:06:12,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:06:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:06:12,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:06:12,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-20 23:06:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:12,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:06:12,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:06:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:06:12,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:06:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:06:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219016213] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:06:12,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:06:12,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-09-20 23:06:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682475882] [2022-09-20 23:06:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:12,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:06:12,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:12,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:06:12,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:06:12,771 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 368 [2022-09-20 23:06:12,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 347 transitions, 895 flow. Second operand has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:12,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:12,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 368 [2022-09-20 23:06:12,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:14,448 INFO L130 PetriNetUnfolder]: 1271/9246 cut-off events. [2022-09-20 23:06:14,449 INFO L131 PetriNetUnfolder]: For 1679/1919 co-relation queries the response was YES. [2022-09-20 23:06:14,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12456 conditions, 9246 events. 1271/9246 cut-off events. For 1679/1919 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 92737 event pairs, 256 based on Foata normal form. 239/8806 useless extension candidates. Maximal degree in co-relation 12443. Up to 1314 conditions per place. [2022-09-20 23:06:14,508 INFO L137 encePairwiseOnDemand]: 352/368 looper letters, 99 selfloop transitions, 17 changer transitions 0/391 dead transitions. [2022-09-20 23:06:14,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 391 transitions, 1251 flow [2022-09-20 23:06:14,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 23:06:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 23:06:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2402 transitions. [2022-09-20 23:06:14,514 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8158967391304348 [2022-09-20 23:06:14,514 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2402 transitions. [2022-09-20 23:06:14,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2402 transitions. [2022-09-20 23:06:14,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:14,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2402 transitions. [2022-09-20 23:06:14,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 300.25) internal successors, (2402), 8 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:14,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 368.0) internal successors, (3312), 9 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:14,526 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 368.0) internal successors, (3312), 9 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:14,527 INFO L175 Difference]: Start difference. First operand has 351 places, 347 transitions, 895 flow. Second operand 8 states and 2402 transitions. [2022-09-20 23:06:14,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 391 transitions, 1251 flow [2022-09-20 23:06:14,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 391 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-20 23:06:14,536 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 985 flow [2022-09-20 23:06:14,536 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=985, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2022-09-20 23:06:14,537 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 23 predicate places. [2022-09-20 23:06:14,537 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 985 flow [2022-09-20 23:06:14,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:14,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:14,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:14,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-20 23:06:14,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:06:14,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1727562584, now seen corresponding path program 1 times [2022-09-20 23:06:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794999495] [2022-09-20 23:06:14,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:14,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:06:14,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:14,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794999495] [2022-09-20 23:06:14,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794999495] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:06:14,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:06:14,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 23:06:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239209379] [2022-09-20 23:06:14,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:14,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:06:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:06:14,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-09-20 23:06:14,877 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 368 [2022-09-20 23:06:14,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 985 flow. Second operand has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:14,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:14,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 368 [2022-09-20 23:06:14,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:16,062 INFO L130 PetriNetUnfolder]: 927/5714 cut-off events. [2022-09-20 23:06:16,063 INFO L131 PetriNetUnfolder]: For 1754/1799 co-relation queries the response was YES. [2022-09-20 23:06:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8598 conditions, 5714 events. 927/5714 cut-off events. For 1754/1799 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 49315 event pairs, 655 based on Foata normal form. 65/5343 useless extension candidates. Maximal degree in co-relation 8580. Up to 1322 conditions per place. [2022-09-20 23:06:16,108 INFO L137 encePairwiseOnDemand]: 349/368 looper letters, 56 selfloop transitions, 14 changer transitions 74/415 dead transitions. [2022-09-20 23:06:16,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 415 transitions, 1426 flow [2022-09-20 23:06:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:06:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:06:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3293 transitions. [2022-09-20 23:06:16,116 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8134881422924901 [2022-09-20 23:06:16,116 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3293 transitions. [2022-09-20 23:06:16,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3293 transitions. [2022-09-20 23:06:16,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:16,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3293 transitions. [2022-09-20 23:06:16,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 299.3636363636364) internal successors, (3293), 11 states have internal predecessors, (3293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:16,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:16,130 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 368.0) internal successors, (4416), 12 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:16,130 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 985 flow. Second operand 11 states and 3293 transitions. [2022-09-20 23:06:16,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 415 transitions, 1426 flow [2022-09-20 23:06:16,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 415 transitions, 1425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 23:06:16,140 INFO L231 Difference]: Finished difference. Result has 370 places, 333 transitions, 849 flow [2022-09-20 23:06:16,140 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=849, PETRI_PLACES=370, PETRI_TRANSITIONS=333} [2022-09-20 23:06:16,141 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 35 predicate places. [2022-09-20 23:06:16,141 INFO L495 AbstractCegarLoop]: Abstraction has has 370 places, 333 transitions, 849 flow [2022-09-20 23:06:16,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:16,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:16,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:16,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 23:06:16,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:16,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 565998781, now seen corresponding path program 1 times [2022-09-20 23:06:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:16,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412105261] [2022-09-20 23:06:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:16,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:06:16,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:16,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412105261] [2022-09-20 23:06:16,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412105261] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:06:16,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981003396] [2022-09-20 23:06:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:16,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:06:16,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:06:16,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:06:16,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-20 23:06:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:16,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:06:16,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:06:16,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:06:16,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:06:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-09-20 23:06:16,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981003396] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:06:16,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:06:16,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-09-20 23:06:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307044068] [2022-09-20 23:06:16,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:06:16,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:06:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:06:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:06:16,765 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-09-20 23:06:16,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 333 transitions, 849 flow. Second operand has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:16,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:16,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-09-20 23:06:16,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:17,343 INFO L130 PetriNetUnfolder]: 453/2812 cut-off events. [2022-09-20 23:06:17,343 INFO L131 PetriNetUnfolder]: For 1082/1169 co-relation queries the response was YES. [2022-09-20 23:06:17,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4391 conditions, 2812 events. 453/2812 cut-off events. For 1082/1169 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 18228 event pairs, 74 based on Foata normal form. 113/2634 useless extension candidates. Maximal degree in co-relation 4369. Up to 401 conditions per place. [2022-09-20 23:06:17,369 INFO L137 encePairwiseOnDemand]: 360/368 looper letters, 60 selfloop transitions, 7 changer transitions 0/341 dead transitions. [2022-09-20 23:06:17,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 341 transitions, 1021 flow [2022-09-20 23:06:17,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 23:06:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 23:06:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2093 transitions. [2022-09-20 23:06:17,374 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8125 [2022-09-20 23:06:17,374 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2093 transitions. [2022-09-20 23:06:17,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2093 transitions. [2022-09-20 23:06:17,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:17,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2093 transitions. [2022-09-20 23:06:17,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:17,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:17,382 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:17,382 INFO L175 Difference]: Start difference. First operand has 370 places, 333 transitions, 849 flow. Second operand 7 states and 2093 transitions. [2022-09-20 23:06:17,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 341 transitions, 1021 flow [2022-09-20 23:06:17,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 910 flow, removed 21 selfloop flow, removed 22 redundant places. [2022-09-20 23:06:17,389 INFO L231 Difference]: Finished difference. Result has 342 places, 334 transitions, 778 flow [2022-09-20 23:06:17,390 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=778, PETRI_PLACES=342, PETRI_TRANSITIONS=334} [2022-09-20 23:06:17,391 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 7 predicate places. [2022-09-20 23:06:17,391 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 334 transitions, 778 flow [2022-09-20 23:06:17,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 297.0) internal successors, (2079), 7 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:17,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:17,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:17,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-20 23:06:17,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-09-20 23:06:17,615 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1056775923, now seen corresponding path program 1 times [2022-09-20 23:06:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:17,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511254624] [2022-09-20 23:06:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:17,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:06:17,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:17,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511254624] [2022-09-20 23:06:17,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511254624] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:06:17,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466469586] [2022-09-20 23:06:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:17,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:06:17,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:06:17,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:06:17,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-20 23:06:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:17,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:06:17,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:06:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:06:18,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:06:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:06:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466469586] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:06:18,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:06:18,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-09-20 23:06:18,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594458123] [2022-09-20 23:06:18,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:06:18,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-09-20 23:06:18,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:06:18,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-09-20 23:06:18,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:06:18,430 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 368 [2022-09-20 23:06:18,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 334 transitions, 778 flow. Second operand has 14 states, 14 states have (on average 294.85714285714283) internal successors, (4128), 14 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:18,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:06:18,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 368 [2022-09-20 23:06:18,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:06:19,212 INFO L130 PetriNetUnfolder]: 444/4201 cut-off events. [2022-09-20 23:06:19,212 INFO L131 PetriNetUnfolder]: For 677/898 co-relation queries the response was YES. [2022-09-20 23:06:19,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5616 conditions, 4201 events. 444/4201 cut-off events. For 677/898 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 34757 event pairs, 135 based on Foata normal form. 220/4093 useless extension candidates. Maximal degree in co-relation 5604. Up to 257 conditions per place. [2022-09-20 23:06:19,240 INFO L137 encePairwiseOnDemand]: 351/368 looper letters, 71 selfloop transitions, 17 changer transitions 0/362 dead transitions. [2022-09-20 23:06:19,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 362 transitions, 1044 flow [2022-09-20 23:06:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 23:06:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 23:06:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2983 transitions. [2022-09-20 23:06:19,245 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8105978260869565 [2022-09-20 23:06:19,245 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2983 transitions. [2022-09-20 23:06:19,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2983 transitions. [2022-09-20 23:06:19,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:06:19,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2983 transitions. [2022-09-20 23:06:19,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 298.3) internal successors, (2983), 10 states have internal predecessors, (2983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:19,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 368.0) internal successors, (4048), 11 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:19,256 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 368.0) internal successors, (4048), 11 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:19,256 INFO L175 Difference]: Start difference. First operand has 342 places, 334 transitions, 778 flow. Second operand 10 states and 2983 transitions. [2022-09-20 23:06:19,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 362 transitions, 1044 flow [2022-09-20 23:06:19,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 362 transitions, 1032 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-20 23:06:19,263 INFO L231 Difference]: Finished difference. Result has 348 places, 336 transitions, 825 flow [2022-09-20 23:06:19,264 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=825, PETRI_PLACES=348, PETRI_TRANSITIONS=336} [2022-09-20 23:06:19,264 INFO L287 CegarLoopForPetriNet]: 335 programPoint places, 13 predicate places. [2022-09-20 23:06:19,264 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 336 transitions, 825 flow [2022-09-20 23:06:19,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 294.85714285714283) internal successors, (4128), 14 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:06:19,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:06:19,266 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:06:19,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-09-20 23:06:19,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:06:19,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:06:19,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:06:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 504164011, now seen corresponding path program 1 times [2022-09-20 23:06:19,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:06:19,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812524209] [2022-09-20 23:06:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:19,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:06:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:06:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:06:23,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812524209] [2022-09-20 23:06:23,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812524209] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:06:23,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405568714] [2022-09-20 23:06:23,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:06:23,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:06:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:06:23,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:06:23,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-20 23:06:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:06:23,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 166 conjunts are in the unsatisfiable core [2022-09-20 23:06:23,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:06:23,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:06:24,693 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-20 23:06:24,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-20 23:06:25,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-20 23:06:26,366 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-09-20 23:06:26,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-09-20 23:06:26,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:06:27,794 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-20 23:06:27,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-20 23:06:28,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:06:28,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:06:28,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:06:31,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-09-20 23:06:32,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:06:32,669 INFO L356 Elim1Store]: treesize reduction 120, result has 25.0 percent of original size [2022-09-20 23:06:32,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 59 [2022-09-20 23:06:34,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:06:34,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 158 [2022-09-20 23:06:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:06:36,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:06:38,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ c_~asum~0 c_~bsum~0))) is different from false [2022-09-20 23:06:38,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ c_~asum~0 |c_thread2Thread1of1ForFork0_#t~ret6#1|))) is different from false [2022-09-20 23:06:38,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ c_~asum~0 |c_thread2Thread1of1ForFork0_plus_#res#1|))) is different from false [2022-09-20 23:06:38,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (+ |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 |c_thread2Thread1of1ForFork0_plus_~b#1|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)))) is different from false [2022-09-20 23:06:38,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread2Thread1of1ForFork0_plus_#in~b#1| |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0))) is different from false [2022-09-20 23:06:38,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 |c_thread2Thread1of1ForFork0_plus_#in~a#1|))) is different from false [2022-09-20 23:06:38,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread2Thread1of1ForFork0_#t~mem5#1| c_~asum~0 c_~bsum~0))) is different from false [2022-09-20 23:06:38,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ c_~asum~0 c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) is different from false [2022-09-20 23:06:38,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (+ c_~asum~0 c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)))) is different from false [2022-09-20 23:06:38,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread1Thread1of1ForFork2_#t~ret3#1| c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2022-09-20 23:06:38,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread1Thread1of1ForFork2_plus_#res#1| c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2022-09-20 23:06:38,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2022-09-20 23:06:38,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ |c_thread1Thread1of1ForFork2_plus_~a#1| c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) |c_thread1Thread1of1ForFork2_plus_#in~b#1|))) is different from false [2022-09-20 23:06:38,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ c_~asum~0 c_~bsum~0 |c_thread1Thread1of1ForFork2_#t~mem2#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2022-09-20 23:06:38,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) c_~asum~0 c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2022-09-20 23:06:38,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305))) (= (+ c_~asum~0 c_~bsum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~csum~0 (select (select .cse1 c_~B~0.base) c_~B~0.offset)))))) is different from false [2022-09-20 23:06:39,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (v_ArrVal_303 (Array Int Int)) (v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.base| v_ArrVal_303) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_305))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_306))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ c_~asum~0 c_~bsum~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) (select (select .cse1 c_~B~0.base) c_~B~0.offset))))) is different from false [2022-09-20 23:06:42,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:06:42,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 128 treesize of output 93 [2022-09-20 23:06:42,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 236453878 treesize of output 233308150 [2022-09-20 23:14:39,263 WARN L233 SmtUtils]: Spent 7.95m on a formula simplification that was a NOOP. DAG size: 9669 (called from [L 789] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-09-20 23:14:40,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:14:40,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 233308150 treesize of output 220725246 Received shutdown request... [2022-09-20 23:20:28,759 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-09-20 23:20:28,762 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-09-20 23:20:28,777 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:20:28,787 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-20 23:20:28,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-20 23:20:28,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:28,987 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 315 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-09-20 23:20:28,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-09-20 23:20:28,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-09-20 23:20:28,989 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-09-20 23:20:28,990 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:20:28,993 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 23:20:28,994 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 23:20:28,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 11:20:28 BasicIcfg [2022-09-20 23:20:29,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 23:20:29,001 INFO L158 Benchmark]: Toolchain (without parser) took 863717.88ms. Allocated memory was 184.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 122.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-09-20 23:20:29,001 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 184.5MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 23:20:29,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.10ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 122.1MB in the beginning and 205.7MB in the end (delta: -83.6MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. [2022-09-20 23:20:29,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 238.0MB. Free memory was 205.7MB in the beginning and 203.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 23:20:29,003 INFO L158 Benchmark]: Boogie Preprocessor took 28.70ms. Allocated memory is still 238.0MB. Free memory was 203.1MB in the beginning and 201.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 23:20:29,003 INFO L158 Benchmark]: RCFGBuilder took 571.14ms. Allocated memory is still 238.0MB. Free memory was 201.5MB in the beginning and 178.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-09-20 23:20:29,004 INFO L158 Benchmark]: TraceAbstraction took 862821.02ms. Allocated memory was 238.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 177.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2022-09-20 23:20:29,007 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.14ms. Allocated memory is still 184.5MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.10ms. Allocated memory was 184.5MB in the beginning and 238.0MB in the end (delta: 53.5MB). Free memory was 122.1MB in the beginning and 205.7MB in the end (delta: -83.6MB). Peak memory consumption was 11.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 238.0MB. Free memory was 205.7MB in the beginning and 203.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.70ms. Allocated memory is still 238.0MB. Free memory was 203.1MB in the beginning and 201.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 571.14ms. Allocated memory is still 238.0MB. Free memory was 201.5MB in the beginning and 178.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 862821.02ms. Allocated memory was 238.0MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 177.9MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 315 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 315 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 315 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 315 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 481 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 862.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1591 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1591 mSDsluCounter, 826 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 813 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1377 IncrementalHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 185 mSDtfsCounter, 1377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1626 GetRequests, 1520 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=985occurred in iteration=5, InterpolantAutomatonStates: 72, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2521 NumberOfCodeBlocks, 2521 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3271 ConstructedInterpolants, 0 QuantifiedInterpolants, 8413 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1594 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 35/42 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