/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:40:52,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:40:52,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:40:52,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:40:52,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:40:52,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:40:52,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:40:52,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:40:52,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:40:52,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:40:52,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:40:52,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:40:52,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:40:52,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:40:52,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:40:52,320 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:40:52,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:40:52,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:40:52,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:40:52,326 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:40:52,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:40:52,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:40:52,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:40:52,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:40:52,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:40:52,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:40:52,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:40:52,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:40:52,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:40:52,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:40:52,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:40:52,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:40:52,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:40:52,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:40:52,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:40:52,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:40:52,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:40:52,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:40:52,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:40:52,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:40:52,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:40:52,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-06 17:40:52,371 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:40:52,371 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:40:52,372 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:40:52,372 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:40:52,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:40:52,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:40:52,373 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:40:52,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:40:52,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:40:52,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:40:52,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:40:52,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:40:52,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:40:52,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:40:52,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:40:52,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:40:52,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:40:52,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:40:52,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:40:52,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:40:52,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:40:52,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:40:52,637 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:40:52,638 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-12-06 17:40:53,524 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:40:53,737 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:40:53,738 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2022-12-06 17:40:53,747 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1669df4a/4c82fe23e57b4fae9e0070b97406ad3e/FLAGd26346b84 [2022-12-06 17:40:53,760 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1669df4a/4c82fe23e57b4fae9e0070b97406ad3e [2022-12-06 17:40:53,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:40:53,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:40:53,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:40:53,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:40:53,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:40:53,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:53" (1/1) ... [2022-12-06 17:40:53,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d1e476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:53, skipping insertion in model container [2022-12-06 17:40:53,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:40:53" (1/1) ... [2022-12-06 17:40:53,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:40:53,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:40:53,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,950 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,967 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-12-06 17:40:53,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:40:53,984 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:40:53,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:53,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:53,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,003 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,011 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,012 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,013 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,017 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:40:54,024 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:40:54,028 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4293,4306] [2022-12-06 17:40:54,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:40:54,041 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:40:54,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54 WrapperNode [2022-12-06 17:40:54,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:40:54,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:40:54,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:40:54,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:40:54,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,083 INFO L138 Inliner]: procedures = 26, calls = 79, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 319 [2022-12-06 17:40:54,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:40:54,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:40:54,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:40:54,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:40:54,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,116 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:40:54,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:40:54,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:40:54,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:40:54,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (1/1) ... [2022-12-06 17:40:54,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:40:54,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:40:54,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 17:40:54,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 17:40:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:40:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:40:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:40:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 17:40:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 17:40:54,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 17:40:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:40:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:40:54,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:40:54,185 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:40:54,257 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:40:54,258 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:40:54,676 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:40:54,785 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:40:54,786 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 17:40:54,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:54 BoogieIcfgContainer [2022-12-06 17:40:54,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:40:54,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:40:54,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:40:54,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:40:54,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:40:53" (1/3) ... [2022-12-06 17:40:54,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307ab66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:54, skipping insertion in model container [2022-12-06 17:40:54,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:40:54" (2/3) ... [2022-12-06 17:40:54,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307ab66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:40:54, skipping insertion in model container [2022-12-06 17:40:54,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:40:54" (3/3) ... [2022-12-06 17:40:54,795 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2022-12-06 17:40:54,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:40:54,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:40:54,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:40:54,878 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 17:40:54,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 488 flow [2022-12-06 17:40:55,005 INFO L130 PetriNetUnfolder]: 19/224 cut-off events. [2022-12-06 17:40:55,005 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 17:40:55,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 224 events. 19/224 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 117 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-12-06 17:40:55,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 488 flow [2022-12-06 17:40:55,017 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 212 transitions, 448 flow [2022-12-06 17:40:55,026 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:40:55,030 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;@f289ac6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:40:55,031 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 17:40:55,076 INFO L130 PetriNetUnfolder]: 19/211 cut-off events. [2022-12-06 17:40:55,076 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 17:40:55,076 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:40:55,077 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:40:55,078 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 2 more)] === [2022-12-06 17:40:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:40:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1317214140, now seen corresponding path program 1 times [2022-12-06 17:40:55,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:40:55,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618108026] [2022-12-06 17:40:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:40:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:40:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:40:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:40:56,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:40:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618108026] [2022-12-06 17:40:56,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618108026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:40:56,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:40:56,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:40:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760331231] [2022-12-06 17:40:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:40:56,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:40:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:40:56,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:40:56,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:40:56,132 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 228 [2022-12-06 17:40:56,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 212 transitions, 448 flow. Second operand has 8 states, 8 states have (on average 161.25) internal successors, (1290), 8 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:40:56,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:40:56,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 228 [2022-12-06 17:40:56,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:40:56,615 INFO L130 PetriNetUnfolder]: 774/1658 cut-off events. [2022-12-06 17:40:56,616 INFO L131 PetriNetUnfolder]: For 217/217 co-relation queries the response was YES. [2022-12-06 17:40:56,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1658 events. 774/1658 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9318 event pairs, 341 based on Foata normal form. 375/1799 useless extension candidates. Maximal degree in co-relation 2597. Up to 673 conditions per place. [2022-12-06 17:40:56,631 INFO L137 encePairwiseOnDemand]: 202/228 looper letters, 66 selfloop transitions, 6 changer transitions 7/220 dead transitions. [2022-12-06 17:40:56,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 640 flow [2022-12-06 17:40:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:40:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:40:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1504 transitions. [2022-12-06 17:40:56,648 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.732943469785575 [2022-12-06 17:40:56,651 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 8 predicate places. [2022-12-06 17:40:56,651 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 220 transitions, 640 flow [2022-12-06 17:40:56,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 161.25) internal successors, (1290), 8 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:40:56,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:40:56,653 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:40:56,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:40:56,653 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 2 more)] === [2022-12-06 17:40:56,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:40:56,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1755508853, now seen corresponding path program 1 times [2022-12-06 17:40:56,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:40:56,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549944764] [2022-12-06 17:40:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:40:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:40:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:40:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:40:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:40:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549944764] [2022-12-06 17:40:57,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549944764] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:40:57,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562924689] [2022-12-06 17:40:57,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:40:57,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:40:57,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:40:57,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:40:57,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 17:40:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:40:57,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 17:40:57,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:40:57,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:40:57,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:40:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:40:57,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562924689] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:40:57,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:40:57,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 10] total 21 [2022-12-06 17:40:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532135648] [2022-12-06 17:40:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:40:57,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:40:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:40:57,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:40:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-12-06 17:40:57,823 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 228 [2022-12-06 17:40:57,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 220 transitions, 640 flow. Second operand has 9 states, 9 states have (on average 155.66666666666666) internal successors, (1401), 9 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:40:57,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:40:57,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 228 [2022-12-06 17:40:57,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:40:58,481 INFO L130 PetriNetUnfolder]: 2260/4048 cut-off events. [2022-12-06 17:40:58,481 INFO L131 PetriNetUnfolder]: For 1829/3853 co-relation queries the response was YES. [2022-12-06 17:40:58,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10544 conditions, 4048 events. 2260/4048 cut-off events. For 1829/3853 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25935 event pairs, 173 based on Foata normal form. 30/3637 useless extension candidates. Maximal degree in co-relation 9219. Up to 1840 conditions per place. [2022-12-06 17:40:58,512 INFO L137 encePairwiseOnDemand]: 212/228 looper letters, 154 selfloop transitions, 24 changer transitions 8/321 dead transitions. [2022-12-06 17:40:58,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 321 transitions, 1471 flow [2022-12-06 17:40:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 17:40:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 17:40:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2096 transitions. [2022-12-06 17:40:58,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7071524966261808 [2022-12-06 17:40:58,517 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 20 predicate places. [2022-12-06 17:40:58,517 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 321 transitions, 1471 flow [2022-12-06 17:40:58,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 155.66666666666666) internal successors, (1401), 9 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:40:58,518 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:40:58,518 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:40:58,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 17:40:58,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:40:58,724 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 2 more)] === [2022-12-06 17:40:58,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:40:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash 414335755, now seen corresponding path program 2 times [2022-12-06 17:40:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:40:58,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077948208] [2022-12-06 17:40:58,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:40:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:40:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:40:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:40:59,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:40:59,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077948208] [2022-12-06 17:40:59,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077948208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:40:59,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:40:59,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:40:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560175784] [2022-12-06 17:40:59,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:40:59,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:40:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:40:59,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:40:59,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:40:59,104 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 228 [2022-12-06 17:40:59,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 321 transitions, 1471 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:40:59,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:40:59,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 228 [2022-12-06 17:40:59,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:40:59,679 INFO L130 PetriNetUnfolder]: 2369/4473 cut-off events. [2022-12-06 17:40:59,679 INFO L131 PetriNetUnfolder]: For 3323/8994 co-relation queries the response was YES. [2022-12-06 17:40:59,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14699 conditions, 4473 events. 2369/4473 cut-off events. For 3323/8994 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 30269 event pairs, 179 based on Foata normal form. 89/4101 useless extension candidates. Maximal degree in co-relation 12641. Up to 2120 conditions per place. [2022-12-06 17:40:59,716 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 228 selfloop transitions, 12 changer transitions 17/427 dead transitions. [2022-12-06 17:40:59,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 427 transitions, 2695 flow [2022-12-06 17:40:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:40:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:40:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1000 transitions. [2022-12-06 17:40:59,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2022-12-06 17:40:59,720 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 24 predicate places. [2022-12-06 17:40:59,720 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 427 transitions, 2695 flow [2022-12-06 17:40:59,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:40:59,721 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:40:59,721 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:40:59,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:40:59,721 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 2 more)] === [2022-12-06 17:40:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:40:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash 22341391, now seen corresponding path program 3 times [2022-12-06 17:40:59,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:40:59,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225312485] [2022-12-06 17:40:59,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:40:59,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:40:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:00,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:00,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225312485] [2022-12-06 17:41:00,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225312485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:00,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:00,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592727465] [2022-12-06 17:41:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:00,050 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 228 [2022-12-06 17:41:00,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 427 transitions, 2695 flow. Second operand has 5 states, 5 states have (on average 188.8) internal successors, (944), 5 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:00,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:00,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 228 [2022-12-06 17:41:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:01,104 INFO L130 PetriNetUnfolder]: 3841/7497 cut-off events. [2022-12-06 17:41:01,105 INFO L131 PetriNetUnfolder]: For 8955/30830 co-relation queries the response was YES. [2022-12-06 17:41:01,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28862 conditions, 7497 events. 3841/7497 cut-off events. For 8955/30830 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 59182 event pairs, 137 based on Foata normal form. 412/7189 useless extension candidates. Maximal degree in co-relation 25608. Up to 3936 conditions per place. [2022-12-06 17:41:01,237 INFO L137 encePairwiseOnDemand]: 220/228 looper letters, 393 selfloop transitions, 82 changer transitions 22/663 dead transitions. [2022-12-06 17:41:01,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 663 transitions, 5665 flow [2022-12-06 17:41:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:41:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:41:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1375 transitions. [2022-12-06 17:41:01,240 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8615288220551378 [2022-12-06 17:41:01,241 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 30 predicate places. [2022-12-06 17:41:01,241 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 663 transitions, 5665 flow [2022-12-06 17:41:01,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.8) internal successors, (944), 5 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:01,241 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:01,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:41:01,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:41:01,242 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 2 more)] === [2022-12-06 17:41:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1998596865, now seen corresponding path program 4 times [2022-12-06 17:41:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48745458] [2022-12-06 17:41:01,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:01,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:01,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:01,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48745458] [2022-12-06 17:41:01,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48745458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:01,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:01,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:01,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080993078] [2022-12-06 17:41:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:01,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:01,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:01,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:01,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 228 [2022-12-06 17:41:01,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 663 transitions, 5665 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:01,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:01,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 228 [2022-12-06 17:41:01,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:02,879 INFO L130 PetriNetUnfolder]: 5198/9169 cut-off events. [2022-12-06 17:41:02,879 INFO L131 PetriNetUnfolder]: For 16173/92953 co-relation queries the response was YES. [2022-12-06 17:41:02,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45060 conditions, 9169 events. 5198/9169 cut-off events. For 16173/92953 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 68848 event pairs, 72 based on Foata normal form. 1195/9638 useless extension candidates. Maximal degree in co-relation 41232. Up to 5432 conditions per place. [2022-12-06 17:41:03,044 INFO L137 encePairwiseOnDemand]: 220/228 looper letters, 638 selfloop transitions, 88 changer transitions 26/922 dead transitions. [2022-12-06 17:41:03,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 922 transitions, 9833 flow [2022-12-06 17:41:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:41:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:41:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1005 transitions. [2022-12-06 17:41:03,046 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.881578947368421 [2022-12-06 17:41:03,047 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 34 predicate places. [2022-12-06 17:41:03,047 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 922 transitions, 9833 flow [2022-12-06 17:41:03,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:03,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:03,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:41:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 17:41:03,048 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 2 more)] === [2022-12-06 17:41:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 705795241, now seen corresponding path program 5 times [2022-12-06 17:41:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851204170] [2022-12-06 17:41:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:03,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851204170] [2022-12-06 17:41:03,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851204170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:03,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:03,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898607745] [2022-12-06 17:41:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:03,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:03,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:03,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:03,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 228 [2022-12-06 17:41:03,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 922 transitions, 9833 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:03,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:03,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 228 [2022-12-06 17:41:03,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:04,881 INFO L130 PetriNetUnfolder]: 6086/10300 cut-off events. [2022-12-06 17:41:04,882 INFO L131 PetriNetUnfolder]: For 22693/156200 co-relation queries the response was YES. [2022-12-06 17:41:04,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60634 conditions, 10300 events. 6086/10300 cut-off events. For 22693/156200 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 76709 event pairs, 87 based on Foata normal form. 1332/10921 useless extension candidates. Maximal degree in co-relation 58643. Up to 6706 conditions per place. [2022-12-06 17:41:04,985 INFO L137 encePairwiseOnDemand]: 219/228 looper letters, 712 selfloop transitions, 124 changer transitions 26/1032 dead transitions. [2022-12-06 17:41:04,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1032 transitions, 12918 flow [2022-12-06 17:41:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:41:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:41:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2022-12-06 17:41:04,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8808479532163743 [2022-12-06 17:41:04,988 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 39 predicate places. [2022-12-06 17:41:04,988 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 1032 transitions, 12918 flow [2022-12-06 17:41:04,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:04,988 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:04,989 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:41:04,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 17:41:04,989 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 2 more)] === [2022-12-06 17:41:04,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:04,989 INFO L85 PathProgramCache]: Analyzing trace with hash 697108003, now seen corresponding path program 6 times [2022-12-06 17:41:04,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:04,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499162707] [2022-12-06 17:41:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:04,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:05,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:05,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499162707] [2022-12-06 17:41:05,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499162707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:05,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:05,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:05,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248139821] [2022-12-06 17:41:05,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:05,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:05,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:05,277 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 228 [2022-12-06 17:41:05,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1032 transitions, 12918 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:05,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:05,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 228 [2022-12-06 17:41:05,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:07,859 INFO L130 PetriNetUnfolder]: 8714/14167 cut-off events. [2022-12-06 17:41:07,859 INFO L131 PetriNetUnfolder]: For 43180/198990 co-relation queries the response was YES. [2022-12-06 17:41:07,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97229 conditions, 14167 events. 8714/14167 cut-off events. For 43180/198990 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 105576 event pairs, 76 based on Foata normal form. 1305/14639 useless extension candidates. Maximal degree in co-relation 88887. Up to 9667 conditions per place. [2022-12-06 17:41:07,988 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 1043 selfloop transitions, 92 changer transitions 21/1326 dead transitions. [2022-12-06 17:41:07,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1326 transitions, 19467 flow [2022-12-06 17:41:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:41:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:41:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1007 transitions. [2022-12-06 17:41:07,990 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8833333333333333 [2022-12-06 17:41:07,991 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 43 predicate places. [2022-12-06 17:41:07,991 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 1326 transitions, 19467 flow [2022-12-06 17:41:07,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:07,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:07,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:41:07,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 17:41:07,992 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 2 more)] === [2022-12-06 17:41:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash 584738029, now seen corresponding path program 7 times [2022-12-06 17:41:07,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:07,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217188755] [2022-12-06 17:41:07,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:07,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:08,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217188755] [2022-12-06 17:41:08,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217188755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:08,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:08,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507087433] [2022-12-06 17:41:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:08,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:08,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:08,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 228 [2022-12-06 17:41:08,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1326 transitions, 19467 flow. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:08,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:08,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 228 [2022-12-06 17:41:08,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:10,846 INFO L130 PetriNetUnfolder]: 8632/14516 cut-off events. [2022-12-06 17:41:10,846 INFO L131 PetriNetUnfolder]: For 62892/403561 co-relation queries the response was YES. [2022-12-06 17:41:10,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112706 conditions, 14516 events. 8632/14516 cut-off events. For 62892/403561 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 115166 event pairs, 29 based on Foata normal form. 1839/15532 useless extension candidates. Maximal degree in co-relation 109485. Up to 10520 conditions per place. [2022-12-06 17:41:11,226 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 1159 selfloop transitions, 137 changer transitions 30/1496 dead transitions. [2022-12-06 17:41:11,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1496 transitions, 24911 flow [2022-12-06 17:41:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:41:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:41:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1205 transitions. [2022-12-06 17:41:11,229 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8808479532163743 [2022-12-06 17:41:11,231 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 48 predicate places. [2022-12-06 17:41:11,231 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 1496 transitions, 24911 flow [2022-12-06 17:41:11,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:11,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:11,232 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:41:11,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:41:11,232 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 2 more)] === [2022-12-06 17:41:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1472430300, now seen corresponding path program 1 times [2022-12-06 17:41:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:11,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751884554] [2022-12-06 17:41:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:41:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751884554] [2022-12-06 17:41:11,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751884554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:11,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:11,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:41:11,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686545321] [2022-12-06 17:41:11,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:11,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:41:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:41:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:41:11,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 228 [2022-12-06 17:41:11,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1496 transitions, 24911 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:11,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:11,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 228 [2022-12-06 17:41:11,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:14,950 INFO L130 PetriNetUnfolder]: 10234/17118 cut-off events. [2022-12-06 17:41:14,951 INFO L131 PetriNetUnfolder]: For 107733/270771 co-relation queries the response was YES. [2022-12-06 17:41:14,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138860 conditions, 17118 events. 10234/17118 cut-off events. For 107733/270771 co-relation queries the response was YES. Maximal size of possible extension queue 1103. Compared 131908 event pairs, 62 based on Foata normal form. 474/16610 useless extension candidates. Maximal degree in co-relation 118691. Up to 11867 conditions per place. [2022-12-06 17:41:15,153 INFO L137 encePairwiseOnDemand]: 217/228 looper letters, 1053 selfloop transitions, 8 changer transitions 108/1596 dead transitions. [2022-12-06 17:41:15,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 1596 transitions, 28847 flow [2022-12-06 17:41:15,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:41:15,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:41:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1632 transitions. [2022-12-06 17:41:15,156 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7953216374269005 [2022-12-06 17:41:15,157 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 56 predicate places. [2022-12-06 17:41:15,157 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 1596 transitions, 28847 flow [2022-12-06 17:41:15,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:15,158 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:15,158 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:41:15,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 17:41:15,158 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 270432294, now seen corresponding path program 1 times [2022-12-06 17:41:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:15,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308566666] [2022-12-06 17:41:15,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308566666] [2022-12-06 17:41:16,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308566666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:41:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117087983] [2022-12-06 17:41:16,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:16,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:41:16,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:41:16,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:41:16,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 17:41:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:16,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-06 17:41:16,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:41:16,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:41:16,601 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 17:41:16,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-12-06 17:41:16,643 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 17:41:16,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-12-06 17:41:17,328 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 17:41:17,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-12-06 17:41:17,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 17:41:18,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:41:18,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:41:18,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:41:18,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 17:41:18,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 17:41:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:18,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:41:20,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:41:20,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 61 [2022-12-06 17:41:20,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1267 treesize of output 1235 [2022-12-06 17:41:20,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1235 treesize of output 1043 [2022-12-06 17:41:20,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 533 treesize of output 509 [2022-12-06 17:41:20,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1019 treesize of output 971 [2022-12-06 17:41:20,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 971 treesize of output 875 [2022-12-06 17:41:22,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-06 17:41:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:41:22,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117087983] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:41:22,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:41:22,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 29, 26] total 67 [2022-12-06 17:41:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117367716] [2022-12-06 17:41:22,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:41:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-06 17:41:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-06 17:41:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=3618, Unknown=38, NotChecked=0, Total=4422 [2022-12-06 17:41:22,535 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 228 [2022-12-06 17:41:22,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 1596 transitions, 28847 flow. Second operand has 67 states, 67 states have (on average 93.95522388059702) internal successors, (6295), 67 states have internal predecessors, (6295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:41:22,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:22,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 228 [2022-12-06 17:41:22,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:34,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 17:42:00,529 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L72-->L75: Formula: (let ((.cse0 (not |v_thread2_#t~short6#1_44|))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (let ((.cse1 (< v_~q2_back~0_44 v_~n2~0_20)) (.cse2 (<= 0 v_~q2_back~0_44))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 .cse2 |v_thread2_#t~short6#1_44|))) (= (+ v_~q2_back~0_44 1) v_~q2_back~0_43) (= (ite |v_thread2_#t~short6#1_43| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (or (and (= |v_thread2_#t~short6#1_44| |v_thread2_#t~short6#1_43|) .cse0 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_1| |v_thread2_#t~mem5#1_30|)) (and (= (select (select |v_#memory_int_61| v_~q2~0.base_31) (+ (* v_~q2_back~0_44 4) v_~q2~0.offset_31)) |v_thread2_#t~mem5#1_30|) (let ((.cse3 (= (+ v_~C~0_17 |v_thread2_#t~mem5#1_30|) 0))) (or (and .cse3 |v_thread2_#t~short6#1_43|) (and (not |v_thread2_#t~short6#1_43|) (not .cse3)))) |v_thread2_#t~short6#1_44|)))) InVars {~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_61|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_44} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~short6#1=|v_thread2Thread1of1ForFork0_#t~short6#1_1|, ~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_61|, ~q2~0.base=v_~q2~0.base_31, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q2_back~0=v_~q2_back~0_43} AuxVars[|v_thread2_#t~short6#1_44|, |v_thread2_#t~mem5#1_30|, |v_thread2_#t~short6#1_43|] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~short6#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~q2_back~0][2380], [1299#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 170#$Ultimate##0true, 1275#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 1323#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 84#L75true, 1312#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 225#true, 1289#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 112#L92true, 101#L52true, thread3Thread1of1ForFork1InUse, 1304#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), thread2Thread1of1ForFork0InUse, 1324#true, 1338#true, 1280#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 184#L148-1true, thread1Thread1of1ForFork2InUse, thread4Thread1of1ForFork3InUse]) [2022-12-06 17:42:00,529 INFO L382 tUnfolder$Statistics]: this new event has 163 ancestors and is cut-off event [2022-12-06 17:42:00,529 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-06 17:42:00,529 INFO L385 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-12-06 17:42:00,529 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-06 17:42:00,529 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L72-->L75: Formula: (let ((.cse0 (not |v_thread2_#t~short6#1_44|))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (let ((.cse1 (< v_~q2_back~0_44 v_~n2~0_20)) (.cse2 (<= 0 v_~q2_back~0_44))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 .cse2 |v_thread2_#t~short6#1_44|))) (= (+ v_~q2_back~0_44 1) v_~q2_back~0_43) (= (ite |v_thread2_#t~short6#1_43| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (or (and (= |v_thread2_#t~short6#1_44| |v_thread2_#t~short6#1_43|) .cse0 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_1| |v_thread2_#t~mem5#1_30|)) (and (= (select (select |v_#memory_int_61| v_~q2~0.base_31) (+ (* v_~q2_back~0_44 4) v_~q2~0.offset_31)) |v_thread2_#t~mem5#1_30|) (let ((.cse3 (= (+ v_~C~0_17 |v_thread2_#t~mem5#1_30|) 0))) (or (and .cse3 |v_thread2_#t~short6#1_43|) (and (not |v_thread2_#t~short6#1_43|) (not .cse3)))) |v_thread2_#t~short6#1_44|)))) InVars {~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_61|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_44} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~short6#1=|v_thread2Thread1of1ForFork0_#t~short6#1_1|, ~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_61|, ~q2~0.base=v_~q2~0.base_31, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q2_back~0=v_~q2_back~0_43} AuxVars[|v_thread2_#t~short6#1_44|, |v_thread2_#t~mem5#1_30|, |v_thread2_#t~short6#1_43|] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~short6#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~q2_back~0][2019], [1299#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 170#$Ultimate##0true, 1275#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 84#L75true, 1312#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 225#true, 112#L92true, 1320#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 1285#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 12#L61true, thread3Thread1of1ForFork1InUse, 1304#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 1324#true, 1338#true, thread2Thread1of1ForFork0InUse, 1280#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 184#L148-1true, thread1Thread1of1ForFork2InUse, thread4Thread1of1ForFork3InUse]) [2022-12-06 17:42:00,529 INFO L382 tUnfolder$Statistics]: this new event has 162 ancestors and is cut-off event [2022-12-06 17:42:00,530 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:42:00,530 INFO L385 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-12-06 17:42:00,530 INFO L385 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-12-06 17:42:04,493 INFO L130 PetriNetUnfolder]: 65734/103488 cut-off events. [2022-12-06 17:42:04,493 INFO L131 PetriNetUnfolder]: For 507517/541910 co-relation queries the response was YES. [2022-12-06 17:42:05,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880949 conditions, 103488 events. 65734/103488 cut-off events. For 507517/541910 co-relation queries the response was YES. Maximal size of possible extension queue 4673. Compared 909718 event pairs, 1725 based on Foata normal form. 1855/99138 useless extension candidates. Maximal degree in co-relation 471932. Up to 71271 conditions per place. [2022-12-06 17:42:06,016 INFO L137 encePairwiseOnDemand]: 180/228 looper letters, 5298 selfloop transitions, 1405 changer transitions 340/7228 dead transitions. [2022-12-06 17:42:06,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 7228 transitions, 153106 flow [2022-12-06 17:42:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-12-06 17:42:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2022-12-06 17:42:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 7694 transitions. [2022-12-06 17:42:06,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4218201754385965 [2022-12-06 17:42:06,033 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 135 predicate places. [2022-12-06 17:42:06,033 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 7228 transitions, 153106 flow [2022-12-06 17:42:06,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 93.95522388059702) internal successors, (6295), 67 states have internal predecessors, (6295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:42:06,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:42:06,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:42:06,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 17:42:06,239 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,SelfDestructingSolverStorable9 [2022-12-06 17:42:06,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:42:06,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:42:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1795354857, now seen corresponding path program 1 times [2022-12-06 17:42:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:42:06,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524043643] [2022-12-06 17:42:06,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:42:06,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:42:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:42:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 17:42:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:42:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524043643] [2022-12-06 17:42:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524043643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:42:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:42:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:42:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505303760] [2022-12-06 17:42:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:42:06,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:42:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:42:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:42:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:42:06,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 228 [2022-12-06 17:42:06,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 7228 transitions, 153106 flow. Second operand has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:42:06,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:42:06,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 228 [2022-12-06 17:42:06,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:43:36,426 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L72-->L75: Formula: (let ((.cse0 (not |v_thread2_#t~short6#1_44|))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (let ((.cse1 (< v_~q2_back~0_44 v_~n2~0_20)) (.cse2 (<= 0 v_~q2_back~0_44))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 .cse2 |v_thread2_#t~short6#1_44|))) (= (+ v_~q2_back~0_44 1) v_~q2_back~0_43) (= (ite |v_thread2_#t~short6#1_43| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (or (and (= |v_thread2_#t~short6#1_44| |v_thread2_#t~short6#1_43|) .cse0 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_1| |v_thread2_#t~mem5#1_30|)) (and (= (select (select |v_#memory_int_61| v_~q2~0.base_31) (+ (* v_~q2_back~0_44 4) v_~q2~0.offset_31)) |v_thread2_#t~mem5#1_30|) (let ((.cse3 (= (+ v_~C~0_17 |v_thread2_#t~mem5#1_30|) 0))) (or (and .cse3 |v_thread2_#t~short6#1_43|) (and (not |v_thread2_#t~short6#1_43|) (not .cse3)))) |v_thread2_#t~short6#1_44|)))) InVars {~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_61|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_44} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~short6#1=|v_thread2Thread1of1ForFork0_#t~short6#1_1|, ~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_61|, ~q2~0.base=v_~q2~0.base_31, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q2_back~0=v_~q2_back~0_43} AuxVars[|v_thread2_#t~short6#1_44|, |v_thread2_#t~mem5#1_30|, |v_thread2_#t~short6#1_43|] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~short6#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~q2_back~0][3869], [1299#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 170#$Ultimate##0true, 1275#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 1323#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 84#L75true, 1312#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 225#true, 1289#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 112#L92true, 101#L52true, 1304#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), thread3Thread1of1ForFork1InUse, 2620#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 1338#true, 1324#true, thread2Thread1of1ForFork0InUse, 1280#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 184#L148-1true, thread1Thread1of1ForFork2InUse, thread4Thread1of1ForFork3InUse]) [2022-12-06 17:43:36,426 INFO L382 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-12-06 17:43:36,426 INFO L385 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-12-06 17:43:36,426 INFO L385 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-12-06 17:43:36,426 INFO L385 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-12-06 17:43:36,427 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L72-->L75: Formula: (let ((.cse0 (not |v_thread2_#t~short6#1_44|))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (let ((.cse1 (< v_~q2_back~0_44 v_~n2~0_20)) (.cse2 (<= 0 v_~q2_back~0_44))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 .cse2 |v_thread2_#t~short6#1_44|))) (= (+ v_~q2_back~0_44 1) v_~q2_back~0_43) (= (ite |v_thread2_#t~short6#1_43| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (or (and (= |v_thread2_#t~short6#1_44| |v_thread2_#t~short6#1_43|) .cse0 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_1| |v_thread2_#t~mem5#1_30|)) (and (= (select (select |v_#memory_int_61| v_~q2~0.base_31) (+ (* v_~q2_back~0_44 4) v_~q2~0.offset_31)) |v_thread2_#t~mem5#1_30|) (let ((.cse3 (= (+ v_~C~0_17 |v_thread2_#t~mem5#1_30|) 0))) (or (and .cse3 |v_thread2_#t~short6#1_43|) (and (not |v_thread2_#t~short6#1_43|) (not .cse3)))) |v_thread2_#t~short6#1_44|)))) InVars {~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_61|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_44} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~short6#1=|v_thread2Thread1of1ForFork0_#t~short6#1_1|, ~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_61|, ~q2~0.base=v_~q2~0.base_31, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q2_back~0=v_~q2_back~0_43} AuxVars[|v_thread2_#t~short6#1_44|, |v_thread2_#t~mem5#1_30|, |v_thread2_#t~short6#1_43|] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~short6#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~q2_back~0][3410], [1299#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 170#$Ultimate##0true, 1275#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 84#L75true, 1312#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 225#true, 112#L92true, 1285#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), 1320#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 12#L61true, 1304#(or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0))), thread3Thread1of1ForFork1InUse, 2620#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread2Thread1of1ForFork0InUse, 1280#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 1338#true, 1324#true, 184#L148-1true, thread1Thread1of1ForFork2InUse, thread4Thread1of1ForFork3InUse]) [2022-12-06 17:43:36,427 INFO L382 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-12-06 17:43:36,427 INFO L385 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-12-06 17:43:36,427 INFO L385 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-12-06 17:43:36,427 INFO L385 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-12-06 17:43:38,729 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([789] L72-->L75: Formula: (let ((.cse0 (not |v_thread2_#t~short6#1_44|))) (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (let ((.cse1 (< v_~q2_back~0_44 v_~n2~0_20)) (.cse2 (<= 0 v_~q2_back~0_44))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse1 .cse2 |v_thread2_#t~short6#1_44|))) (= (+ v_~q2_back~0_44 1) v_~q2_back~0_43) (= (ite |v_thread2_#t~short6#1_43| 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (or (and (= |v_thread2_#t~short6#1_44| |v_thread2_#t~short6#1_43|) .cse0 (= |v_thread2Thread1of1ForFork0_#t~mem5#1_1| |v_thread2_#t~mem5#1_30|)) (and (= (select (select |v_#memory_int_61| v_~q2~0.base_31) (+ (* v_~q2_back~0_44 4) v_~q2~0.offset_31)) |v_thread2_#t~mem5#1_30|) (let ((.cse3 (= (+ v_~C~0_17 |v_thread2_#t~mem5#1_30|) 0))) (or (and .cse3 |v_thread2_#t~short6#1_43|) (and (not |v_thread2_#t~short6#1_43|) (not .cse3)))) |v_thread2_#t~short6#1_44|)))) InVars {~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, #memory_int=|v_#memory_int_61|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_31, ~q2_back~0=v_~q2_back~0_44} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~short6#1=|v_thread2Thread1of1ForFork0_#t~short6#1_1|, ~n2~0=v_~n2~0_20, ~C~0=v_~C~0_17, ~q2~0.offset=v_~q2~0.offset_31, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, #memory_int=|v_#memory_int_61|, ~q2~0.base=v_~q2~0.base_31, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_1|, ~q2_back~0=v_~q2_back~0_43} AuxVars[|v_thread2_#t~short6#1_44|, |v_thread2_#t~mem5#1_30|, |v_thread2_#t~short6#1_43|] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~short6#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~post7#1, ~q2_back~0][3850], [170#$Ultimate##0true, 1311#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (<= ~N~0 ~i~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))), 1275#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), 84#L75true, 225#true, 112#L92true, 1289#(and (or (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 101#L52true, 1308#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), 1319#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), thread3Thread1of1ForFork1InUse, 2620#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), thread2Thread1of1ForFork0InUse, 1338#true, 1324#true, 1280#(or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)), 184#L148-1true, thread1Thread1of1ForFork2InUse, 1300#(and (or (and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)) (<= ~N~0 ~i~0)) (or (and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread1Thread1of1ForFork2_~cond~0#1| 0) (<= ~N~0 ~i~0)))), thread4Thread1of1ForFork3InUse]) [2022-12-06 17:43:38,730 INFO L382 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-12-06 17:43:38,730 INFO L385 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-12-06 17:43:38,730 INFO L385 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-12-06 17:43:38,730 INFO L385 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-12-06 17:43:45,943 INFO L130 PetriNetUnfolder]: 72987/119070 cut-off events. [2022-12-06 17:43:45,943 INFO L131 PetriNetUnfolder]: For 817846/854148 co-relation queries the response was YES. [2022-12-06 17:43:46,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058444 conditions, 119070 events. 72987/119070 cut-off events. For 817846/854148 co-relation queries the response was YES. Maximal size of possible extension queue 4951. Compared 1110615 event pairs, 2287 based on Foata normal form. 8952/120468 useless extension candidates. Maximal degree in co-relation 501471. Up to 80955 conditions per place. [2022-12-06 17:43:47,805 INFO L137 encePairwiseOnDemand]: 219/228 looper letters, 6506 selfloop transitions, 11 changer transitions 1081/8918 dead transitions. [2022-12-06 17:43:47,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 8918 transitions, 208280 flow [2022-12-06 17:43:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:43:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:43:47,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1276 transitions. [2022-12-06 17:43:47,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7994987468671679 [2022-12-06 17:43:47,830 INFO L294 CegarLoopForPetriNet]: 206 programPoint places, 141 predicate places. [2022-12-06 17:43:47,830 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 8918 transitions, 208280 flow [2022-12-06 17:43:47,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.66666666666666) internal successors, (1078), 6 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:43:47,830 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:43:47,831 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:43:47,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 17:43:47,831 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:43:47,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:43:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 321005142, now seen corresponding path program 2 times [2022-12-06 17:43:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:43:47,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584207418] [2022-12-06 17:43:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:43:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:43:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:43:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:43:51,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:43:51,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584207418] [2022-12-06 17:43:51,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584207418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:43:51,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842870512] [2022-12-06 17:43:51,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:43:51,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:43:51,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:43:51,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:43:51,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 17:43:51,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:43:51,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:43:51,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-06 17:43:51,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:43:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:43:53,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 17:43:53,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:43:53,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 17:43:53,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 17:43:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:43:53,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:43:54,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:43:54,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 162 [2022-12-06 17:43:54,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 134 [2022-12-06 17:43:54,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2022-12-06 17:43:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:43:55,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842870512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:43:55,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:43:55,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 75 [2022-12-06 17:43:55,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408559808] [2022-12-06 17:43:55,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:43:55,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-06 17:43:55,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:43:55,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-06 17:43:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=5168, Unknown=1, NotChecked=0, Total=5550 [2022-12-06 17:43:55,986 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 228 [2022-12-06 17:43:55,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 8918 transitions, 208280 flow. Second operand has 75 states, 75 states have (on average 85.22666666666667) internal successors, (6392), 75 states have internal predecessors, (6392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:43:55,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:43:55,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 228 [2022-12-06 17:43:55,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:46:21,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 17:46:23,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2022-12-06 17:52:04,940 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:52:04,951 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:52:05,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 17:52:06,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-12-06 17:52:06,438 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 17:52:06,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 17:52:06,438 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 17:52:06,439 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 17:52:06,440 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 17:52:06,440 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 17:52:06,440 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 17:52:06,440 INFO L458 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1] [2022-12-06 17:52:06,453 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:52:06,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:52:06,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:52:06 BasicIcfg [2022-12-06 17:52:06,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:52:06,457 INFO L158 Benchmark]: Toolchain (without parser) took 672694.39ms. Allocated memory was 209.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 186.1MB in the beginning and 223.1MB in the end (delta: -37.0MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-12-06 17:52:06,457 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 209.7MB. Free memory is still 186.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:52:06,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.79ms. Allocated memory is still 209.7MB. Free memory was 186.1MB in the beginning and 169.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 17:52:06,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.31ms. Allocated memory is still 209.7MB. Free memory was 169.8MB in the beginning and 167.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 17:52:06,458 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 209.7MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:52:06,458 INFO L158 Benchmark]: RCFGBuilder took 667.36ms. Allocated memory is still 209.7MB. Free memory was 165.1MB in the beginning and 121.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2022-12-06 17:52:06,458 INFO L158 Benchmark]: TraceAbstraction took 671667.08ms. Allocated memory was 209.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 120.6MB in the beginning and 223.1MB in the end (delta: -102.6MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. [2022-12-06 17:52:06,462 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.08ms. Allocated memory is still 209.7MB. Free memory is still 186.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.79ms. Allocated memory is still 209.7MB. Free memory was 186.1MB in the beginning and 169.8MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.31ms. Allocated memory is still 209.7MB. Free memory was 169.8MB in the beginning and 167.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 209.7MB. Free memory was 167.2MB in the beginning and 165.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 667.36ms. Allocated memory is still 209.7MB. Free memory was 165.1MB in the beginning and 121.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * TraceAbstraction took 671667.08ms. Allocated memory was 209.7MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 120.6MB in the beginning and 223.1MB in the end (delta: -102.6MB). Peak memory consumption was 5.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 244 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 671.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 651.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 130 mSolverCounterUnknown, 9063 SdHoareTripleChecker+Valid, 16.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9063 mSDsluCounter, 7749 SdHoareTripleChecker+Invalid, 14.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7330 mSDsCounter, 811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15419 IncrementalHoareTripleChecker+Invalid, 16360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 811 mSolverCounterUnsat, 419 mSDtfsCounter, 15419 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1500 GetRequests, 979 SyntacticMatches, 9 SemanticMatches, 512 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38948 ImplicationChecksByTransitivity, 47.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208280occurred in iteration=11, InterpolantAutomatonStates: 152, 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.7s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 2586 NumberOfCodeBlocks, 2586 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3099 ConstructedInterpolants, 120 QuantifiedInterpolants, 27311 SizeOfPredicates, 112 NumberOfNonLiveVariables, 1381 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 13/57 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 !ENTRY org.eclipse.osgi 4 0 2022-12-06 17:52:06.499 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1669df4a/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1669df4a/.metadata/.log.