/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/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 18:43:30,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 18:43:30,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 18:43:30,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 18:43:30,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 18:43:30,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 18:43:30,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 18:43:30,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 18:43:30,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 18:43:30,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 18:43:30,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 18:43:30,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 18:43:30,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 18:43:30,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 18:43:30,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 18:43:30,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 18:43:30,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 18:43:30,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 18:43:30,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 18:43:30,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 18:43:30,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 18:43:30,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 18:43:30,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 18:43:30,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 18:43:30,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 18:43:30,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 18:43:30,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 18:43:30,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 18:43:30,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 18:43:30,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 18:43:30,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 18:43:30,490 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 18:43:30,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 18:43:30,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 18:43:30,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 18:43:30,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 18:43:30,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 18:43:30,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 18:43:30,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 18:43:30,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 18:43:30,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 18:43:30,495 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 18:43:30,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 18:43:30,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 18:43:30,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 18:43:30,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 18:43:30,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 18:43:30,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 18:43:30,523 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 18:43:30,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 18:43:30,523 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 18:43:30,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 18:43:30,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 18:43:30,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:43:30,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 18:43:30,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 18:43:30,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 18:43:30,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 18:43:30,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 18:43:30,526 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 18:43:30,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 18:43:30,526 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 18:43:30,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 18:43:30,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 18:43:30,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 18:43:30,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 18:43:30,856 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 18:43:30,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-12-06 18:43:31,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 18:43:31,984 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 18:43:31,985 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-12-06 18:43:31,989 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a04ca5b/89101b8761044c58be94530038d5ea42/FLAG771ae6d77 [2022-12-06 18:43:32,000 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a04ca5b/89101b8761044c58be94530038d5ea42 [2022-12-06 18:43:32,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 18:43:32,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 18:43:32,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 18:43:32,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 18:43:32,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 18:43:32,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a1875b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32, skipping insertion in model container [2022-12-06 18:43:32,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 18:43:32,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 18:43:32,135 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/unroll-cond-5.wvr.c[2975,2988] [2022-12-06 18:43:32,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:43:32,147 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 18:43:32,165 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/unroll-cond-5.wvr.c[2975,2988] [2022-12-06 18:43:32,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 18:43:32,177 INFO L208 MainTranslator]: Completed translation [2022-12-06 18:43:32,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32 WrapperNode [2022-12-06 18:43:32,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 18:43:32,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 18:43:32,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 18:43:32,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 18:43:32,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,230 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 204 [2022-12-06 18:43:32,230 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 18:43:32,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 18:43:32,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 18:43:32,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 18:43:32,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,264 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 18:43:32,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 18:43:32,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 18:43:32,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 18:43:32,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (1/1) ... [2022-12-06 18:43:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 18:43:32,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:43:32,313 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 18:43:32,347 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 18:43:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 18:43:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 18:43:32,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 18:43:32,373 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 18:43:32,373 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 18:43:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 18:43:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 18:43:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 18:43:32,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 18:43:32,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 18:43:32,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 18:43:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 18:43:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 18:43:32,377 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 18:43:32,475 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 18:43:32,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 18:43:32,799 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 18:43:32,808 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 18:43:32,809 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 18:43:32,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:43:32 BoogieIcfgContainer [2022-12-06 18:43:32,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 18:43:32,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 18:43:32,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 18:43:32,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 18:43:32,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:43:32" (1/3) ... [2022-12-06 18:43:32,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a75e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:43:32, skipping insertion in model container [2022-12-06 18:43:32,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:43:32" (2/3) ... [2022-12-06 18:43:32,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a75e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:43:32, skipping insertion in model container [2022-12-06 18:43:32,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:43:32" (3/3) ... [2022-12-06 18:43:32,830 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2022-12-06 18:43:32,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 18:43:32,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 18:43:32,843 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 18:43:32,997 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 18:43:33,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 247 transitions, 510 flow [2022-12-06 18:43:33,135 INFO L130 PetriNetUnfolder]: 24/245 cut-off events. [2022-12-06 18:43:33,135 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 18:43:33,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 245 events. 24/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 480 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2022-12-06 18:43:33,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 247 transitions, 510 flow [2022-12-06 18:43:33,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 237 transitions, 486 flow [2022-12-06 18:43:33,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 18:43:33,181 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;@3e6937a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 18:43:33,181 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 18:43:33,251 INFO L130 PetriNetUnfolder]: 20/199 cut-off events. [2022-12-06 18:43:33,251 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 18:43:33,251 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:33,253 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] [2022-12-06 18:43:33,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2015579732, now seen corresponding path program 1 times [2022-12-06 18:43:33,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:33,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193504055] [2022-12-06 18:43:33,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:33,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:33,962 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 18:43:33,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:33,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193504055] [2022-12-06 18:43:33,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193504055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:33,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:33,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 18:43:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245061671] [2022-12-06 18:43:33,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:33,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 18:43:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:34,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 18:43:34,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 18:43:34,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 247 [2022-12-06 18:43:34,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 237 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 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 18:43:34,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:34,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 247 [2022-12-06 18:43:34,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:34,221 INFO L130 PetriNetUnfolder]: 214/937 cut-off events. [2022-12-06 18:43:34,222 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-12-06 18:43:34,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 937 events. 214/937 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4746 event pairs, 58 based on Foata normal form. 88/861 useless extension candidates. Maximal degree in co-relation 1225. Up to 274 conditions per place. [2022-12-06 18:43:34,234 INFO L137 encePairwiseOnDemand]: 224/247 looper letters, 49 selfloop transitions, 5 changer transitions 4/237 dead transitions. [2022-12-06 18:43:34,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 237 transitions, 600 flow [2022-12-06 18:43:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 18:43:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 18:43:34,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 848 transitions. [2022-12-06 18:43:34,252 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8582995951417004 [2022-12-06 18:43:34,256 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 3 predicate places. [2022-12-06 18:43:34,256 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 237 transitions, 600 flow [2022-12-06 18:43:34,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.25) internal successors, (781), 4 states have internal predecessors, (781), 0 states have call successors, (0), 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 18:43:34,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:34,257 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] [2022-12-06 18:43:34,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 18:43:34,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2098433417, now seen corresponding path program 1 times [2022-12-06 18:43:34,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:34,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140425468] [2022-12-06 18:43:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:34,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:34,845 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 18:43:34,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:34,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140425468] [2022-12-06 18:43:34,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140425468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:34,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:34,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 18:43:34,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091437297] [2022-12-06 18:43:34,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:34,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 18:43:34,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:34,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 18:43:34,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 18:43:34,852 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 247 [2022-12-06 18:43:34,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 237 transitions, 600 flow. Second operand has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 0 states have call successors, (0), 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 18:43:34,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:34,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 247 [2022-12-06 18:43:34,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:35,540 INFO L130 PetriNetUnfolder]: 586/2679 cut-off events. [2022-12-06 18:43:35,541 INFO L131 PetriNetUnfolder]: For 525/691 co-relation queries the response was YES. [2022-12-06 18:43:35,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 2679 events. 586/2679 cut-off events. For 525/691 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 20510 event pairs, 162 based on Foata normal form. 16/2355 useless extension candidates. Maximal degree in co-relation 4052. Up to 693 conditions per place. [2022-12-06 18:43:35,555 INFO L137 encePairwiseOnDemand]: 233/247 looper letters, 170 selfloop transitions, 35 changer transitions 4/384 dead transitions. [2022-12-06 18:43:35,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 384 transitions, 1568 flow [2022-12-06 18:43:35,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 18:43:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 18:43:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3221 transitions. [2022-12-06 18:43:35,562 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8150303643724697 [2022-12-06 18:43:35,562 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 18 predicate places. [2022-12-06 18:43:35,562 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 384 transitions, 1568 flow [2022-12-06 18:43:35,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 0 states have call successors, (0), 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 18:43:35,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:35,563 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] [2022-12-06 18:43:35,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 18:43:35,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 609886873, now seen corresponding path program 1 times [2022-12-06 18:43:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:35,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251360016] [2022-12-06 18:43:35,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:35,828 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 18:43:35,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:35,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251360016] [2022-12-06 18:43:35,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251360016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:35,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:35,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 18:43:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996346856] [2022-12-06 18:43:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:35,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 18:43:35,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 18:43:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 18:43:35,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:35,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 384 transitions, 1568 flow. Second operand has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 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 18:43:35,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:35,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:35,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:36,293 INFO L130 PetriNetUnfolder]: 590/2702 cut-off events. [2022-12-06 18:43:36,293 INFO L131 PetriNetUnfolder]: For 1012/1148 co-relation queries the response was YES. [2022-12-06 18:43:36,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5738 conditions, 2702 events. 590/2702 cut-off events. For 1012/1148 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 20701 event pairs, 166 based on Foata normal form. 18/2374 useless extension candidates. Maximal degree in co-relation 5508. Up to 697 conditions per place. [2022-12-06 18:43:36,308 INFO L137 encePairwiseOnDemand]: 239/247 looper letters, 197 selfloop transitions, 21 changer transitions 4/402 dead transitions. [2022-12-06 18:43:36,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 402 transitions, 2115 flow [2022-12-06 18:43:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 18:43:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 18:43:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1245 transitions. [2022-12-06 18:43:36,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.840080971659919 [2022-12-06 18:43:36,312 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 23 predicate places. [2022-12-06 18:43:36,312 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 402 transitions, 2115 flow [2022-12-06 18:43:36,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 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 18:43:36,312 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:36,313 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] [2022-12-06 18:43:36,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 18:43:36,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1562851441, now seen corresponding path program 2 times [2022-12-06 18:43:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24185604] [2022-12-06 18:43:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:36,507 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 18:43:36,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24185604] [2022-12-06 18:43:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24185604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:36,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:36,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 18:43:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682244111] [2022-12-06 18:43:36,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:36,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 18:43:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:36,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 18:43:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 18:43:36,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:36,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 402 transitions, 2115 flow. Second operand has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 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 18:43:36,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:36,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:36,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:36,887 INFO L130 PetriNetUnfolder]: 617/2816 cut-off events. [2022-12-06 18:43:36,888 INFO L131 PetriNetUnfolder]: For 1893/2330 co-relation queries the response was YES. [2022-12-06 18:43:36,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7108 conditions, 2816 events. 617/2816 cut-off events. For 1893/2330 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 21797 event pairs, 168 based on Foata normal form. 23/2483 useless extension candidates. Maximal degree in co-relation 5821. Up to 708 conditions per place. [2022-12-06 18:43:36,905 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 215 selfloop transitions, 24 changer transitions 4/423 dead transitions. [2022-12-06 18:43:36,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 423 transitions, 2752 flow [2022-12-06 18:43:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 18:43:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 18:43:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2022-12-06 18:43:36,908 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8404858299595142 [2022-12-06 18:43:36,910 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 27 predicate places. [2022-12-06 18:43:36,910 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 423 transitions, 2752 flow [2022-12-06 18:43:36,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.6) internal successors, (963), 5 states have internal predecessors, (963), 0 states have call successors, (0), 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 18:43:36,911 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:36,911 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] [2022-12-06 18:43:36,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 18:43:36,912 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:36,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash -872708585, now seen corresponding path program 3 times [2022-12-06 18:43:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:36,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192950107] [2022-12-06 18:43:36,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:37,320 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 18:43:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192950107] [2022-12-06 18:43:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192950107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:37,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:37,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 18:43:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359967879] [2022-12-06 18:43:37,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 18:43:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 18:43:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 18:43:37,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 247 [2022-12-06 18:43:37,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 423 transitions, 2752 flow. Second operand has 8 states, 8 states have (on average 192.375) internal successors, (1539), 8 states have internal predecessors, (1539), 0 states have call successors, (0), 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 18:43:37,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:37,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 247 [2022-12-06 18:43:37,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:37,843 INFO L130 PetriNetUnfolder]: 605/2826 cut-off events. [2022-12-06 18:43:37,843 INFO L131 PetriNetUnfolder]: For 2905/3491 co-relation queries the response was YES. [2022-12-06 18:43:37,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7953 conditions, 2826 events. 605/2826 cut-off events. For 2905/3491 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 21969 event pairs, 162 based on Foata normal form. 21/2498 useless extension candidates. Maximal degree in co-relation 6536. Up to 700 conditions per place. [2022-12-06 18:43:37,858 INFO L137 encePairwiseOnDemand]: 235/247 looper letters, 188 selfloop transitions, 38 changer transitions 4/445 dead transitions. [2022-12-06 18:43:37,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 445 transitions, 3437 flow [2022-12-06 18:43:37,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 18:43:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 18:43:37,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1977 transitions. [2022-12-06 18:43:37,861 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8004048582995952 [2022-12-06 18:43:37,862 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 36 predicate places. [2022-12-06 18:43:37,862 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 445 transitions, 3437 flow [2022-12-06 18:43:37,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 192.375) internal successors, (1539), 8 states have internal predecessors, (1539), 0 states have call successors, (0), 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 18:43:37,863 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:37,863 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] [2022-12-06 18:43:37,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 18:43:37,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2108341935, now seen corresponding path program 1 times [2022-12-06 18:43:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:37,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847448804] [2022-12-06 18:43:37,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:38,062 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 18:43:38,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:38,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847448804] [2022-12-06 18:43:38,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847448804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:38,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:38,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:43:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520059600] [2022-12-06 18:43:38,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:38,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:43:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:43:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:43:38,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:38,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 445 transitions, 3437 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:38,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:38,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:38,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:38,440 INFO L130 PetriNetUnfolder]: 642/2992 cut-off events. [2022-12-06 18:43:38,440 INFO L131 PetriNetUnfolder]: For 4471/5430 co-relation queries the response was YES. [2022-12-06 18:43:38,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9571 conditions, 2992 events. 642/2992 cut-off events. For 4471/5430 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23667 event pairs, 165 based on Foata normal form. 31/2662 useless extension candidates. Maximal degree in co-relation 7735. Up to 743 conditions per place. [2022-12-06 18:43:38,465 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 255 selfloop transitions, 27 changer transitions 4/467 dead transitions. [2022-12-06 18:43:38,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 467 transitions, 4241 flow [2022-12-06 18:43:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 18:43:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 18:43:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2022-12-06 18:43:38,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8360323886639676 [2022-12-06 18:43:38,469 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 41 predicate places. [2022-12-06 18:43:38,469 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 467 transitions, 4241 flow [2022-12-06 18:43:38,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:38,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:38,470 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] [2022-12-06 18:43:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 18:43:38,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:38,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2128224293, now seen corresponding path program 2 times [2022-12-06 18:43:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903399630] [2022-12-06 18:43:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:38,681 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 18:43:38,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:38,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903399630] [2022-12-06 18:43:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903399630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:38,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:38,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:43:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068537153] [2022-12-06 18:43:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:38,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:43:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:43:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:43:38,684 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:38,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 467 transitions, 4241 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:38,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:38,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:38,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:39,068 INFO L130 PetriNetUnfolder]: 697/3237 cut-off events. [2022-12-06 18:43:39,068 INFO L131 PetriNetUnfolder]: For 7140/8057 co-relation queries the response was YES. [2022-12-06 18:43:39,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11696 conditions, 3237 events. 697/3237 cut-off events. For 7140/8057 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 26205 event pairs, 179 based on Foata normal form. 27/2880 useless extension candidates. Maximal degree in co-relation 11354. Up to 977 conditions per place. [2022-12-06 18:43:39,093 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 297 selfloop transitions, 27 changer transitions 4/509 dead transitions. [2022-12-06 18:43:39,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 509 transitions, 5449 flow [2022-12-06 18:43:39,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 18:43:39,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 18:43:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1222 transitions. [2022-12-06 18:43:39,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8245614035087719 [2022-12-06 18:43:39,096 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 46 predicate places. [2022-12-06 18:43:39,096 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 509 transitions, 5449 flow [2022-12-06 18:43:39,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:39,097 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:39,097 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] [2022-12-06 18:43:39,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 18:43:39,097 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash -252683507, now seen corresponding path program 3 times [2022-12-06 18:43:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:39,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322349911] [2022-12-06 18:43:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:39,263 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 18:43:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322349911] [2022-12-06 18:43:39,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322349911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:39,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:39,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 18:43:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22076020] [2022-12-06 18:43:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:39,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 18:43:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 18:43:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 18:43:39,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:39,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 509 transitions, 5449 flow. Second operand has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 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 18:43:39,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:39,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:39,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:39,669 INFO L130 PetriNetUnfolder]: 673/3110 cut-off events. [2022-12-06 18:43:39,670 INFO L131 PetriNetUnfolder]: For 9139/10386 co-relation queries the response was YES. [2022-12-06 18:43:39,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12451 conditions, 3110 events. 673/3110 cut-off events. For 9139/10386 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24749 event pairs, 158 based on Foata normal form. 21/2747 useless extension candidates. Maximal degree in co-relation 12101. Up to 1035 conditions per place. [2022-12-06 18:43:39,695 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 279 selfloop transitions, 22 changer transitions 4/486 dead transitions. [2022-12-06 18:43:39,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 486 transitions, 5656 flow [2022-12-06 18:43:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 18:43:39,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 18:43:39,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1014 transitions. [2022-12-06 18:43:39,698 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8210526315789474 [2022-12-06 18:43:39,700 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 50 predicate places. [2022-12-06 18:43:39,700 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 486 transitions, 5656 flow [2022-12-06 18:43:39,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 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 18:43:39,701 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:39,701 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] [2022-12-06 18:43:39,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 18:43:39,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -419473109, now seen corresponding path program 4 times [2022-12-06 18:43:39,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:39,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340175753] [2022-12-06 18:43:39,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:39,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:39,891 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 18:43:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:39,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340175753] [2022-12-06 18:43:39,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340175753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:39,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:39,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:43:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721820571] [2022-12-06 18:43:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:39,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:43:39,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:43:39,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:43:39,894 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:39,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 486 transitions, 5656 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:39,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:39,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:39,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:40,329 INFO L130 PetriNetUnfolder]: 716/3324 cut-off events. [2022-12-06 18:43:40,330 INFO L131 PetriNetUnfolder]: For 11693/12507 co-relation queries the response was YES. [2022-12-06 18:43:40,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14449 conditions, 3324 events. 716/3324 cut-off events. For 11693/12507 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 27061 event pairs, 168 based on Foata normal form. 24/2959 useless extension candidates. Maximal degree in co-relation 13099. Up to 1102 conditions per place. [2022-12-06 18:43:40,354 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 300 selfloop transitions, 23 changer transitions 4/508 dead transitions. [2022-12-06 18:43:40,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 508 transitions, 6674 flow [2022-12-06 18:43:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 18:43:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 18:43:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1213 transitions. [2022-12-06 18:43:40,356 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8184885290148448 [2022-12-06 18:43:40,357 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 55 predicate places. [2022-12-06 18:43:40,357 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 508 transitions, 6674 flow [2022-12-06 18:43:40,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:40,358 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:40,358 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] [2022-12-06 18:43:40,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 18:43:40,358 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1870966971, now seen corresponding path program 5 times [2022-12-06 18:43:40,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:40,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229549931] [2022-12-06 18:43:40,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:40,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:40,599 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 18:43:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:40,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229549931] [2022-12-06 18:43:40,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229549931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:40,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 18:43:40,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 18:43:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075306864] [2022-12-06 18:43:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 18:43:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 18:43:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 18:43:40,602 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 247 [2022-12-06 18:43:40,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 508 transitions, 6674 flow. Second operand has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:40,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:40,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 247 [2022-12-06 18:43:40,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:41,073 INFO L130 PetriNetUnfolder]: 705/3290 cut-off events. [2022-12-06 18:43:41,074 INFO L131 PetriNetUnfolder]: For 14251/15121 co-relation queries the response was YES. [2022-12-06 18:43:41,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15559 conditions, 3290 events. 705/3290 cut-off events. For 14251/15121 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 26883 event pairs, 186 based on Foata normal form. 22/2933 useless extension candidates. Maximal degree in co-relation 13858. Up to 1088 conditions per place. [2022-12-06 18:43:41,100 INFO L137 encePairwiseOnDemand]: 240/247 looper letters, 289 selfloop transitions, 29 changer transitions 4/503 dead transitions. [2022-12-06 18:43:41,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 503 transitions, 7207 flow [2022-12-06 18:43:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 18:43:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 18:43:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1419 transitions. [2022-12-06 18:43:41,104 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8207056101792944 [2022-12-06 18:43:41,104 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 61 predicate places. [2022-12-06 18:43:41,104 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 503 transitions, 7207 flow [2022-12-06 18:43:41,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.33333333333334) internal successors, (1154), 6 states have internal predecessors, (1154), 0 states have call successors, (0), 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 18:43:41,105 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:41,105 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] [2022-12-06 18:43:41,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 18:43:41,106 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:41,106 INFO L85 PathProgramCache]: Analyzing trace with hash 369742125, now seen corresponding path program 1 times [2022-12-06 18:43:41,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:41,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797729628] [2022-12-06 18:43:41,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:41,312 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 18:43:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:41,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797729628] [2022-12-06 18:43:41,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797729628] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:43:41,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115694773] [2022-12-06 18:43:41,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:43:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:43:41,321 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 18:43:41,327 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 18:43:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:41,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 18:43:41,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:43:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:43:41,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 18:43:41,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115694773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 18:43:41,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 18:43:41,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-12-06 18:43:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143558379] [2022-12-06 18:43:41,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 18:43:41,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 18:43:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:41,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 18:43:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-06 18:43:41,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 247 [2022-12-06 18:43:41,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 503 transitions, 7207 flow. Second operand has 8 states, 8 states have (on average 167.5) internal successors, (1340), 8 states have internal predecessors, (1340), 0 states have call successors, (0), 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 18:43:41,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:41,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 247 [2022-12-06 18:43:41,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:43:42,270 INFO L130 PetriNetUnfolder]: 1177/4647 cut-off events. [2022-12-06 18:43:42,270 INFO L131 PetriNetUnfolder]: For 32631/34550 co-relation queries the response was YES. [2022-12-06 18:43:42,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23029 conditions, 4647 events. 1177/4647 cut-off events. For 32631/34550 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 39775 event pairs, 376 based on Foata normal form. 6/4149 useless extension candidates. Maximal degree in co-relation 19972. Up to 1339 conditions per place. [2022-12-06 18:43:42,297 INFO L137 encePairwiseOnDemand]: 225/247 looper letters, 74 selfloop transitions, 15 changer transitions 49/553 dead transitions. [2022-12-06 18:43:42,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 553 transitions, 8334 flow [2022-12-06 18:43:42,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 18:43:42,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 18:43:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1730 transitions. [2022-12-06 18:43:42,300 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7004048582995951 [2022-12-06 18:43:42,300 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 70 predicate places. [2022-12-06 18:43:42,300 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 553 transitions, 8334 flow [2022-12-06 18:43:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.5) internal successors, (1340), 8 states have internal predecessors, (1340), 0 states have call successors, (0), 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 18:43:42,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:43:42,301 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] [2022-12-06 18:43:42,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 18:43:42,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 18:43:42,508 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:43:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:43:42,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1911845932, now seen corresponding path program 1 times [2022-12-06 18:43:42,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:43:42,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848374569] [2022-12-06 18:43:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:42,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:43:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:43:42,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:43:42,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848374569] [2022-12-06 18:43:42,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848374569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:43:42,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609390299] [2022-12-06 18:43:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:43:42,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:43:42,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:43:42,787 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 18:43:42,855 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 18:43:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:43:42,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 18:43:42,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:43:43,342 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-06 18:43:43,342 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 19 treesize of output 10 [2022-12-06 18:43:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:43:43,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:43:43,800 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 18:43:43,800 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 19 treesize of output 11 [2022-12-06 18:43:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:43:44,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609390299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:43:44,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:43:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 18] total 35 [2022-12-06 18:43:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707189556] [2022-12-06 18:43:44,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:43:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 18:43:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:43:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 18:43:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2022-12-06 18:43:44,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 247 [2022-12-06 18:43:44,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 553 transitions, 8334 flow. Second operand has 35 states, 35 states have (on average 83.6) internal successors, (2926), 35 states have internal predecessors, (2926), 0 states have call successors, (0), 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 18:43:44,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:43:44,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 247 [2022-12-06 18:43:44,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:44:05,100 INFO L130 PetriNetUnfolder]: 33597/68310 cut-off events. [2022-12-06 18:44:05,101 INFO L131 PetriNetUnfolder]: For 460863/461825 co-relation queries the response was YES. [2022-12-06 18:44:05,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307402 conditions, 68310 events. 33597/68310 cut-off events. For 460863/461825 co-relation queries the response was YES. Maximal size of possible extension queue 984. Compared 693273 event pairs, 1893 based on Foata normal form. 102/62556 useless extension candidates. Maximal degree in co-relation 212039. Up to 14140 conditions per place. [2022-12-06 18:44:05,622 INFO L137 encePairwiseOnDemand]: 165/247 looper letters, 3234 selfloop transitions, 791 changer transitions 1241/5339 dead transitions. [2022-12-06 18:44:05,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 5339 transitions, 77612 flow [2022-12-06 18:44:05,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2022-12-06 18:44:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2022-12-06 18:44:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 19909 transitions. [2022-12-06 18:44:05,660 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3784189618140693 [2022-12-06 18:44:05,661 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 282 predicate places. [2022-12-06 18:44:05,661 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 5339 transitions, 77612 flow [2022-12-06 18:44:05,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 83.6) internal successors, (2926), 35 states have internal predecessors, (2926), 0 states have call successors, (0), 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 18:44:05,662 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:44:05,662 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] [2022-12-06 18:44:05,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 18:44:05,867 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,SelfDestructingSolverStorable11 [2022-12-06 18:44:05,868 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:44:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:44:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash -901076196, now seen corresponding path program 2 times [2022-12-06 18:44:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:44:05,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376921324] [2022-12-06 18:44:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:44:05,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:44:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:44:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:44:06,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:44:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376921324] [2022-12-06 18:44:06,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376921324] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:44:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69895970] [2022-12-06 18:44:06,217 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 18:44:06,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:44:06,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:44:06,220 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 18:44:06,222 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 18:44:06,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 18:44:06,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:44:06,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 18:44:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:44:06,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 18:44:06,782 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 18:44:06,838 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 18:44:07,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:44:07,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:44:07,097 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 17 treesize of output 10 [2022-12-06 18:44:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:44:07,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:44:07,633 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_171) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_172) c_~f~0.base))) (= (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)) (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))))))) is different from false [2022-12-06 18:44:07,725 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (or (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_171) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-12-06 18:44:07,735 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_171 (Array Int Int)) (v_ArrVal_172 (Array Int Int))) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_171) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_172) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse0 (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2022-12-06 18:44:07,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:44:07,999 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 55 treesize of output 44 [2022-12-06 18:44:08,007 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-06 18:44:08,007 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 198 treesize of output 173 [2022-12-06 18:44:08,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 18:44:08,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 59 [2022-12-06 18:44:08,019 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 18:44:08,019 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 142 treesize of output 94 [2022-12-06 18:44:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:44:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69895970] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:44:08,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:44:08,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 24] total 50 [2022-12-06 18:44:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137662193] [2022-12-06 18:44:08,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:44:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-06 18:44:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:44:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-06 18:44:08,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1949, Unknown=14, NotChecked=276, Total=2450 [2022-12-06 18:44:08,313 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 247 [2022-12-06 18:44:08,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 5339 transitions, 77612 flow. Second operand has 50 states, 50 states have (on average 68.14) internal successors, (3407), 50 states have internal predecessors, (3407), 0 states have call successors, (0), 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 18:44:08,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:44:08,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 247 [2022-12-06 18:44:08,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:45:22,084 INFO L130 PetriNetUnfolder]: 54620/112599 cut-off events. [2022-12-06 18:45:22,084 INFO L131 PetriNetUnfolder]: For 747476/750986 co-relation queries the response was YES. [2022-12-06 18:45:22,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580989 conditions, 112599 events. 54620/112599 cut-off events. For 747476/750986 co-relation queries the response was YES. Maximal size of possible extension queue 2270. Compared 1243592 event pairs, 2312 based on Foata normal form. 735/104703 useless extension candidates. Maximal degree in co-relation 419128. Up to 28687 conditions per place. [2022-12-06 18:45:23,057 INFO L137 encePairwiseOnDemand]: 155/247 looper letters, 6964 selfloop transitions, 1497 changer transitions 3107/11631 dead transitions. [2022-12-06 18:45:23,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 11631 transitions, 175767 flow [2022-12-06 18:45:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2022-12-06 18:45:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2022-12-06 18:45:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 23199 transitions. [2022-12-06 18:45:23,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2972249269717624 [2022-12-06 18:45:23,120 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 597 predicate places. [2022-12-06 18:45:23,120 INFO L495 AbstractCegarLoop]: Abstraction has has 817 places, 11631 transitions, 175767 flow [2022-12-06 18:45:23,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 68.14) internal successors, (3407), 50 states have internal predecessors, (3407), 0 states have call successors, (0), 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 18:45:23,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:45:23,121 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] [2022-12-06 18:45:23,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 18:45:23,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:45:23,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:45:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:45:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1613885000, now seen corresponding path program 3 times [2022-12-06 18:45:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:45:23,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139428856] [2022-12-06 18:45:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:45:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:45:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:45:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:45:23,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:45:23,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139428856] [2022-12-06 18:45:23,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139428856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:45:23,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361370420] [2022-12-06 18:45:23,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 18:45:23,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:45:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:45:23,855 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 18:45:23,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 18:45:23,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 18:45:23,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:45:23,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-06 18:45:23,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:45:24,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-06 18:45:24,558 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 18:45:24,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:45:24,647 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 14 treesize of output 16 [2022-12-06 18:45:24,938 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-06 18:45:24,938 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 19 treesize of output 10 [2022-12-06 18:45:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:45:25,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:45:26,017 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_199 (Array Int Int)) (v_ArrVal_200 (Array Int Int))) (or (< ~x2~0 0) (<= c_~size~0 ~x2~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_199))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2022-12-06 18:45:26,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:45:26,302 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 52 treesize of output 41 [2022-12-06 18:45:26,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:45:26,309 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 202 treesize of output 166 [2022-12-06 18:45:26,334 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 154 treesize of output 130 [2022-12-06 18:45:26,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:45:26,342 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 130 treesize of output 106 [2022-12-06 18:45:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:45:27,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361370420] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:45:27,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:45:27,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27, 27] total 55 [2022-12-06 18:45:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243424992] [2022-12-06 18:45:27,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:45:27,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-06 18:45:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:45:27,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-06 18:45:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2651, Unknown=37, NotChecked=104, Total=2970 [2022-12-06 18:45:27,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 247 [2022-12-06 18:45:27,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 817 places, 11631 transitions, 175767 flow. Second operand has 55 states, 55 states have (on average 67.76363636363637) internal successors, (3727), 55 states have internal predecessors, (3727), 0 states have call successors, (0), 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 18:45:27,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:45:27,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 247 [2022-12-06 18:45:27,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:48:32,133 INFO L130 PetriNetUnfolder]: 72361/149332 cut-off events. [2022-12-06 18:48:32,133 INFO L131 PetriNetUnfolder]: For 1068599/1076665 co-relation queries the response was YES. [2022-12-06 18:48:32,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895234 conditions, 149332 events. 72361/149332 cut-off events. For 1068599/1076665 co-relation queries the response was YES. Maximal size of possible extension queue 2776. Compared 1710272 event pairs, 2621 based on Foata normal form. 1732/139991 useless extension candidates. Maximal degree in co-relation 662880. Up to 45959 conditions per place. [2022-12-06 18:48:33,000 INFO L137 encePairwiseOnDemand]: 155/247 looper letters, 9227 selfloop transitions, 3220 changer transitions 5036/17546 dead transitions. [2022-12-06 18:48:33,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1245 places, 17546 transitions, 284363 flow [2022-12-06 18:48:33,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 429 states. [2022-12-06 18:48:33,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2022-12-06 18:48:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 31862 transitions. [2022-12-06 18:48:33,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3006898634428999 [2022-12-06 18:48:33,022 INFO L294 CegarLoopForPetriNet]: 220 programPoint places, 1025 predicate places. [2022-12-06 18:48:33,022 INFO L495 AbstractCegarLoop]: Abstraction has has 1245 places, 17546 transitions, 284363 flow [2022-12-06 18:48:33,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 67.76363636363637) internal successors, (3727), 55 states have internal predecessors, (3727), 0 states have call successors, (0), 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 18:48:33,023 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 18:48:33,023 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] [2022-12-06 18:48:33,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 18:48:33,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:48:33,228 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 18:48:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 18:48:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -782946712, now seen corresponding path program 4 times [2022-12-06 18:48:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 18:48:33,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861761853] [2022-12-06 18:48:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 18:48:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 18:48:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 18:48:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 18:48:33,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 18:48:33,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861761853] [2022-12-06 18:48:33,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861761853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 18:48:33,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609019475] [2022-12-06 18:48:33,549 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 18:48:33,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 18:48:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 18:48:33,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 18:48:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 18:48:33,628 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 18:48:33,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 18:48:33,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-06 18:48:33,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 18:48:34,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 18:48:34,136 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 14 treesize of output 16 [2022-12-06 18:48:34,538 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-06 18:48:34,539 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2022-12-06 18:48:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:48:34,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 18:48:35,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:48:35,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 160 [2022-12-06 18:48:35,129 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 18:48:35,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2022-12-06 18:48:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 18:48:36,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609019475] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 18:48:36,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 18:48:36,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 28, 30] total 59 [2022-12-06 18:48:36,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108594652] [2022-12-06 18:48:36,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 18:48:36,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-06 18:48:36,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 18:48:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-06 18:48:36,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3172, Unknown=9, NotChecked=0, Total=3422 [2022-12-06 18:48:36,525 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 247 [2022-12-06 18:48:36,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1245 places, 17546 transitions, 284363 flow. Second operand has 59 states, 59 states have (on average 67.69491525423729) internal successors, (3994), 59 states have internal predecessors, (3994), 0 states have call successors, (0), 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 18:48:36,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 18:48:36,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 247 [2022-12-06 18:48:36,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 18:48:48,965 WARN L233 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 90 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:49:03,156 WARN L233 SmtUtils]: Spent 14.12s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:49:15,960 WARN L233 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 91 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:49:28,257 WARN L233 SmtUtils]: Spent 12.24s on a formula simplification. DAG size of input: 93 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:49:40,586 WARN L233 SmtUtils]: Spent 12.26s on a formula simplification. DAG size of input: 94 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:50:53,940 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse5 (+ (* c_~x2~0 4) c_~f~0.offset))) (let ((.cse0 (select .cse1 .cse5))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset)))) (and (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) c_~x1~0) (<= c_~size~0 .cse0)) (or (= c_~x1~0 .cse2) (= 0 |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|)) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse5))) (or (<= c_~size~0 .cse3) (= c_~x1~0 (select .cse4 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse3 4))) 4) c_~f~0.offset))) (< .cse3 0))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (<= c_~size~0 .cse6) (< .cse6 0) (= (select .cse7 (+ (* (select .cse7 (+ c_~f~0.offset (* .cse6 4))) 4) c_~f~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|))))))))) is different from false [2022-12-06 18:50:56,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse5 (+ (* c_~x2~0 4) c_~f~0.offset))) (let ((.cse0 (select .cse1 .cse5))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset)))) (and (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) c_~x1~0) (<= c_~size~0 .cse0)) (or (= c_~x1~0 .cse2) (= 0 |c_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1|)) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse5))) (or (<= c_~size~0 .cse3) (= c_~x1~0 (select .cse4 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse3 4))) 4) c_~f~0.offset))) (< .cse3 0))))))))) is different from false [2022-12-06 18:51:03,070 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:51:06,203 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse2 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (let ((.cse0 (select .cse1 .cse2))) (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* 4 (select .cse1 (+ (* .cse0 4) c_~f~0.offset))))) c_~x1~0) (<= c_~size~0 .cse0))) (or (= (select .cse1 (+ (* 4 (select .cse1 (+ (* |c_thread2Thread1of1ForFork1_#t~mem13#1| 4) c_~f~0.offset))) c_~f~0.offset)) c_~x1~0) (< |c_thread2Thread1of1ForFork1_#t~mem13#1| 0) (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem13#1|)) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse2))) (or (<= c_~size~0 .cse3) (= c_~x1~0 (select .cse4 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse3 4))) 4) c_~f~0.offset))) (< .cse3 0))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse5 (select .cse6 .cse2))) (or (<= c_~size~0 .cse5) (< .cse5 0) (= (select .cse6 (+ (* (select .cse6 (+ c_~f~0.offset (* .cse5 4))) 4) c_~f~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|))))))) is different from false [2022-12-06 18:51:16,547 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:51:40,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:52:19,217 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 18:52:19,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse5 (+ (* c_~x2~0 4) c_~f~0.offset))) (let ((.cse0 (select .cse1 .cse5))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset)))) (and (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) c_~x1~0) (<= c_~size~0 .cse0)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse2) (< c_~x2~0 0)) (or (= (select .cse1 (+ (* 4 (select .cse1 (+ (* |c_thread2Thread1of1ForFork1_#t~mem13#1| 4) c_~f~0.offset))) c_~f~0.offset)) c_~x1~0) (< |c_thread2Thread1of1ForFork1_#t~mem13#1| 0) (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem13#1|)) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse5))) (or (<= c_~size~0 .cse3) (= c_~x1~0 (select .cse4 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse3 4))) 4) c_~f~0.offset))) (< .cse3 0))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse6 (select .cse7 .cse5))) (or (<= c_~size~0 .cse6) (< .cse6 0) (= (select .cse7 (+ (* (select .cse7 (+ c_~f~0.offset (* .cse6 4))) 4) c_~f~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|))))))))) is different from false [2022-12-06 18:52:22,061 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] [2022-12-06 18:52:24,097 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 18:52:30,405 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:52:32,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:52:34,504 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 18:52:50,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:52:52,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:52:54,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:52:56,440 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 18:53:03,763 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 18:53:05,939 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 18:53:06,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse5 (+ (* c_~x2~0 4) c_~f~0.offset))) (let ((.cse0 (select .cse1 .cse5))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset)))) (and (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) c_~x1~0) (<= c_~size~0 .cse0)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse2) (< c_~x2~0 0)) (or (= (select .cse1 (+ (* 4 (select .cse1 (+ (* |c_thread2Thread1of1ForFork1_#t~mem13#1| 4) c_~f~0.offset))) c_~f~0.offset)) c_~x1~0) (< |c_thread2Thread1of1ForFork1_#t~mem13#1| 0) (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem13#1|)) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse3 (select .cse4 .cse5))) (or (<= c_~size~0 .cse3) (= c_~x1~0 (select .cse4 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse3 4))) 4) c_~f~0.offset))) (< .cse3 0))))))))) is different from false [2022-12-06 18:53:13,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:53:15,659 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 18:53:23,119 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 18:53:25,330 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 18:53:36,691 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 18:53:38,880 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 18:53:50,875 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 18:53:53,013 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 18:54:00,110 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 18:54:06,375 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 18:54:18,068 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 18:54:20,080 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 18:54:24,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:54:26,373 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 18:54:33,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:54:35,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:54:40,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:54:42,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:54:49,475 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 18:54:51,649 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 18:54:51,677 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse6 (+ (* c_~x2~0 4) c_~f~0.offset))) (let ((.cse0 (select .cse1 .cse6))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset)))) (let ((.cse3 (= c_~x1~0 .cse2))) (and (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) c_~x1~0) (<= c_~size~0 .cse0)) (or .cse3 (= |c_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (<= c_~size~0 c_~x2~0) .cse3 (< c_~x2~0 0)) (or (= (select .cse1 (+ (* 4 (select .cse1 (+ (* |c_thread2Thread1of1ForFork1_#t~mem13#1| 4) c_~f~0.offset))) c_~f~0.offset)) c_~x1~0) (< |c_thread2Thread1of1ForFork1_#t~mem13#1| 0) (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem13#1|)) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225) c_~f~0.base))) (let ((.cse4 (select .cse5 .cse6))) (or (<= c_~size~0 .cse4) (= c_~x1~0 (select .cse5 (+ (* (select .cse5 (+ c_~f~0.offset (* .cse4 4))) 4) c_~f~0.offset))) (< .cse4 0)))))))))) is different from false [2022-12-06 18:55:00,069 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 18:55:14,777 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 18:56:02,039 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 18:56:04,082 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 18:56:06,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:56:08,358 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 18:56:10,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:56:18,671 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 18:56:20,684 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 18:56:22,703 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 18:56:31,481 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 18:56:33,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:56:35,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 18:56:37,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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 18:56:40,613 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 18:56:40,613 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 18:56:41,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 18:56:41,820 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 18:56:41,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-06 18:56:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 340 states. [2022-12-06 18:56:41,838 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 18:56:41,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 18:56:41,838 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 18:56:41,839 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 18:56:41,839 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 18:56:41,839 INFO L458 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1] [2022-12-06 18:56:41,841 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 18:56:41,841 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 18:56:41,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:56:41 BasicIcfg [2022-12-06 18:56:41,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 18:56:41,859 INFO L158 Benchmark]: Toolchain (without parser) took 789840.70ms. Allocated memory was 179.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 155.7MB in the beginning and 609.0MB in the end (delta: -453.3MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 18:56:41,859 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory was 155.5MB in the beginning and 155.3MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 18:56:41,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.48ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 143.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 18:56:41,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.43ms. Allocated memory is still 179.3MB. Free memory was 143.2MB in the beginning and 140.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:56:41,862 INFO L158 Benchmark]: Boogie Preprocessor took 35.22ms. Allocated memory is still 179.3MB. Free memory was 140.5MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 18:56:41,862 INFO L158 Benchmark]: RCFGBuilder took 543.25ms. Allocated memory is still 179.3MB. Free memory was 139.0MB in the beginning and 118.5MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 18:56:41,862 INFO L158 Benchmark]: TraceAbstraction took 789018.31ms. Allocated memory was 179.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 118.0MB in the beginning and 609.0MB in the end (delta: -491.0MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-06 18:56:41,863 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory was 155.5MB in the beginning and 155.3MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.48ms. Allocated memory is still 179.3MB. Free memory was 155.2MB in the beginning and 143.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.43ms. Allocated memory is still 179.3MB. Free memory was 143.2MB in the beginning and 140.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.22ms. Allocated memory is still 179.3MB. Free memory was 140.5MB in the beginning and 139.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 543.25ms. Allocated memory is still 179.3MB. Free memory was 139.0MB in the beginning and 118.5MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 789018.31ms. Allocated memory was 179.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 118.0MB in the beginning and 609.0MB in the end (delta: -491.0MB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: 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 5 procedures, 360 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 788.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 772.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 150 mSolverCounterUnknown, 34932 SdHoareTripleChecker+Valid, 119.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34932 mSDsluCounter, 43999 SdHoareTripleChecker+Invalid, 115.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5410 IncrementalHoareTripleChecker+Unchecked, 41657 mSDsCounter, 1696 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50725 IncrementalHoareTripleChecker+Invalid, 57981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1696 mSolverCounterUnsat, 2342 mSDtfsCounter, 50725 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2639 GetRequests, 1115 SyntacticMatches, 9 SemanticMatches, 1514 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 222926 ImplicationChecksByTransitivity, 283.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284363occurred in iteration=14, InterpolantAutomatonStates: 1039, 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.6s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 2408 NumberOfCodeBlocks, 2408 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2924 ConstructedInterpolants, 165 QuantifiedInterpolants, 24553 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1392 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 5/26 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