/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 07:51:05,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 07:51:05,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 07:51:05,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 07:51:05,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 07:51:05,386 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 07:51:05,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 07:51:05,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 07:51:05,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 07:51:05,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 07:51:05,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 07:51:05,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 07:51:05,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 07:51:05,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 07:51:05,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 07:51:05,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 07:51:05,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 07:51:05,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 07:51:05,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 07:51:05,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 07:51:05,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 07:51:05,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 07:51:05,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 07:51:05,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 07:51:05,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 07:51:05,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 07:51:05,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 07:51:05,422 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 07:51:05,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 07:51:05,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 07:51:05,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 07:51:05,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 07:51:05,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 07:51:05,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 07:51:05,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 07:51:05,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 07:51:05,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 07:51:05,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 07:51:05,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 07:51:05,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 07:51:05,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 07:51:05,429 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-Before.epf [2022-01-19 07:51:05,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 07:51:05,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 07:51:05,466 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 07:51:05,466 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 07:51:05,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 07:51:05,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 07:51:05,467 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 07:51:05,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 07:51:05,468 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:51:05,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 07:51:05,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 07:51:05,470 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 07:51:05,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 07:51:05,470 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 07:51:05,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 07:51:05,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 07:51:05,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 07:51:05,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 07:51:05,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 07:51:05,693 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 07:51:05,695 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-01-19 07:51:05,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe76fb2c8/3a9be5e4df97477dad35b40615e5b0fb/FLAG79eafcdbd [2022-01-19 07:51:06,181 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 07:51:06,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-01-19 07:51:06,195 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe76fb2c8/3a9be5e4df97477dad35b40615e5b0fb/FLAG79eafcdbd [2022-01-19 07:51:06,215 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe76fb2c8/3a9be5e4df97477dad35b40615e5b0fb [2022-01-19 07:51:06,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 07:51:06,219 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 07:51:06,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 07:51:06,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 07:51:06,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 07:51:06,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec67e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06, skipping insertion in model container [2022-01-19 07:51:06,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 07:51:06,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 07:51:06,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-01-19 07:51:06,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:51:06,447 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 07:51:06,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-01-19 07:51:06,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 07:51:06,481 INFO L208 MainTranslator]: Completed translation [2022-01-19 07:51:06,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06 WrapperNode [2022-01-19 07:51:06,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 07:51:06,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 07:51:06,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 07:51:06,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 07:51:06,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,515 INFO L137 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-01-19 07:51:06,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 07:51:06,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 07:51:06,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 07:51:06,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 07:51:06,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 07:51:06,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 07:51:06,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 07:51:06,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 07:51:06,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (1/1) ... [2022-01-19 07:51:06,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 07:51:06,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:51:06,571 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-01-19 07:51:06,576 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-01-19 07:51:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 07:51:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 07:51:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 07:51:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 07:51:06,601 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 07:51:06,601 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 07:51:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 07:51:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 07:51:06,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 07:51:06,604 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 07:51:06,677 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 07:51:06,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 07:51:06,937 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 07:51:07,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 07:51:07,050 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 07:51:07,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:51:07 BoogieIcfgContainer [2022-01-19 07:51:07,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 07:51:07,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 07:51:07,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 07:51:07,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 07:51:07,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 07:51:06" (1/3) ... [2022-01-19 07:51:07,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71350c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:51:07, skipping insertion in model container [2022-01-19 07:51:07,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 07:51:06" (2/3) ... [2022-01-19 07:51:07,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71350c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 07:51:07, skipping insertion in model container [2022-01-19 07:51:07,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 07:51:07" (3/3) ... [2022-01-19 07:51:07,059 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-01-19 07:51:07,064 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 07:51:07,064 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 07:51:07,064 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 07:51:07,106 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,107 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,108 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,109 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,110 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,114 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,115 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,116 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,117 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,127 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,136 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,137 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,145 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,146 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,147 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,148 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,149 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 07:51:07,151 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 07:51:07,195 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 07:51:07,203 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 07:51:07,203 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 07:51:07,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 254 flow [2022-01-19 07:51:07,256 INFO L129 PetriNetUnfolder]: 9/117 cut-off events. [2022-01-19 07:51:07,256 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 07:51:07,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 9/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-01-19 07:51:07,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 254 flow [2022-01-19 07:51:07,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 108 transitions, 228 flow [2022-01-19 07:51:07,288 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2022-01-19 07:51:07,288 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 07:51:07,288 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:07,289 INFO L254 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] [2022-01-19 07:51:07,289 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1888672242, now seen corresponding path program 1 times [2022-01-19 07:51:07,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:07,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123978759] [2022-01-19 07:51:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:07,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:51:07,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:07,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123978759] [2022-01-19 07:51:07,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123978759] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:51:07,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:51:07,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 07:51:07,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80135430] [2022-01-19 07:51:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:51:07,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 07:51:07,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 07:51:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 07:51:07,756 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2022-01-19 07:51:07,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 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-01-19 07:51:07,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:07,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2022-01-19 07:51:07,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:07,938 INFO L129 PetriNetUnfolder]: 26/185 cut-off events. [2022-01-19 07:51:07,938 INFO L130 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2022-01-19 07:51:07,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 185 events. 26/185 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 447 event pairs, 6 based on Foata normal form. 22/193 useless extension candidates. Maximal degree in co-relation 122. Up to 39 conditions per place. [2022-01-19 07:51:07,943 INFO L132 encePairwiseOnDemand]: 104/119 looper letters, 24 selfloop transitions, 3 changer transitions 8/113 dead transitions. [2022-01-19 07:51:07,943 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 113 transitions, 317 flow [2022-01-19 07:51:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:51:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:51:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2022-01-19 07:51:07,964 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7935174069627852 [2022-01-19 07:51:07,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2022-01-19 07:51:07,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2022-01-19 07:51:07,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:07,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2022-01-19 07:51:07,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 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-01-19 07:51:07,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-01-19 07:51:07,987 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-01-19 07:51:07,988 INFO L186 Difference]: Start difference. First operand has 106 places, 108 transitions, 228 flow. Second operand 7 states and 661 transitions. [2022-01-19 07:51:07,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 113 transitions, 317 flow [2022-01-19 07:51:07,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 303 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 07:51:07,998 INFO L242 Difference]: Finished difference. Result has 111 places, 101 transitions, 225 flow [2022-01-19 07:51:08,000 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2022-01-19 07:51:08,007 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 5 predicate places. [2022-01-19 07:51:08,007 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 225 flow [2022-01-19 07:51:08,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 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-01-19 07:51:08,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:08,008 INFO L254 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] [2022-01-19 07:51:08,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 07:51:08,009 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:08,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash 397909448, now seen corresponding path program 1 times [2022-01-19 07:51:08,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:08,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953257894] [2022-01-19 07:51:08,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:08,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:51:08,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:08,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953257894] [2022-01-19 07:51:08,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953257894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:51:08,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:51:08,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 07:51:08,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962202227] [2022-01-19 07:51:08,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:51:08,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:51:08,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:51:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 07:51:08,200 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 07:51:08,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 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-01-19 07:51:08,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:08,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 07:51:08,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:08,436 INFO L129 PetriNetUnfolder]: 95/406 cut-off events. [2022-01-19 07:51:08,437 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-01-19 07:51:08,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 406 events. 95/406 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1804 event pairs, 42 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 654. Up to 136 conditions per place. [2022-01-19 07:51:08,443 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 37 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2022-01-19 07:51:08,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 119 transitions, 356 flow [2022-01-19 07:51:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:51:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:51:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2022-01-19 07:51:08,446 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7626050420168067 [2022-01-19 07:51:08,446 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 726 transitions. [2022-01-19 07:51:08,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 726 transitions. [2022-01-19 07:51:08,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:08,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 726 transitions. [2022-01-19 07:51:08,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 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-01-19 07:51:08,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 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-01-19 07:51:08,460 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 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-01-19 07:51:08,461 INFO L186 Difference]: Start difference. First operand has 111 places, 101 transitions, 225 flow. Second operand 8 states and 726 transitions. [2022-01-19 07:51:08,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 119 transitions, 356 flow [2022-01-19 07:51:08,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 119 transitions, 349 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 07:51:08,465 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 254 flow [2022-01-19 07:51:08,465 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=254, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2022-01-19 07:51:08,466 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 5 predicate places. [2022-01-19 07:51:08,466 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 254 flow [2022-01-19 07:51:08,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 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-01-19 07:51:08,467 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:08,467 INFO L254 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] [2022-01-19 07:51:08,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 07:51:08,467 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:08,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1293595690, now seen corresponding path program 1 times [2022-01-19 07:51:08,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:08,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259457842] [2022-01-19 07:51:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:08,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 07:51:08,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:08,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259457842] [2022-01-19 07:51:08,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259457842] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 07:51:08,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 07:51:08,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 07:51:08,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298771912] [2022-01-19 07:51:08,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:51:08,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:51:08,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:51:08,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 07:51:08,623 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 07:51:08,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 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-01-19 07:51:08,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:08,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 07:51:08,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:08,790 INFO L129 PetriNetUnfolder]: 81/328 cut-off events. [2022-01-19 07:51:08,790 INFO L130 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2022-01-19 07:51:08,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 328 events. 81/328 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1272 event pairs, 47 based on Foata normal form. 3/306 useless extension candidates. Maximal degree in co-relation 422. Up to 144 conditions per place. [2022-01-19 07:51:08,793 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 25 selfloop transitions, 6 changer transitions 11/116 dead transitions. [2022-01-19 07:51:08,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 365 flow [2022-01-19 07:51:08,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 07:51:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 07:51:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 722 transitions. [2022-01-19 07:51:08,796 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7584033613445378 [2022-01-19 07:51:08,796 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 722 transitions. [2022-01-19 07:51:08,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 722 transitions. [2022-01-19 07:51:08,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:08,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 722 transitions. [2022-01-19 07:51:08,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 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-01-19 07:51:08,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 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-01-19 07:51:08,802 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 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-01-19 07:51:08,802 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 254 flow. Second operand 8 states and 722 transitions. [2022-01-19 07:51:08,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 365 flow [2022-01-19 07:51:08,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 07:51:08,811 INFO L242 Difference]: Finished difference. Result has 116 places, 102 transitions, 248 flow [2022-01-19 07:51:08,811 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2022-01-19 07:51:08,813 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2022-01-19 07:51:08,813 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 248 flow [2022-01-19 07:51:08,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 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-01-19 07:51:08,814 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:08,814 INFO L254 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] [2022-01-19 07:51:08,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 07:51:08,815 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:08,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash -63413436, now seen corresponding path program 1 times [2022-01-19 07:51:08,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:08,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297940839] [2022-01-19 07:51:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:08,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:08,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297940839] [2022-01-19 07:51:08,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297940839] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310414096] [2022-01-19 07:51:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:08,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:51:08,956 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-01-19 07:51:08,958 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-01-19 07:51:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:09,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 07:51:09,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:51:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:09,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:51:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:09,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310414096] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:09,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 07:51:09,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 07:51:09,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383811557] [2022-01-19 07:51:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:51:09,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:51:09,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:51:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 07:51:09,665 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 07:51:09,666 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-19 07:51:09,666 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:09,666 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 07:51:09,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:09,786 INFO L129 PetriNetUnfolder]: 70/263 cut-off events. [2022-01-19 07:51:09,786 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-01-19 07:51:09,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 263 events. 70/263 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 858 event pairs, 17 based on Foata normal form. 9/265 useless extension candidates. Maximal degree in co-relation 420. Up to 79 conditions per place. [2022-01-19 07:51:09,790 INFO L132 encePairwiseOnDemand]: 111/119 looper letters, 27 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2022-01-19 07:51:09,790 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 333 flow [2022-01-19 07:51:09,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:51:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:51:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-01-19 07:51:09,793 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2022-01-19 07:51:09,793 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2022-01-19 07:51:09,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2022-01-19 07:51:09,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:09,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2022-01-19 07:51:09,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 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-01-19 07:51:09,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-01-19 07:51:09,797 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-01-19 07:51:09,797 INFO L186 Difference]: Start difference. First operand has 116 places, 102 transitions, 248 flow. Second operand 7 states and 629 transitions. [2022-01-19 07:51:09,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 333 flow [2022-01-19 07:51:09,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 307 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-01-19 07:51:09,804 INFO L242 Difference]: Finished difference. Result has 112 places, 104 transitions, 259 flow [2022-01-19 07:51:09,804 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=112, PETRI_TRANSITIONS=104} [2022-01-19 07:51:09,806 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 6 predicate places. [2022-01-19 07:51:09,806 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 259 flow [2022-01-19 07:51:09,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-19 07:51:09,806 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:09,806 INFO L254 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] [2022-01-19 07:51:09,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 07:51:10,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:10,020 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1317879854, now seen corresponding path program 1 times [2022-01-19 07:51:10,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:10,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163868579] [2022-01-19 07:51:10,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:10,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:10,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:10,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163868579] [2022-01-19 07:51:10,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163868579] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:10,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136469272] [2022-01-19 07:51:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:10,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:10,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:51:10,132 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-01-19 07:51:10,163 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-01-19 07:51:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:10,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 07:51:10,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:51:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:10,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:51:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:10,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136469272] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:10,664 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 07:51:10,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 07:51:10,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60082057] [2022-01-19 07:51:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 07:51:10,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 07:51:10,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:10,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 07:51:10,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 07:51:10,667 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 07:51:10,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-19 07:51:10,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:10,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 07:51:10,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:10,761 INFO L129 PetriNetUnfolder]: 59/261 cut-off events. [2022-01-19 07:51:10,761 INFO L130 PetriNetUnfolder]: For 76/90 co-relation queries the response was YES. [2022-01-19 07:51:10,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 261 events. 59/261 cut-off events. For 76/90 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 783 event pairs, 20 based on Foata normal form. 14/262 useless extension candidates. Maximal degree in co-relation 418. Up to 67 conditions per place. [2022-01-19 07:51:10,763 INFO L132 encePairwiseOnDemand]: 111/119 looper letters, 29 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2022-01-19 07:51:10,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 352 flow [2022-01-19 07:51:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 07:51:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 07:51:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-01-19 07:51:10,766 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2022-01-19 07:51:10,766 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2022-01-19 07:51:10,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2022-01-19 07:51:10,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:10,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2022-01-19 07:51:10,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 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-01-19 07:51:10,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-01-19 07:51:10,771 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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-01-19 07:51:10,772 INFO L186 Difference]: Start difference. First operand has 112 places, 104 transitions, 259 flow. Second operand 7 states and 629 transitions. [2022-01-19 07:51:10,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 352 flow [2022-01-19 07:51:10,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 110 transitions, 343 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 07:51:10,776 INFO L242 Difference]: Finished difference. Result has 116 places, 105 transitions, 278 flow [2022-01-19 07:51:10,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2022-01-19 07:51:10,779 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2022-01-19 07:51:10,779 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 278 flow [2022-01-19 07:51:10,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 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-01-19 07:51:10,780 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:10,780 INFO L254 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] [2022-01-19 07:51:10,810 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-01-19 07:51:10,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:10,999 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:11,000 INFO L85 PathProgramCache]: Analyzing trace with hash -622709836, now seen corresponding path program 1 times [2022-01-19 07:51:11,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:11,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161736354] [2022-01-19 07:51:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:11,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:11,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:11,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161736354] [2022-01-19 07:51:11,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161736354] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:11,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948165593] [2022-01-19 07:51:11,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:11,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:11,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:51:11,332 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-01-19 07:51:11,359 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-01-19 07:51:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:11,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 07:51:11,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:51:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:11,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:51:11,976 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:51:11,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 22 [2022-01-19 07:51:11,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:51:12,000 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:51:12,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 10 [2022-01-19 07:51:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:12,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948165593] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:51:12,169 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:51:12,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2022-01-19 07:51:12,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64381116] [2022-01-19 07:51:12,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:51:12,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 07:51:12,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 07:51:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-01-19 07:51:12,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2022-01-19 07:51:12,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 278 flow. Second operand has 23 states, 23 states have (on average 63.43478260869565) internal successors, (1459), 23 states have internal predecessors, (1459), 0 states have call successors, (0), 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-01-19 07:51:12,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:12,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2022-01-19 07:51:12,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:13,357 INFO L129 PetriNetUnfolder]: 795/1701 cut-off events. [2022-01-19 07:51:13,358 INFO L130 PetriNetUnfolder]: For 987/987 co-relation queries the response was YES. [2022-01-19 07:51:13,362 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1701 events. 795/1701 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10402 event pairs, 82 based on Foata normal form. 2/1696 useless extension candidates. Maximal degree in co-relation 3998. Up to 473 conditions per place. [2022-01-19 07:51:13,370 INFO L132 encePairwiseOnDemand]: 100/119 looper letters, 176 selfloop transitions, 65 changer transitions 8/301 dead transitions. [2022-01-19 07:51:13,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 301 transitions, 1424 flow [2022-01-19 07:51:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 07:51:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 07:51:13,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2469 transitions. [2022-01-19 07:51:13,377 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5607540313422666 [2022-01-19 07:51:13,377 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2469 transitions. [2022-01-19 07:51:13,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2469 transitions. [2022-01-19 07:51:13,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:13,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2469 transitions. [2022-01-19 07:51:13,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 66.72972972972973) internal successors, (2469), 37 states have internal predecessors, (2469), 0 states have call successors, (0), 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-01-19 07:51:13,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 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-01-19 07:51:13,393 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 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-01-19 07:51:13,393 INFO L186 Difference]: Start difference. First operand has 116 places, 105 transitions, 278 flow. Second operand 37 states and 2469 transitions. [2022-01-19 07:51:13,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 301 transitions, 1424 flow [2022-01-19 07:51:13,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 301 transitions, 1390 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 07:51:13,401 INFO L242 Difference]: Finished difference. Result has 164 places, 165 transitions, 737 flow [2022-01-19 07:51:13,401 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=737, PETRI_PLACES=164, PETRI_TRANSITIONS=165} [2022-01-19 07:51:13,402 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 58 predicate places. [2022-01-19 07:51:13,402 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 165 transitions, 737 flow [2022-01-19 07:51:13,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 63.43478260869565) internal successors, (1459), 23 states have internal predecessors, (1459), 0 states have call successors, (0), 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-01-19 07:51:13,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:13,403 INFO L254 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] [2022-01-19 07:51:13,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 07:51:13,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:13,620 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:13,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2137444122, now seen corresponding path program 2 times [2022-01-19 07:51:13,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:13,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10361058] [2022-01-19 07:51:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:13,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:13,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:13,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10361058] [2022-01-19 07:51:13,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10361058] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:13,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330927459] [2022-01-19 07:51:13,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 07:51:13,913 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:13,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:51:13,914 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-01-19 07:51:13,916 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-01-19 07:51:14,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 07:51:14,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:51:14,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 07:51:14,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:51:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:14,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:51:14,605 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:51:14,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 [2022-01-19 07:51:14,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:51:14,623 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:51:14,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 07:51:14,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:14,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330927459] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:51:14,801 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:51:14,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2022-01-19 07:51:14,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506673026] [2022-01-19 07:51:14,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:51:14,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 07:51:14,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:14,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 07:51:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-01-19 07:51:14,805 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2022-01-19 07:51:14,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 165 transitions, 737 flow. Second operand has 23 states, 23 states have (on average 63.56521739130435) internal successors, (1462), 23 states have internal predecessors, (1462), 0 states have call successors, (0), 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-01-19 07:51:14,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:14,806 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2022-01-19 07:51:14,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:16,413 INFO L129 PetriNetUnfolder]: 1520/3226 cut-off events. [2022-01-19 07:51:16,414 INFO L130 PetriNetUnfolder]: For 7175/7175 co-relation queries the response was YES. [2022-01-19 07:51:16,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9937 conditions, 3226 events. 1520/3226 cut-off events. For 7175/7175 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 23880 event pairs, 111 based on Foata normal form. 2/3221 useless extension candidates. Maximal degree in co-relation 9880. Up to 556 conditions per place. [2022-01-19 07:51:16,447 INFO L132 encePairwiseOnDemand]: 99/119 looper letters, 230 selfloop transitions, 128 changer transitions 8/418 dead transitions. [2022-01-19 07:51:16,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 418 transitions, 2732 flow [2022-01-19 07:51:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 07:51:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 07:51:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2890 transitions. [2022-01-19 07:51:16,454 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5647840531561462 [2022-01-19 07:51:16,455 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 2890 transitions. [2022-01-19 07:51:16,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 2890 transitions. [2022-01-19 07:51:16,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:16,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2890 transitions. [2022-01-19 07:51:16,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 67.20930232558139) internal successors, (2890), 43 states have internal predecessors, (2890), 0 states have call successors, (0), 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-01-19 07:51:16,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 119.0) internal successors, (5236), 44 states have internal predecessors, (5236), 0 states have call successors, (0), 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-01-19 07:51:16,557 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 119.0) internal successors, (5236), 44 states have internal predecessors, (5236), 0 states have call successors, (0), 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-01-19 07:51:16,557 INFO L186 Difference]: Start difference. First operand has 164 places, 165 transitions, 737 flow. Second operand 43 states and 2890 transitions. [2022-01-19 07:51:16,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 418 transitions, 2732 flow [2022-01-19 07:51:16,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 418 transitions, 2568 flow, removed 71 selfloop flow, removed 11 redundant places. [2022-01-19 07:51:16,581 INFO L242 Difference]: Finished difference. Result has 202 places, 254 transitions, 1697 flow [2022-01-19 07:51:16,582 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1697, PETRI_PLACES=202, PETRI_TRANSITIONS=254} [2022-01-19 07:51:16,582 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 96 predicate places. [2022-01-19 07:51:16,582 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 254 transitions, 1697 flow [2022-01-19 07:51:16,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 63.56521739130435) internal successors, (1462), 23 states have internal predecessors, (1462), 0 states have call successors, (0), 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-01-19 07:51:16,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:16,583 INFO L254 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] [2022-01-19 07:51:16,610 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-01-19 07:51:16,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:16,810 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:16,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:16,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1477858140, now seen corresponding path program 3 times [2022-01-19 07:51:16,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:16,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182837487] [2022-01-19 07:51:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:16,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 07:51:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:17,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 07:51:17,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182837487] [2022-01-19 07:51:17,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182837487] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 07:51:17,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688702286] [2022-01-19 07:51:17,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 07:51:17,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:17,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 07:51:17,172 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-01-19 07:51:17,174 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-01-19 07:51:17,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 07:51:17,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 07:51:17,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-19 07:51:17,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 07:51:17,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:51:17,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 07:51:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:17,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 07:51:18,096 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_151 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset) c_~counter~0)) (forall ((v_ArrVal_151 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-01-19 07:51:18,126 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_151 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset) |c_thread1Thread1of1ForFork0_~tmp~0#1|)) (forall ((v_ArrVal_151 (Array Int Int))) (<= |c_thread1Thread1of1ForFork0_~tmp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-01-19 07:51:18,139 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 07:51:18,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 34 [2022-01-19 07:51:18,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2022-01-19 07:51:18,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 07:51:18,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 07:51:18,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2022-01-19 07:51:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 07:51:18,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688702286] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 07:51:18,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 07:51:18,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 39 [2022-01-19 07:51:18,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959290412] [2022-01-19 07:51:18,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 07:51:18,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 07:51:18,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 07:51:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 07:51:18,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1208, Unknown=2, NotChecked=142, Total=1482 [2022-01-19 07:51:18,801 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119 [2022-01-19 07:51:18,803 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 254 transitions, 1697 flow. Second operand has 39 states, 39 states have (on average 57.743589743589745) internal successors, (2252), 39 states have internal predecessors, (2252), 0 states have call successors, (0), 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-01-19 07:51:18,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 07:51:18,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119 [2022-01-19 07:51:18,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 07:51:21,119 INFO L129 PetriNetUnfolder]: 2636/5520 cut-off events. [2022-01-19 07:51:21,119 INFO L130 PetriNetUnfolder]: For 18664/18672 co-relation queries the response was YES. [2022-01-19 07:51:21,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19090 conditions, 5520 events. 2636/5520 cut-off events. For 18664/18672 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 45930 event pairs, 318 based on Foata normal form. 8/5515 useless extension candidates. Maximal degree in co-relation 19007. Up to 2486 conditions per place. [2022-01-19 07:51:21,178 INFO L132 encePairwiseOnDemand]: 96/119 looper letters, 339 selfloop transitions, 131 changer transitions 8/527 dead transitions. [2022-01-19 07:51:21,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 527 transitions, 4597 flow [2022-01-19 07:51:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 07:51:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 07:51:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2302 transitions. [2022-01-19 07:51:21,182 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5228253463547581 [2022-01-19 07:51:21,182 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2302 transitions. [2022-01-19 07:51:21,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2302 transitions. [2022-01-19 07:51:21,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 07:51:21,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2302 transitions. [2022-01-19 07:51:21,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 62.21621621621622) internal successors, (2302), 37 states have internal predecessors, (2302), 0 states have call successors, (0), 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-01-19 07:51:21,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 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-01-19 07:51:21,198 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 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-01-19 07:51:21,198 INFO L186 Difference]: Start difference. First operand has 202 places, 254 transitions, 1697 flow. Second operand 37 states and 2302 transitions. [2022-01-19 07:51:21,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 527 transitions, 4597 flow [2022-01-19 07:51:21,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 527 transitions, 3744 flow, removed 407 selfloop flow, removed 15 redundant places. [2022-01-19 07:51:21,331 INFO L242 Difference]: Finished difference. Result has 241 places, 348 transitions, 2639 flow [2022-01-19 07:51:21,331 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=2639, PETRI_PLACES=241, PETRI_TRANSITIONS=348} [2022-01-19 07:51:21,332 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 135 predicate places. [2022-01-19 07:51:21,332 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 348 transitions, 2639 flow [2022-01-19 07:51:21,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 57.743589743589745) internal successors, (2252), 39 states have internal predecessors, (2252), 0 states have call successors, (0), 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-01-19 07:51:21,333 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 07:51:21,333 INFO L254 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] [2022-01-19 07:51:21,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 07:51:21,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 07:51:21,555 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 07:51:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 07:51:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 639403628, now seen corresponding path program 4 times [2022-01-19 07:51:21,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 07:51:21,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032368948] [2022-01-19 07:51:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 07:51:21,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 07:51:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 07:51:21,588 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 07:51:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 07:51:21,651 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 07:51:21,651 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 07:51:21,652 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 07:51:21,654 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 07:51:21,654 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 07:51:21,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 07:51:21,657 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-01-19 07:51:21,661 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 07:51:21,661 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 07:51:21,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 07:51:21 BasicIcfg [2022-01-19 07:51:21,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 07:51:21,731 INFO L158 Benchmark]: Toolchain (without parser) took 15511.28ms. Allocated memory was 343.9MB in the beginning and 589.3MB in the end (delta: 245.4MB). Free memory was 288.8MB in the beginning and 377.8MB in the end (delta: -89.0MB). Peak memory consumption was 159.1MB. Max. memory is 16.0GB. [2022-01-19 07:51:21,731 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory is still 305.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 07:51:21,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.68ms. Allocated memory is still 343.9MB. Free memory was 288.6MB in the beginning and 312.9MB in the end (delta: -24.3MB). Peak memory consumption was 15.4MB. Max. memory is 16.0GB. [2022-01-19 07:51:21,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.34ms. Allocated memory is still 343.9MB. Free memory was 312.9MB in the beginning and 310.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 07:51:21,732 INFO L158 Benchmark]: Boogie Preprocessor took 23.72ms. Allocated memory is still 343.9MB. Free memory was 310.8MB in the beginning and 309.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 07:51:21,732 INFO L158 Benchmark]: RCFGBuilder took 512.02ms. Allocated memory is still 343.9MB. Free memory was 309.8MB in the beginning and 286.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2022-01-19 07:51:21,732 INFO L158 Benchmark]: TraceAbstraction took 14676.83ms. Allocated memory was 343.9MB in the beginning and 589.3MB in the end (delta: 245.4MB). Free memory was 285.6MB in the beginning and 377.8MB in the end (delta: -92.2MB). Peak memory consumption was 156.4MB. Max. memory is 16.0GB. [2022-01-19 07:51:21,733 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.12ms. Allocated memory is still 343.9MB. Free memory is still 305.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 261.68ms. Allocated memory is still 343.9MB. Free memory was 288.6MB in the beginning and 312.9MB in the end (delta: -24.3MB). Peak memory consumption was 15.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.34ms. Allocated memory is still 343.9MB. Free memory was 312.9MB in the beginning and 310.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.72ms. Allocated memory is still 343.9MB. Free memory was 310.8MB in the beginning and 309.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 512.02ms. Allocated memory is still 343.9MB. Free memory was 309.8MB in the beginning and 286.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 14676.83ms. Allocated memory was 343.9MB in the beginning and 589.3MB in the end (delta: 245.4MB). Free memory was 285.6MB in the beginning and 377.8MB in the end (delta: -92.2MB). Peak memory consumption was 156.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, counter=0, N=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, counter=0, N=0, t1={5:0}, t2={3:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, A={0:0}, counter=0, N=1, t1={5:0}, t2={3:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, malloc(sizeof(int) * (size_t)size)={-2:0}, N=1, size=1] [L97] 0 int i = 0; VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=0, N=1, size=1] [L97] COND TRUE 0 i < size VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=0, N=1, size=1] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=1, __VERIFIER_nondet_int()=-7, A={0:0}, arr={-2:0}, counter=0, i=0, N=1, size=1] [L97] 0 i++ VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=1, N=1, size=1] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=1, N=1, size=1] [L100] 0 return arr; VAL [\old(size)=1, \result={-2:0}, A={0:0}, arr={-2:0}, counter=0, i=1, N=1, size=1] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={-2:0}, counter=0, create_fresh_int_array(N)={-2:0}, N=1, t1={5:0}, t2={3:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, counter=0, N=1, pthread_create(&t1, 0, thread1, 0)=-1, t1={5:0}, t2={3:0}] [L49] 1 int i=0; VAL [A={-2:0}, counter=0, i=0, N=1] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={-2:0}, counter=0, i=0, N=1] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-2:0}, counter=7, i=0, N=1, tmp=7] [L62] 2 i++ VAL [A={-2:0}, counter=7, i=1, N=1, tmp=7] [L62] COND FALSE 2 !(i