/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 10:03:27,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 10:03:27,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 10:03:27,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 10:03:27,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 10:03:27,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 10:03:27,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 10:03:27,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 10:03:27,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 10:03:27,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 10:03:27,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 10:03:27,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 10:03:27,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 10:03:27,309 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 10:03:27,310 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 10:03:27,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 10:03:27,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 10:03:27,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 10:03:27,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 10:03:27,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 10:03:27,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 10:03:27,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 10:03:27,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 10:03:27,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 10:03:27,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 10:03:27,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 10:03:27,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 10:03:27,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 10:03:27,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 10:03:27,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 10:03:27,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 10:03:27,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 10:03:27,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 10:03:27,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 10:03:27,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 10:03:27,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 10:03:27,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 10:03:27,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 10:03:27,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 10:03:27,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 10:03:27,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 10:03:27,342 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 10:03:27,366 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 10:03:27,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 10:03:27,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 10:03:27,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 10:03:27,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 10:03:27,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 10:03:27,368 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 10:03:27,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 10:03:27,369 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 10:03:27,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 10:03:27,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 10:03:27,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 10:03:27,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 10:03:27,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:03:27,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 10:03:27,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 10:03:27,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 10:03:27,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 10:03:27,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 10:03:27,372 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 10:03:27,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 10:03:27,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 10:03:27,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 10:03:27,642 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 10:03:27,642 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 10:03:27,643 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 [2023-01-28 10:03:28,870 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 10:03:29,072 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 10:03:29,073 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-01-28 10:03:29,082 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56b8e6773/51df91b3265e4476b2b1b201b4afb600/FLAG005e53e30 [2023-01-28 10:03:29,094 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56b8e6773/51df91b3265e4476b2b1b201b4afb600 [2023-01-28 10:03:29,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 10:03:29,096 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 10:03:29,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 10:03:29,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 10:03:29,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 10:03:29,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df3ea23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29, skipping insertion in model container [2023-01-28 10:03:29,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 10:03:29,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 10:03:29,268 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-01-28 10:03:29,277 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:03:29,284 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 10:03:29,300 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-01-28 10:03:29,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:03:29,311 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:03:29,311 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:03:29,316 INFO L208 MainTranslator]: Completed translation [2023-01-28 10:03:29,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29 WrapperNode [2023-01-28 10:03:29,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 10:03:29,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 10:03:29,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 10:03:29,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 10:03:29,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,371 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 146 [2023-01-28 10:03:29,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 10:03:29,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 10:03:29,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 10:03:29,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 10:03:29,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 10:03:29,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 10:03:29,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 10:03:29,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 10:03:29,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (1/1) ... [2023-01-28 10:03:29,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:03:29,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:03:29,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 10:03:29,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 10:03:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 10:03:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 10:03:29,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 10:03:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 10:03:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 10:03:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 10:03:29,463 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 10:03:29,465 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 10:03:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 10:03:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 10:03:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 10:03:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 10:03:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 10:03:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 10:03:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 10:03:29,467 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 10:03:29,550 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 10:03:29,551 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 10:03:29,835 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 10:03:29,983 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 10:03:29,984 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 10:03:29,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:03:29 BoogieIcfgContainer [2023-01-28 10:03:29,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 10:03:29,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 10:03:29,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 10:03:29,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 10:03:29,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:03:29" (1/3) ... [2023-01-28 10:03:29,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513ff60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:03:29, skipping insertion in model container [2023-01-28 10:03:29,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:03:29" (2/3) ... [2023-01-28 10:03:29,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513ff60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:03:29, skipping insertion in model container [2023-01-28 10:03:29,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:03:29" (3/3) ... [2023-01-28 10:03:30,000 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-01-28 10:03:30,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 10:03:30,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 10:03:30,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 10:03:30,078 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 10:03:30,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 238 flow [2023-01-28 10:03:30,208 INFO L130 PetriNetUnfolder]: 9/109 cut-off events. [2023-01-28 10:03:30,208 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 10:03:30,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 9/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-01-28 10:03:30,214 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 111 transitions, 238 flow [2023-01-28 10:03:30,218 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 101 transitions, 214 flow [2023-01-28 10:03:30,220 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 10:03:30,227 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 101 transitions, 214 flow [2023-01-28 10:03:30,230 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 101 transitions, 214 flow [2023-01-28 10:03:30,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 101 transitions, 214 flow [2023-01-28 10:03:30,252 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-01-28 10:03:30,252 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 10:03:30,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 101 events. 9/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-01-28 10:03:30,254 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-01-28 10:03:33,572 INFO L134 LiptonReduction]: Checked pairs total: 830 [2023-01-28 10:03:33,572 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-28 10:03:33,595 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 10:03:33,602 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a30a2fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 10:03:33,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 10:03:33,610 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2023-01-28 10:03:33,610 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 10:03:33,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:33,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:33,612 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:33,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash 41387086, now seen corresponding path program 1 times [2023-01-28 10:03:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:33,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90801250] [2023-01-28 10:03:33,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:33,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:03:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:33,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90801250] [2023-01-28 10:03:33,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90801250] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:03:33,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:03:33,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 10:03:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263936586] [2023-01-28 10:03:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:03:33,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:03:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:34,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:03:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:03:34,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 208 [2023-01-28 10:03:34,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:34,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 208 [2023-01-28 10:03:34,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:03:34,112 INFO L130 PetriNetUnfolder]: 114/197 cut-off events. [2023-01-28 10:03:34,112 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-28 10:03:34,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 197 events. 114/197 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 703 event pairs, 24 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2023-01-28 10:03:34,115 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 25 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-01-28 10:03:34,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2023-01-28 10:03:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:03:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:03:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-01-28 10:03:34,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 10:03:34,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-01-28 10:03:34,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-01-28 10:03:34,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:03:34,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-01-28 10:03:34,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,153 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 312 transitions. [2023-01-28 10:03:34,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2023-01-28 10:03:34,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 10:03:34,158 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2023-01-28 10:03:34,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2023-01-28 10:03:34,164 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-01-28 10:03:34,164 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2023-01-28 10:03:34,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:34,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:34,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 10:03:34,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:34,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -370799563, now seen corresponding path program 1 times [2023-01-28 10:03:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:34,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351795705] [2023-01-28 10:03:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:03:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351795705] [2023-01-28 10:03:34,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351795705] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:03:34,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:03:34,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:03:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200889208] [2023-01-28 10:03:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:03:34,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:03:34,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:34,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:03:34,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:03:34,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-28 10:03:34,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:34,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-28 10:03:34,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:03:34,479 INFO L130 PetriNetUnfolder]: 178/329 cut-off events. [2023-01-28 10:03:34,479 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-01-28 10:03:34,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 329 events. 178/329 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1385 event pairs, 83 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 276. Up to 207 conditions per place. [2023-01-28 10:03:34,485 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 39 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-01-28 10:03:34,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 44 transitions, 210 flow [2023-01-28 10:03:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:03:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:03:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-01-28 10:03:34,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40865384615384615 [2023-01-28 10:03:34,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-01-28 10:03:34,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-01-28 10:03:34,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:03:34,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-01-28 10:03:34,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,497 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,498 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 425 transitions. [2023-01-28 10:03:34,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 44 transitions, 210 flow [2023-01-28 10:03:34,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 44 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 10:03:34,500 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 86 flow [2023-01-28 10:03:34,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2023-01-28 10:03:34,501 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-01-28 10:03:34,501 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 86 flow [2023-01-28 10:03:34,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:34,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:34,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 10:03:34,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:34,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:34,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1378138269, now seen corresponding path program 1 times [2023-01-28 10:03:34,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:34,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656792257] [2023-01-28 10:03:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:34,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:03:34,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:34,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656792257] [2023-01-28 10:03:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656792257] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:03:34,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:03:34,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:03:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182161694] [2023-01-28 10:03:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:03:34,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:03:34,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:34,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:03:34,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:03:34,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-28 10:03:34,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:34,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-28 10:03:34,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:03:34,723 INFO L130 PetriNetUnfolder]: 132/246 cut-off events. [2023-01-28 10:03:34,723 INFO L131 PetriNetUnfolder]: For 50/57 co-relation queries the response was YES. [2023-01-28 10:03:34,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 246 events. 132/246 cut-off events. For 50/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 937 event pairs, 81 based on Foata normal form. 7/234 useless extension candidates. Maximal degree in co-relation 482. Up to 205 conditions per place. [2023-01-28 10:03:34,726 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 19 selfloop transitions, 2 changer transitions 16/38 dead transitions. [2023-01-28 10:03:34,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 191 flow [2023-01-28 10:03:34,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:03:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:03:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2023-01-28 10:03:34,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2023-01-28 10:03:34,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 420 transitions. [2023-01-28 10:03:34,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 420 transitions. [2023-01-28 10:03:34,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:03:34,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 420 transitions. [2023-01-28 10:03:34,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,733 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 86 flow. Second operand 5 states and 420 transitions. [2023-01-28 10:03:34,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 191 flow [2023-01-28 10:03:34,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 187 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 10:03:34,737 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 78 flow [2023-01-28 10:03:34,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-28 10:03:34,738 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-01-28 10:03:34,741 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 78 flow [2023-01-28 10:03:34,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:34,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:34,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 10:03:34,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:34,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1007847617, now seen corresponding path program 1 times [2023-01-28 10:03:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:34,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967141862] [2023-01-28 10:03:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:03:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967141862] [2023-01-28 10:03:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967141862] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:03:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341237486] [2023-01-28 10:03:34,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:34,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:03:34,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:03:34,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:03:34,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 10:03:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:34,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 10:03:34,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:03:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:03:35,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:03:35,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:03:35,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341237486] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:03:35,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:03:35,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-01-28 10:03:35,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467881657] [2023-01-28 10:03:35,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:03:35,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:03:35,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:35,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:03:35,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-01-28 10:03:35,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-28 10:03:35,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:35,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-28 10:03:35,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:03:35,237 INFO L130 PetriNetUnfolder]: 117/205 cut-off events. [2023-01-28 10:03:35,238 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-01-28 10:03:35,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 205 events. 117/205 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 696 event pairs, 35 based on Foata normal form. 16/220 useless extension candidates. Maximal degree in co-relation 522. Up to 112 conditions per place. [2023-01-28 10:03:35,240 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-01-28 10:03:35,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 161 flow [2023-01-28 10:03:35,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:03:35,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:03:35,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-01-28 10:03:35,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39615384615384613 [2023-01-28 10:03:35,242 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-01-28 10:03:35,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-01-28 10:03:35,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:03:35,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-01-28 10:03:35,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,246 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,246 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 78 flow. Second operand 5 states and 412 transitions. [2023-01-28 10:03:35,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 161 flow [2023-01-28 10:03:35,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 143 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-01-28 10:03:35,248 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 91 flow [2023-01-28 10:03:35,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-01-28 10:03:35,249 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-01-28 10:03:35,249 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 91 flow [2023-01-28 10:03:35,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:35,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:35,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 10:03:35,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:03:35,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:35,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash 53783691, now seen corresponding path program 1 times [2023-01-28 10:03:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:35,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848273438] [2023-01-28 10:03:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:35,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:03:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848273438] [2023-01-28 10:03:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848273438] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:03:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803818462] [2023-01-28 10:03:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:03:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:03:35,561 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:03:35,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 10:03:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:35,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 10:03:35,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:03:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:03:35,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:03:35,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:03:35,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803818462] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:03:35,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:03:35,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-01-28 10:03:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509259511] [2023-01-28 10:03:35,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:03:35,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:03:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:35,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:03:35,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-01-28 10:03:35,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-28 10:03:35,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:35,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-28 10:03:35,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:03:35,810 INFO L130 PetriNetUnfolder]: 94/169 cut-off events. [2023-01-28 10:03:35,810 INFO L131 PetriNetUnfolder]: For 123/141 co-relation queries the response was YES. [2023-01-28 10:03:35,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 169 events. 94/169 cut-off events. For 123/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 514 event pairs, 30 based on Foata normal form. 18/174 useless extension candidates. Maximal degree in co-relation 459. Up to 93 conditions per place. [2023-01-28 10:03:35,812 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 25 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2023-01-28 10:03:35,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 192 flow [2023-01-28 10:03:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:03:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:03:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-01-28 10:03:35,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39615384615384613 [2023-01-28 10:03:35,814 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-01-28 10:03:35,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-01-28 10:03:35,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:03:35,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-01-28 10:03:35,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,817 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,817 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 91 flow. Second operand 5 states and 412 transitions. [2023-01-28 10:03:35,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 192 flow [2023-01-28 10:03:35,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 10:03:35,819 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 111 flow [2023-01-28 10:03:35,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-01-28 10:03:35,820 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-01-28 10:03:35,820 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 111 flow [2023-01-28 10:03:35,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:35,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:35,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:35,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 10:03:36,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:03:36,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:36,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1841708852, now seen corresponding path program 1 times [2023-01-28 10:03:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132433809] [2023-01-28 10:03:36,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:03:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:03:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132433809] [2023-01-28 10:03:36,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132433809] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:03:36,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919059672] [2023-01-28 10:03:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:36,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:03:36,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:03:36,817 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:03:36,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 10:03:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:03:36,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2023-01-28 10:03:36,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:03:36,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-28 10:03:37,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 10:03:37,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:03:37,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:03:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:03:37,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:03:37,367 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0))) (and (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) .cse0)) (forall ((v_ArrVal_133 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-01-28 10:03:37,377 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0))) (and (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) .cse0)) (forall ((v_ArrVal_133 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-01-28 10:03:37,396 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-01-28 10:03:37,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:03:37,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-01-28 10:03:37,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2023-01-28 10:03:37,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-01-28 10:03:37,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-01-28 10:03:37,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:03:37,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-01-28 10:03:37,469 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:03:37,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-01-28 10:03:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 10:03:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919059672] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:03:37,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:03:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-01-28 10:03:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208802854] [2023-01-28 10:03:37,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:03:37,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 10:03:37,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:03:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 10:03:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=9, NotChecked=138, Total=702 [2023-01-28 10:03:37,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 208 [2023-01-28 10:03:37,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 111 flow. Second operand has 27 states, 27 states have (on average 61.55555555555556) internal successors, (1662), 27 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:37,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:03:37,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 208 [2023-01-28 10:03:37,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:03:38,382 INFO L130 PetriNetUnfolder]: 329/582 cut-off events. [2023-01-28 10:03:38,382 INFO L131 PetriNetUnfolder]: For 526/526 co-relation queries the response was YES. [2023-01-28 10:03:38,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 582 events. 329/582 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2347 event pairs, 12 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 1898. Up to 188 conditions per place. [2023-01-28 10:03:38,386 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 113 selfloop transitions, 38 changer transitions 2/153 dead transitions. [2023-01-28 10:03:38,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 153 transitions, 950 flow [2023-01-28 10:03:38,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-28 10:03:38,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-28 10:03:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1471 transitions. [2023-01-28 10:03:38,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3214597902097902 [2023-01-28 10:03:38,392 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1471 transitions. [2023-01-28 10:03:38,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1471 transitions. [2023-01-28 10:03:38,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:03:38,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1471 transitions. [2023-01-28 10:03:38,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 66.86363636363636) internal successors, (1471), 22 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:38,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 208.0) internal successors, (4784), 23 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:38,403 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 208.0) internal successors, (4784), 23 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:38,403 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 111 flow. Second operand 22 states and 1471 transitions. [2023-01-28 10:03:38,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 153 transitions, 950 flow [2023-01-28 10:03:38,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 153 transitions, 922 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-28 10:03:38,410 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 512 flow [2023-01-28 10:03:38,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=512, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2023-01-28 10:03:38,412 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 37 predicate places. [2023-01-28 10:03:38,412 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 512 flow [2023-01-28 10:03:38,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 61.55555555555556) internal successors, (1662), 27 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:03:38,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:03:38,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:03:38,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 10:03:38,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:03:38,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 10:03:38,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:03:38,622 INFO L85 PathProgramCache]: Analyzing trace with hash 269516194, now seen corresponding path program 2 times [2023-01-28 10:03:38,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:03:38,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690675785] [2023-01-28 10:03:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:03:38,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:03:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 10:03:38,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 10:03:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 10:03:38,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 10:03:38,722 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 10:03:38,723 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 10:03:38,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-28 10:03:38,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-28 10:03:38,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 10:03:38,725 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-01-28 10:03:38,729 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 10:03:38,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 10:03:38,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:03:38 BasicIcfg [2023-01-28 10:03:38,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 10:03:38,785 INFO L158 Benchmark]: Toolchain (without parser) took 9688.38ms. Allocated memory was 381.7MB in the beginning and 461.4MB in the end (delta: 79.7MB). Free memory was 340.2MB in the beginning and 342.3MB in the end (delta: -2.1MB). Peak memory consumption was 79.3MB. Max. memory is 16.0GB. [2023-01-28 10:03:38,785 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 10:03:38,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.41ms. Allocated memory is still 381.7MB. Free memory was 340.2MB in the beginning and 328.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 10:03:38,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.65ms. Allocated memory is still 381.7MB. Free memory was 328.5MB in the beginning and 326.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:03:38,786 INFO L158 Benchmark]: Boogie Preprocessor took 28.33ms. Allocated memory is still 381.7MB. Free memory was 326.7MB in the beginning and 325.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:03:38,786 INFO L158 Benchmark]: RCFGBuilder took 584.06ms. Allocated memory is still 381.7MB. Free memory was 325.0MB in the beginning and 353.6MB in the end (delta: -28.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.0GB. [2023-01-28 10:03:38,786 INFO L158 Benchmark]: TraceAbstraction took 8796.89ms. Allocated memory was 381.7MB in the beginning and 461.4MB in the end (delta: 79.7MB). Free memory was 352.9MB in the beginning and 342.3MB in the end (delta: 10.6MB). Peak memory consumption was 90.7MB. Max. memory is 16.0GB. [2023-01-28 10:03:38,788 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 255.9MB. Free memory is still 213.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 219.41ms. Allocated memory is still 381.7MB. Free memory was 340.2MB in the beginning and 328.5MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.65ms. Allocated memory is still 381.7MB. Free memory was 328.5MB in the beginning and 326.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.33ms. Allocated memory is still 381.7MB. Free memory was 326.7MB in the beginning and 325.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 584.06ms. Allocated memory is still 381.7MB. Free memory was 325.0MB in the beginning and 353.6MB in the end (delta: -28.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.0GB. * TraceAbstraction took 8796.89ms. Allocated memory was 381.7MB in the beginning and 461.4MB in the end (delta: 79.7MB). Free memory was 352.9MB in the beginning and 342.3MB in the end (delta: 10.6MB). Peak memory consumption was 90.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 99 PlacesBefore, 23 PlacesAfterwards, 101 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 97 TotalNumberOfCompositions, 830 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 681, independent: 646, independent conditional: 0, independent unconditional: 646, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 681, independent: 355, independent conditional: 0, independent unconditional: 355, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 299, unknown conditional: 0, unknown unconditional: 299] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 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; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [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) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=1, counter=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={5:0}, t2={6:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=1, counter=0, pthread_create(&t2, 0, thread2, 0)=-1, t1={5:0}, t2={6:0}] [L83] 0 \read(t1) VAL [A={3:0}, N=1, \read(t1)=-2, counter=0, t1={5:0}, t2={6:0}] [L62] 2 int i=0; VAL [A={3:0}, N=1, counter=0, i=0] [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]); [L49] 1 int i=0; VAL [A={3:0}, N=1, counter=0, i=0] [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]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={3:0}, N=1, counter=-4, i=1, tmp=-4] [L49] COND FALSE 1 !(i