/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:40:43,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:40:43,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:40:43,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:40:43,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:40:43,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:40:43,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:40:43,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:40:43,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:40:43,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:40:43,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:40:43,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:40:43,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:40:43,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:40:43,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:40:43,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:40:43,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:40:43,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:40:43,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:40:43,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:40:43,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:40:43,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:40:43,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:40:43,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:40:43,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:40:43,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:40:43,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:40:43,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:40:43,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:40:43,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:40:43,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:40:43,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:40:43,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:40:43,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:40:43,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:40:43,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:40:43,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:40:43,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:40:43,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:40:43,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:40:43,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:40:43,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 19:40:43,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:40:43,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:40:43,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:40:43,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:40:43,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:40:43,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:40:43,084 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:40:43,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:40:43,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:40:43,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:40:43,086 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-11 19:40:43,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:40:43,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:40:43,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:40:43,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:40:43,365 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:40:43,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-12-11 19:40:44,312 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:40:44,506 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:40:44,506 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-12-11 19:40:44,513 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5af0307/c3b6fd322fb54d8983afd59aa9480a8d/FLAGdcf8ab31c [2022-12-11 19:40:44,523 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5af0307/c3b6fd322fb54d8983afd59aa9480a8d [2022-12-11 19:40:44,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:40:44,541 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:40:44,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:40:44,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:40:44,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:40:44,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f895335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44, skipping insertion in model container [2022-12-11 19:40:44,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:40:44,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:40:44,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,736 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-12-11 19:40:44,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:40:44,761 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:40:44,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:40:44,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:40:44,794 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2022-12-11 19:40:44,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:40:44,808 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:40:44,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44 WrapperNode [2022-12-11 19:40:44,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:40:44,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:40:44,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:40:44,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:40:44,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,854 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-11 19:40:44,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:40:44,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:40:44,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:40:44,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:40:44,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:40:44,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:40:44,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:40:44,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:40:44,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (1/1) ... [2022-12-11 19:40:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:40:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:40:44,919 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 19:40:44,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 19:40:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:40:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 19:40:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 19:40:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:40:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 19:40:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:40:44,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:40:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:40:44,961 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 19:40:45,027 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:40:45,029 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:40:45,278 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:40:45,423 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:40:45,424 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-11 19:40:45,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:40:45 BoogieIcfgContainer [2022-12-11 19:40:45,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:40:45,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:40:45,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:40:45,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:40:45,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:40:44" (1/3) ... [2022-12-11 19:40:45,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c1d812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:40:45, skipping insertion in model container [2022-12-11 19:40:45,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:40:44" (2/3) ... [2022-12-11 19:40:45,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c1d812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:40:45, skipping insertion in model container [2022-12-11 19:40:45,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:40:45" (3/3) ... [2022-12-11 19:40:45,434 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-12-11 19:40:45,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:40:45,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 19:40:45,447 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:40:45,507 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 19:40:45,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 234 flow [2022-12-11 19:40:45,605 INFO L130 PetriNetUnfolder]: 9/107 cut-off events. [2022-12-11 19:40:45,606 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 19:40:45,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 107 events. 9/107 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-11 19:40:45,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 109 transitions, 234 flow [2022-12-11 19:40:45,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 210 flow [2022-12-11 19:40:45,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:40:45,626 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;@38d1849a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:40:45,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-11 19:40:45,647 INFO L130 PetriNetUnfolder]: 9/98 cut-off events. [2022-12-11 19:40:45,647 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 19:40:45,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:45,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:45,649 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:45,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1980256759, now seen corresponding path program 1 times [2022-12-11 19:40:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:45,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694709366] [2022-12-11 19:40:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:40:46,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:46,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694709366] [2022-12-11 19:40:46,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694709366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:40:46,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:40:46,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 19:40:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318664295] [2022-12-11 19:40:46,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:40:46,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 19:40:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:46,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 19:40:46,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-11 19:40:46,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2022-12-11 19:40:46,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:46,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:46,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2022-12-11 19:40:46,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:46,310 INFO L130 PetriNetUnfolder]: 26/185 cut-off events. [2022-12-11 19:40:46,311 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-11 19:40:46,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 185 events. 26/185 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 514 event pairs, 3 based on Foata normal form. 23/192 useless extension candidates. Maximal degree in co-relation 140. Up to 41 conditions per place. [2022-12-11 19:40:46,313 INFO L137 encePairwiseOnDemand]: 94/109 looper letters, 24 selfloop transitions, 3 changer transitions 8/104 dead transitions. [2022-12-11 19:40:46,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 104 transitions, 299 flow [2022-12-11 19:40:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:40:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:40:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 591 transitions. [2022-12-11 19:40:46,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7745740498034076 [2022-12-11 19:40:46,330 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 210 flow. Second operand 7 states and 591 transitions. [2022-12-11 19:40:46,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 104 transitions, 299 flow [2022-12-11 19:40:46,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 104 transitions, 285 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-11 19:40:46,336 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 207 flow [2022-12-11 19:40:46,338 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2022-12-11 19:40:46,341 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2022-12-11 19:40:46,341 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 207 flow [2022-12-11 19:40:46,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:46,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:46,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:46,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:40:46,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1221264519, now seen corresponding path program 1 times [2022-12-11 19:40:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:46,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227848531] [2022-12-11 19:40:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:40:46,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:46,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227848531] [2022-12-11 19:40:46,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227848531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:40:46,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:40:46,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:40:46,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378568242] [2022-12-11 19:40:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:40:46,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:40:46,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:40:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:40:46,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-11 19:40:46,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:46,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:46,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-11 19:40:46,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:46,680 INFO L130 PetriNetUnfolder]: 95/393 cut-off events. [2022-12-11 19:40:46,680 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-11 19:40:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 393 events. 95/393 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1774 event pairs, 42 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 641. Up to 136 conditions per place. [2022-12-11 19:40:46,686 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 37 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2022-12-11 19:40:46,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 338 flow [2022-12-11 19:40:46,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:40:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:40:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 646 transitions. [2022-12-11 19:40:46,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7408256880733946 [2022-12-11 19:40:46,688 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 207 flow. Second operand 8 states and 646 transitions. [2022-12-11 19:40:46,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 338 flow [2022-12-11 19:40:46,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 110 transitions, 331 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-11 19:40:46,691 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 236 flow [2022-12-11 19:40:46,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=236, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2022-12-11 19:40:46,692 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 5 predicate places. [2022-12-11 19:40:46,692 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 236 flow [2022-12-11 19:40:46,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:46,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:46,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:46,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:40:46,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:46,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 245399257, now seen corresponding path program 1 times [2022-12-11 19:40:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:46,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674555943] [2022-12-11 19:40:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:40:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:46,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674555943] [2022-12-11 19:40:46,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674555943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:40:46,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:40:46,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:40:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205813487] [2022-12-11 19:40:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:40:46,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:40:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:40:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:40:46,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-11 19:40:46,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:46,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:46,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-11 19:40:46,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:46,909 INFO L130 PetriNetUnfolder]: 81/316 cut-off events. [2022-12-11 19:40:46,909 INFO L131 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2022-12-11 19:40:46,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 316 events. 81/316 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1251 event pairs, 47 based on Foata normal form. 3/294 useless extension candidates. Maximal degree in co-relation 419. Up to 144 conditions per place. [2022-12-11 19:40:46,910 INFO L137 encePairwiseOnDemand]: 100/109 looper letters, 25 selfloop transitions, 6 changer transitions 11/107 dead transitions. [2022-12-11 19:40:46,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 347 flow [2022-12-11 19:40:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:40:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:40:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2022-12-11 19:40:46,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7362385321100917 [2022-12-11 19:40:46,912 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 236 flow. Second operand 8 states and 642 transitions. [2022-12-11 19:40:46,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 347 flow [2022-12-11 19:40:46,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 107 transitions, 337 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-11 19:40:46,915 INFO L231 Difference]: Finished difference. Result has 107 places, 93 transitions, 230 flow [2022-12-11 19:40:46,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=93} [2022-12-11 19:40:46,915 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2022-12-11 19:40:46,916 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 93 transitions, 230 flow [2022-12-11 19:40:46,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.0) internal successors, (546), 7 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:46,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:46,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:46,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:40:46,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:46,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:46,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1245013601, now seen corresponding path program 1 times [2022-12-11 19:40:46,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:46,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184975197] [2022-12-11 19:40:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:46,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:47,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184975197] [2022-12-11 19:40:47,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184975197] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:40:47,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701646381] [2022-12-11 19:40:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:47,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:40:47,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:40:47,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:40:47,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 19:40:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:47,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 19:40:47,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:40:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:47,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:40:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:47,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701646381] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:40:47,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:40:47,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-11 19:40:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376429342] [2022-12-11 19:40:47,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:40:47,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:40:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:47,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:40:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-11 19:40:47,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-11 19:40:47,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 93 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:47,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:47,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-11 19:40:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:47,456 INFO L130 PetriNetUnfolder]: 70/250 cut-off events. [2022-12-11 19:40:47,456 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-11 19:40:47,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 250 events. 70/250 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 842 event pairs, 14 based on Foata normal form. 9/252 useless extension candidates. Maximal degree in co-relation 414. Up to 79 conditions per place. [2022-12-11 19:40:47,457 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 27 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2022-12-11 19:40:47,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 99 transitions, 315 flow [2022-12-11 19:40:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:40:47,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:40:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 559 transitions. [2022-12-11 19:40:47,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7326343381389253 [2022-12-11 19:40:47,459 INFO L175 Difference]: Start difference. First operand has 107 places, 93 transitions, 230 flow. Second operand 7 states and 559 transitions. [2022-12-11 19:40:47,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 99 transitions, 315 flow [2022-12-11 19:40:47,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 289 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-12-11 19:40:47,461 INFO L231 Difference]: Finished difference. Result has 103 places, 95 transitions, 241 flow [2022-12-11 19:40:47,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=103, PETRI_TRANSITIONS=95} [2022-12-11 19:40:47,462 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 6 predicate places. [2022-12-11 19:40:47,462 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 95 transitions, 241 flow [2022-12-11 19:40:47,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:47,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:47,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:47,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-11 19:40:47,668 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 [2022-12-11 19:40:47,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1050779783, now seen corresponding path program 1 times [2022-12-11 19:40:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:47,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148409099] [2022-12-11 19:40:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148409099] [2022-12-11 19:40:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148409099] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:40:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725999873] [2022-12-11 19:40:47,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:40:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:40:47,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:40:47,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 19:40:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:47,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-11 19:40:47,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:40:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:47,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:40:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725999873] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 19:40:47,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 19:40:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-12-11 19:40:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509228449] [2022-12-11 19:40:47,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:40:47,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:40:47,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:47,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:40:47,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-12-11 19:40:47,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 109 [2022-12-11 19:40:47,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 95 transitions, 241 flow. Second operand has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:47,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:47,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 109 [2022-12-11 19:40:47,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:48,059 INFO L130 PetriNetUnfolder]: 59/252 cut-off events. [2022-12-11 19:40:48,059 INFO L131 PetriNetUnfolder]: For 76/90 co-relation queries the response was YES. [2022-12-11 19:40:48,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 252 events. 59/252 cut-off events. For 76/90 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 791 event pairs, 20 based on Foata normal form. 14/253 useless extension candidates. Maximal degree in co-relation 416. Up to 67 conditions per place. [2022-12-11 19:40:48,060 INFO L137 encePairwiseOnDemand]: 101/109 looper letters, 29 selfloop transitions, 7 changer transitions 0/101 dead transitions. [2022-12-11 19:40:48,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 334 flow [2022-12-11 19:40:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:40:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:40:48,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 559 transitions. [2022-12-11 19:40:48,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7326343381389253 [2022-12-11 19:40:48,062 INFO L175 Difference]: Start difference. First operand has 103 places, 95 transitions, 241 flow. Second operand 7 states and 559 transitions. [2022-12-11 19:40:48,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 101 transitions, 334 flow [2022-12-11 19:40:48,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 325 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-11 19:40:48,064 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 260 flow [2022-12-11 19:40:48,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2022-12-11 19:40:48,064 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 10 predicate places. [2022-12-11 19:40:48,064 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 260 flow [2022-12-11 19:40:48,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.28571428571429) internal successors, (548), 7 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:48,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:48,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:48,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-11 19:40:48,270 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 [2022-12-11 19:40:48,270 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 635154899, now seen corresponding path program 1 times [2022-12-11 19:40:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:48,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315173779] [2022-12-11 19:40:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:48,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:48,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315173779] [2022-12-11 19:40:48,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315173779] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:40:48,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252562749] [2022-12-11 19:40:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:48,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:40:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:40:48,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:40:48,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 19:40:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:48,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 61 conjunts are in the unsatisfiable core [2022-12-11 19:40:48,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:40:49,117 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 [2022-12-11 19:40:49,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 19:40:49,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 19:40:49,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:40:49,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:40:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:49,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252562749] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:40:49,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:40:49,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 11] total 35 [2022-12-11 19:40:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796895108] [2022-12-11 19:40:49,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:40:49,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-11 19:40:49,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-11 19:40:49,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1071, Unknown=10, NotChecked=0, Total=1190 [2022-12-11 19:40:49,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 109 [2022-12-11 19:40:49,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 260 flow. Second operand has 35 states, 35 states have (on average 41.542857142857144) internal successors, (1454), 35 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:49,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:49,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 109 [2022-12-11 19:40:49,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:51,341 INFO L130 PetriNetUnfolder]: 978/2087 cut-off events. [2022-12-11 19:40:51,341 INFO L131 PetriNetUnfolder]: For 1288/1288 co-relation queries the response was YES. [2022-12-11 19:40:51,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5022 conditions, 2087 events. 978/2087 cut-off events. For 1288/1288 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14133 event pairs, 104 based on Foata normal form. 2/2078 useless extension candidates. Maximal degree in co-relation 4933. Up to 450 conditions per place. [2022-12-11 19:40:51,352 INFO L137 encePairwiseOnDemand]: 85/109 looper letters, 231 selfloop transitions, 81 changer transitions 8/353 dead transitions. [2022-12-11 19:40:51,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 353 transitions, 1741 flow [2022-12-11 19:40:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-11 19:40:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2022-12-11 19:40:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2068 transitions. [2022-12-11 19:40:51,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.412445153570004 [2022-12-11 19:40:51,357 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 260 flow. Second operand 46 states and 2068 transitions. [2022-12-11 19:40:51,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 353 transitions, 1741 flow [2022-12-11 19:40:51,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 353 transitions, 1705 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-11 19:40:51,363 INFO L231 Difference]: Finished difference. Result has 167 places, 177 transitions, 863 flow [2022-12-11 19:40:51,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=863, PETRI_PLACES=167, PETRI_TRANSITIONS=177} [2022-12-11 19:40:51,364 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 70 predicate places. [2022-12-11 19:40:51,364 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 177 transitions, 863 flow [2022-12-11 19:40:51,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 41.542857142857144) internal successors, (1454), 35 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:51,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:51,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:51,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 19:40:51,590 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 [2022-12-11 19:40:51,590 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1883941547, now seen corresponding path program 2 times [2022-12-11 19:40:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:51,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900167526] [2022-12-11 19:40:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:40:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:40:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:40:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900167526] [2022-12-11 19:40:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900167526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:40:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243312716] [2022-12-11 19:40:52,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:40:52,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:40:52,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:40:52,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 19:40:52,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 19:40:52,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 19:40:52,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:40:52,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-11 19:40:52,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:40:52,543 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 [2022-12-11 19:40:52,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 19:40:52,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 19:40:52,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-11 19:40:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:40:52,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:40:52,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_134 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) c_~A~0.base) c_~A~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0))) is different from false [2022-12-11 19:40:53,069 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_133))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) c_~A~0.base) c_~A~0.offset) (+ c_~counter~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2022-12-11 19:40:53,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_133))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) (+ (select (select .cse0 |c_ULTIMATE.start_main_#t~ret8#1.base|) |c_ULTIMATE.start_main_#t~ret8#1.offset|) c_~counter~0)))) is different from false [2022-12-11 19:40:53,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_133))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) is different from false [2022-12-11 19:40:53,140 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_133))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_134) |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|))))) is different from false [2022-12-11 19:40:53,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:40:53,179 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 [2022-12-11 19:40:53,190 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 138 treesize of output 122 [2022-12-11 19:40:53,193 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 122 treesize of output 114 [2022-12-11 19:40:53,198 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 114 treesize of output 106 [2022-12-11 19:40:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-11 19:40:53,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243312716] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:40:53,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:40:53,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 46 [2022-12-11 19:40:53,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201791128] [2022-12-11 19:40:53,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:40:53,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-11 19:40:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:40:53,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-11 19:40:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1470, Unknown=45, NotChecked=410, Total=2070 [2022-12-11 19:40:53,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 109 [2022-12-11 19:40:53,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 177 transitions, 863 flow. Second operand has 46 states, 46 states have (on average 38.02173913043478) internal successors, (1749), 46 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:53,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:40:53,455 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 109 [2022-12-11 19:40:53,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:40:56,372 INFO L130 PetriNetUnfolder]: 1534/3224 cut-off events. [2022-12-11 19:40:56,372 INFO L131 PetriNetUnfolder]: For 8379/8384 co-relation queries the response was YES. [2022-12-11 19:40:56,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10279 conditions, 3224 events. 1534/3224 cut-off events. For 8379/8384 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 24265 event pairs, 96 based on Foata normal form. 6/3221 useless extension candidates. Maximal degree in co-relation 10213. Up to 500 conditions per place. [2022-12-11 19:40:56,390 INFO L137 encePairwiseOnDemand]: 83/109 looper letters, 251 selfloop transitions, 130 changer transitions 8/419 dead transitions. [2022-12-11 19:40:56,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 419 transitions, 2923 flow [2022-12-11 19:40:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-11 19:40:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-11 19:40:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 1973 transitions. [2022-12-11 19:40:56,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3851259027913332 [2022-12-11 19:40:56,395 INFO L175 Difference]: Start difference. First operand has 167 places, 177 transitions, 863 flow. Second operand 47 states and 1973 transitions. [2022-12-11 19:40:56,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 419 transitions, 2923 flow [2022-12-11 19:40:56,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 419 transitions, 2759 flow, removed 69 selfloop flow, removed 14 redundant places. [2022-12-11 19:40:56,423 INFO L231 Difference]: Finished difference. Result has 213 places, 243 transitions, 1701 flow [2022-12-11 19:40:56,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1701, PETRI_PLACES=213, PETRI_TRANSITIONS=243} [2022-12-11 19:40:56,424 INFO L295 CegarLoopForPetriNet]: 97 programPoint places, 116 predicate places. [2022-12-11 19:40:56,424 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 243 transitions, 1701 flow [2022-12-11 19:40:56,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 38.02173913043478) internal successors, (1749), 46 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:40:56,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:40:56,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:40:56,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-11 19:40:56,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:40:56,630 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-11 19:40:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:40:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash -158911937, now seen corresponding path program 3 times [2022-12-11 19:40:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:40:56,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150442243] [2022-12-11 19:40:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:40:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:40:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:40:56,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 19:40:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 19:40:56,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 19:40:56,740 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 19:40:56,741 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-11 19:40:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-11 19:40:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-11 19:40:56,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:40:56,743 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-12-11 19:40:56,748 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 19:40:56,748 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 19:40:56,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 07:40:56 BasicIcfg [2022-12-11 19:40:56,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 19:40:56,813 INFO L158 Benchmark]: Toolchain (without parser) took 12271.59ms. Allocated memory was 213.9MB in the beginning and 424.7MB in the end (delta: 210.8MB). Free memory was 188.6MB in the beginning and 242.8MB in the end (delta: -54.3MB). Peak memory consumption was 158.0MB. Max. memory is 8.0GB. [2022-12-11 19:40:56,813 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 213.9MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 19:40:56,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.23ms. Allocated memory is still 213.9MB. Free memory was 188.0MB in the beginning and 176.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-11 19:40:56,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.05ms. Allocated memory is still 213.9MB. Free memory was 176.0MB in the beginning and 173.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:40:56,813 INFO L158 Benchmark]: Boogie Preprocessor took 39.07ms. Allocated memory is still 213.9MB. Free memory was 173.9MB in the beginning and 172.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 19:40:56,814 INFO L158 Benchmark]: RCFGBuilder took 530.96ms. Allocated memory is still 213.9MB. Free memory was 172.3MB in the beginning and 147.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-11 19:40:56,814 INFO L158 Benchmark]: TraceAbstraction took 11383.03ms. Allocated memory was 213.9MB in the beginning and 424.7MB in the end (delta: 210.8MB). Free memory was 146.1MB in the beginning and 242.8MB in the end (delta: -96.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2022-12-11 19:40:56,815 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.11ms. Allocated memory is still 213.9MB. Free memory is still 189.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 267.23ms. Allocated memory is still 213.9MB. Free memory was 188.0MB in the beginning and 176.0MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.05ms. Allocated memory is still 213.9MB. Free memory was 176.0MB in the beginning and 173.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.07ms. Allocated memory is still 213.9MB. Free memory was 173.9MB in the beginning and 172.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 530.96ms. Allocated memory is still 213.9MB. Free memory was 172.3MB in the beginning and 147.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 11383.03ms. Allocated memory was 213.9MB in the beginning and 424.7MB in the end (delta: 210.8MB). Free memory was 146.1MB in the beginning and 242.8MB in the end (delta: -96.7MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, counter=0, N=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, counter=0, N=0, t1={6:0}, t2={5:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, A={0:0}, counter=0, N=1, t1={6:0}, t2={5:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [\old(size)=1, A={0:0}, arr={3:0}, counter=0, malloc(sizeof(int) * (size_t)size)={3:0}, N=1, size=1] [L97] 0 int i = 0; VAL [\old(size)=1, A={0:0}, arr={3:0}, counter=0, i=0, N=1, size=1] [L97] COND TRUE 0 i < size VAL [\old(size)=1, A={0:0}, arr={3:0}, counter=0, i=0, N=1, size=1] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=1, __VERIFIER_nondet_int()=7, A={0:0}, arr={3:0}, counter=0, i=0, N=1, size=1] [L97] 0 i++ VAL [\old(size)=1, A={0:0}, arr={3:0}, counter=0, i=1, N=1, size=1] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=1, A={0:0}, arr={3:0}, counter=0, i=1, N=1, size=1] [L100] 0 return arr; VAL [\old(size)=1, \result={3:0}, A={0:0}, arr={3:0}, counter=0, i=1, N=1, size=1] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, counter=0, create_fresh_int_array(N)={3:0}, N=1, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, counter=0, N=1, pthread_create(&t1, 0, thread1, 0)=-1, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, counter=0, i=0, N=1] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, counter=0, N=1, pthread_create(&t2, 0, thread2, 0)=0, t1={6:0}, t2={5:0}] [L83] 0 \read(t1) VAL [\read(t1)=-1, A={3:0}, counter=0, N=1, t1={6:0}, t2={5:0}] [L62] 2 int i=0; VAL [A={3:0}, counter=0, i=0, N=1] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, counter=-7, i=0, N=1, tmp=-7] [L62] 2 i++ VAL [A={3:0}, counter=-7, i=1, N=1, tmp=-7] [L62] COND FALSE 2 !(i