/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-SemanticLbe.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-8d0d62b [2022-12-05 21:25:14,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 21:25:14,663 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 21:25:14,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 21:25:14,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 21:25:14,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 21:25:14,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 21:25:14,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 21:25:14,718 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 21:25:14,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 21:25:14,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 21:25:14,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 21:25:14,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 21:25:14,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 21:25:14,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 21:25:14,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 21:25:14,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 21:25:14,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 21:25:14,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 21:25:14,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 21:25:14,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 21:25:14,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 21:25:14,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 21:25:14,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 21:25:14,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 21:25:14,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 21:25:14,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 21:25:14,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 21:25:14,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 21:25:14,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 21:25:14,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 21:25:14,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 21:25:14,746 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 21:25:14,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 21:25:14,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 21:25:14,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 21:25:14,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 21:25:14,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 21:25:14,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 21:25:14,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 21:25:14,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 21:25:14,758 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-SemanticLbe.epf [2022-12-05 21:25:14,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 21:25:14,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 21:25:14,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 21:25:14,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 21:25:14,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 21:25:14,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 21:25:14,794 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 21:25:14,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 21:25:14,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 21:25:14,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 21:25:14,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 21:25:14,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 21:25:14,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 21:25:14,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 21:25:14,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 21:25:14,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 21:25:14,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:25:14,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 21:25:14,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 21:25:14,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 21:25:14,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 21:25:14,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 21:25:14,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 21:25:14,798 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-05 21:25:15,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 21:25:15,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 21:25:15,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 21:25:15,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 21:25:15,115 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 21:25:15,116 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-05 21:25:16,170 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 21:25:16,401 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 21:25:16,401 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-12-05 21:25:16,408 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e36ca33/b3ec15ede63241f5b5c733c36ad061c9/FLAGabd2f77ba [2022-12-05 21:25:16,419 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e36ca33/b3ec15ede63241f5b5c733c36ad061c9 [2022-12-05 21:25:16,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 21:25:16,422 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 21:25:16,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 21:25:16,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 21:25:16,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 21:25:16,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563e4ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16, skipping insertion in model container [2022-12-05 21:25:16,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 21:25:16,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 21:25:16,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,633 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,643 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-05 21:25:16,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:25:16,672 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 21:25:16,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 21:25:16,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 21:25:16,707 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-05 21:25:16,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 21:25:16,731 INFO L208 MainTranslator]: Completed translation [2022-12-05 21:25:16,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16 WrapperNode [2022-12-05 21:25:16,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 21:25:16,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 21:25:16,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 21:25:16,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 21:25:16,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,782 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-05 21:25:16,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 21:25:16,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 21:25:16,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 21:25:16,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 21:25:16,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,818 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 21:25:16,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 21:25:16,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 21:25:16,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 21:25:16,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (1/1) ... [2022-12-05 21:25:16,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 21:25:16,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:25:16,864 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-05 21:25:16,888 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-05 21:25:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 21:25:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 21:25:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 21:25:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 21:25:16,902 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 21:25:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 21:25:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 21:25:16,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 21:25:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 21:25:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 21:25:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 21:25:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-05 21:25:16,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 21:25:16,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 21:25:16,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 21:25:16,905 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 21:25:17,007 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 21:25:17,008 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 21:25:17,316 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 21:25:17,505 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 21:25:17,505 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-05 21:25:17,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:25:17 BoogieIcfgContainer [2022-12-05 21:25:17,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 21:25:17,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 21:25:17,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 21:25:17,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 21:25:17,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:25:16" (1/3) ... [2022-12-05 21:25:17,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515d18db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:25:17, skipping insertion in model container [2022-12-05 21:25:17,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:25:16" (2/3) ... [2022-12-05 21:25:17,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515d18db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:25:17, skipping insertion in model container [2022-12-05 21:25:17,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:25:17" (3/3) ... [2022-12-05 21:25:17,523 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-12-05 21:25:17,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 21:25:17,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 21:25:17,539 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 21:25:17,606 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-05 21:25:17,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 109 transitions, 234 flow [2022-12-05 21:25:17,718 INFO L130 PetriNetUnfolder]: 9/107 cut-off events. [2022-12-05 21:25:17,718 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 21:25:17,722 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-05 21:25:17,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 109 transitions, 234 flow [2022-12-05 21:25:17,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 210 flow [2022-12-05 21:25:17,727 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 21:25:17,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 99 transitions, 210 flow [2022-12-05 21:25:17,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 210 flow [2022-12-05 21:25:17,782 INFO L130 PetriNetUnfolder]: 9/99 cut-off events. [2022-12-05 21:25:17,782 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 21:25:17,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 99 events. 9/99 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-05 21:25:17,784 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 99 transitions, 210 flow [2022-12-05 21:25:17,784 INFO L188 LiptonReduction]: Number of co-enabled transitions 572 [2022-12-05 21:25:22,033 INFO L203 LiptonReduction]: Total number of compositions: 80 [2022-12-05 21:25:22,047 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 21:25:22,053 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;@5df0781e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 21:25:22,053 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-05 21:25:22,058 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-05 21:25:22,058 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 21:25:22,058 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:22,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:22,059 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-05 21:25:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:22,063 INFO L85 PathProgramCache]: Analyzing trace with hash 2063872509, now seen corresponding path program 1 times [2022-12-05 21:25:22,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:22,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154388991] [2022-12-05 21:25:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:22,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:22,407 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-05 21:25:22,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:25:22,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154388991] [2022-12-05 21:25:22,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154388991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:25:22,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:25:22,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 21:25:22,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346611359] [2022-12-05 21:25:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:25:22,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 21:25:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:25:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 21:25:22,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 21:25:22,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-05 21:25:22,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 21:25:22,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:25:22,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-05 21:25:22,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:25:22,521 INFO L130 PetriNetUnfolder]: 114/197 cut-off events. [2022-12-05 21:25:22,521 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-05 21:25:22,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 197 events. 114/197 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 723 event pairs, 24 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2022-12-05 21:25:22,524 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 25 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2022-12-05 21:25:22,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2022-12-05 21:25:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 21:25:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 21:25:22,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 21:25:22,536 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.631578947368421 [2022-12-05 21:25:22,538 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 36 transitions. [2022-12-05 21:25:22,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2022-12-05 21:25:22,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 21:25:22,543 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2022-12-05 21:25:22,544 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2022-12-05 21:25:22,549 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2022-12-05 21:25:22,549 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2022-12-05 21:25:22,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-05 21:25:22,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:22,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:22,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 21:25:22,550 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-05 21:25:22,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1182956833, now seen corresponding path program 1 times [2022-12-05 21:25:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:22,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914310498] [2022-12-05 21:25:22,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:22,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:22,754 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-05 21:25:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:25:22,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914310498] [2022-12-05 21:25:22,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914310498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:25:22,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:25:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 21:25:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258171034] [2022-12-05 21:25:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:25:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 21:25:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:25:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 21:25:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 21:25:22,757 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 21:25:22,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-05 21:25:22,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:25:22,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 21:25:22,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:25:22,898 INFO L130 PetriNetUnfolder]: 178/329 cut-off events. [2022-12-05 21:25:22,898 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-05 21:25:22,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 329 events. 178/329 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1381 event pairs, 83 based on Foata normal form. 0/264 useless extension candidates. Maximal degree in co-relation 276. Up to 207 conditions per place. [2022-12-05 21:25:22,906 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 39 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2022-12-05 21:25:22,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 44 transitions, 210 flow [2022-12-05 21:25:22,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 21:25:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 21:25:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-05 21:25:22,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-05 21:25:22,910 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 45 transitions. [2022-12-05 21:25:22,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 44 transitions, 210 flow [2022-12-05 21:25:22,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 44 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 21:25:22,912 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 86 flow [2022-12-05 21:25:22,912 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2022-12-05 21:25:22,913 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2022-12-05 21:25:22,913 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 86 flow [2022-12-05 21:25:22,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-05 21:25:22,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:22,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:22,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 21:25:22,914 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-05 21:25:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash 598850997, now seen corresponding path program 1 times [2022-12-05 21:25:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:22,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678202012] [2022-12-05 21:25:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:23,043 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-05 21:25:23,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:25:23,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678202012] [2022-12-05 21:25:23,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678202012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 21:25:23,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 21:25:23,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 21:25:23,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715256950] [2022-12-05 21:25:23,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:25:23,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 21:25:23,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:25:23,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 21:25:23,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 21:25:23,046 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 21:25:23,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-05 21:25:23,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:25:23,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 21:25:23,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:25:23,159 INFO L130 PetriNetUnfolder]: 132/246 cut-off events. [2022-12-05 21:25:23,159 INFO L131 PetriNetUnfolder]: For 45/52 co-relation queries the response was YES. [2022-12-05 21:25:23,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 246 events. 132/246 cut-off events. For 45/52 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 950 event pairs, 81 based on Foata normal form. 7/232 useless extension candidates. Maximal degree in co-relation 482. Up to 205 conditions per place. [2022-12-05 21:25:23,161 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 19 selfloop transitions, 2 changer transitions 16/38 dead transitions. [2022-12-05 21:25:23,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 191 flow [2022-12-05 21:25:23,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 21:25:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 21:25:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-05 21:25:23,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-05 21:25:23,162 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 86 flow. Second operand 5 states and 40 transitions. [2022-12-05 21:25:23,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 191 flow [2022-12-05 21:25:23,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 187 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-05 21:25:23,164 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 78 flow [2022-12-05 21:25:23,164 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-05 21:25:23,165 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2022-12-05 21:25:23,165 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 78 flow [2022-12-05 21:25:23,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-05 21:25:23,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:23,165 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 21:25:23,166 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-05 21:25:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -909321198, now seen corresponding path program 1 times [2022-12-05 21:25:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:23,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508205373] [2022-12-05 21:25:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:23,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:25:23,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:25:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508205373] [2022-12-05 21:25:23,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508205373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:25:23,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261434962] [2022-12-05 21:25:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:23,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:25:23,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:25:23,259 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-05 21:25:23,288 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-05 21:25:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:23,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 21:25:23,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:25:23,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:25:23,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:25:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 21:25:23,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261434962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:25:23,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:25:23,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-05 21:25:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693782148] [2022-12-05 21:25:23,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:25:23,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-05 21:25:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:25:23,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-05 21:25:23,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 21:25:23,462 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 21:25:23,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-05 21:25:23,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:25:23,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 21:25:23,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:25:23,597 INFO L130 PetriNetUnfolder]: 128/224 cut-off events. [2022-12-05 21:25:23,597 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-05 21:25:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 224 events. 128/224 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 766 event pairs, 35 based on Foata normal form. 16/237 useless extension candidates. Maximal degree in co-relation 572. Up to 120 conditions per place. [2022-12-05 21:25:23,599 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2022-12-05 21:25:23,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 196 flow [2022-12-05 21:25:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 21:25:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 21:25:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-05 21:25:23,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2022-12-05 21:25:23,601 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-05 21:25:23,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 196 flow [2022-12-05 21:25:23,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 37 transitions, 176 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-05 21:25:23,603 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 97 flow [2022-12-05 21:25:23,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-05 21:25:23,604 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2022-12-05 21:25:23,604 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 97 flow [2022-12-05 21:25:23,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-05 21:25:23,604 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:23,604 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:23,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-05 21:25:23,809 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-05 21:25:23,810 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-05 21:25:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1601860688, now seen corresponding path program 1 times [2022-12-05 21:25:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175006356] [2022-12-05 21:25:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:23,898 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-05 21:25:23,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:25:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175006356] [2022-12-05 21:25:23,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175006356] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:25:23,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964589709] [2022-12-05 21:25:23,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:23,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:25:23,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:25:23,901 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-05 21:25:23,931 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-05 21:25:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:23,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-05 21:25:23,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:25:24,022 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-05 21:25:24,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:25:24,047 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-05 21:25:24,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964589709] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-05 21:25:24,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-05 21:25:24,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-05 21:25:24,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998916307] [2022-12-05 21:25:24,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 21:25:24,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 21:25:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:25:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 21:25:24,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-05 21:25:24,051 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-05 21:25:24,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 21:25:24,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:25:24,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-05 21:25:24,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:25:24,112 INFO L130 PetriNetUnfolder]: 105/188 cut-off events. [2022-12-05 21:25:24,112 INFO L131 PetriNetUnfolder]: For 128/146 co-relation queries the response was YES. [2022-12-05 21:25:24,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 188 events. 105/188 cut-off events. For 128/146 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 583 event pairs, 36 based on Foata normal form. 18/191 useless extension candidates. Maximal degree in co-relation 511. Up to 107 conditions per place. [2022-12-05 21:25:24,114 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 27 selfloop transitions, 6 changer transitions 0/34 dead transitions. [2022-12-05 21:25:24,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 208 flow [2022-12-05 21:25:24,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 21:25:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 21:25:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-12-05 21:25:24,116 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3368421052631579 [2022-12-05 21:25:24,116 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 97 flow. Second operand 5 states and 32 transitions. [2022-12-05 21:25:24,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 208 flow [2022-12-05 21:25:24,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 21:25:24,119 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 121 flow [2022-12-05 21:25:24,119 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2022-12-05 21:25:24,121 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 11 predicate places. [2022-12-05 21:25:24,122 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 121 flow [2022-12-05 21:25:24,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-05 21:25:24,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:24,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:24,130 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-05 21:25:24,327 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-05 21:25:24,327 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-05 21:25:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -245931050, now seen corresponding path program 1 times [2022-12-05 21:25:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:24,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222127647] [2022-12-05 21:25:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:24,770 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-05 21:25:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:25:24,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222127647] [2022-12-05 21:25:24,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222127647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:25:24,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474419878] [2022-12-05 21:25:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:24,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:25:24,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:25:24,773 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-05 21:25:24,803 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-05 21:25:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:25:24,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-05 21:25:24,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:25:24,903 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-05 21:25:24,938 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-05 21:25:25,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-05 21:25:25,031 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-05 21:25:25,083 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-05 21:25:25,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:25:25,183 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ (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-05 21:25:25,188 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0))) is different from false [2022-12-05 21:25:25,197 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2022-12-05 21:25:25,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-05 21:25:25,206 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-05 21:25:25,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2022-12-05 21:25:25,223 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 254 treesize of output 238 [2022-12-05 21:25:25,227 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 238 treesize of output 222 [2022-12-05 21:25:25,462 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-05 21:25:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474419878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:25:25,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:25:25,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2022-12-05 21:25:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112857012] [2022-12-05 21:25:25,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:25:25,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-05 21:25:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:25:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-05 21:25:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=425, Unknown=11, NotChecked=132, Total=650 [2022-12-05 21:25:25,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 21:25:25,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 121 flow. Second operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 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-05 21:25:25,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:25:25,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 21:25:25,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:25:26,357 INFO L130 PetriNetUnfolder]: 361/637 cut-off events. [2022-12-05 21:25:26,357 INFO L131 PetriNetUnfolder]: For 663/663 co-relation queries the response was YES. [2022-12-05 21:25:26,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 637 events. 361/637 cut-off events. For 663/663 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2640 event pairs, 18 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 2130. Up to 213 conditions per place. [2022-12-05 21:25:26,362 INFO L137 encePairwiseOnDemand]: 7/19 looper letters, 113 selfloop transitions, 47 changer transitions 2/162 dead transitions. [2022-12-05 21:25:26,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 162 transitions, 1031 flow [2022-12-05 21:25:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 21:25:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 21:25:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 157 transitions. [2022-12-05 21:25:26,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35926773455377575 [2022-12-05 21:25:26,371 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 121 flow. Second operand 23 states and 157 transitions. [2022-12-05 21:25:26,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 162 transitions, 1031 flow [2022-12-05 21:25:26,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 162 transitions, 1003 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 21:25:26,378 INFO L231 Difference]: Finished difference. Result has 63 places, 76 transitions, 611 flow [2022-12-05 21:25:26,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=611, PETRI_PLACES=63, PETRI_TRANSITIONS=76} [2022-12-05 21:25:26,380 INFO L294 CegarLoopForPetriNet]: 23 programPoint places, 40 predicate places. [2022-12-05 21:25:26,380 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 76 transitions, 611 flow [2022-12-05 21:25:26,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 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-05 21:25:26,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:25:26,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:25:26,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-05 21:25:26,586 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-05 21:25:26,587 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-05 21:25:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:25:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1817834156, now seen corresponding path program 2 times [2022-12-05 21:25:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:25:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574263531] [2022-12-05 21:25:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:25:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:25:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 21:25:26,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 21:25:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 21:25:26,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 21:25:26,694 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 21:25:26,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-05 21:25:26,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-05 21:25:26,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-05 21:25:26,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 21:25:26,698 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-05 21:25:26,702 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 21:25:26,702 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 21:25:26,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:25:26 BasicIcfg [2022-12-05 21:25:26,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 21:25:26,765 INFO L158 Benchmark]: Toolchain (without parser) took 10340.76ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 156.7MB in the beginning and 160.0MB in the end (delta: -3.3MB). Peak memory consumption was 34.3MB. Max. memory is 8.0GB. [2022-12-05 21:25:26,766 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 127.9MB. Free memory was 104.8MB in the beginning and 104.7MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 21:25:26,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.31ms. Allocated memory is still 180.4MB. Free memory was 156.7MB in the beginning and 144.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-05 21:25:26,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.93ms. Allocated memory is still 180.4MB. Free memory was 144.1MB in the beginning and 142.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 21:25:26,767 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 140.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 21:25:26,767 INFO L158 Benchmark]: RCFGBuilder took 677.88ms. Allocated memory is still 180.4MB. Free memory was 140.6MB in the beginning and 154.3MB in the end (delta: -13.7MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2022-12-05 21:25:26,769 INFO L158 Benchmark]: TraceAbstraction took 9248.57ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 153.8MB in the beginning and 160.0MB in the end (delta: -6.2MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB. [2022-12-05 21:25:26,770 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.13ms. Allocated memory is still 127.9MB. Free memory was 104.8MB in the beginning and 104.7MB in the end (delta: 69.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.31ms. Allocated memory is still 180.4MB. Free memory was 156.7MB in the beginning and 144.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.93ms. Allocated memory is still 180.4MB. Free memory was 144.1MB in the beginning and 142.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 180.4MB. Free memory was 142.0MB in the beginning and 140.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 677.88ms. Allocated memory is still 180.4MB. Free memory was 140.6MB in the beginning and 154.3MB in the end (delta: -13.7MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. * TraceAbstraction took 9248.57ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 153.8MB in the beginning and 160.0MB in the end (delta: -6.2MB). Peak memory consumption was 32.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 97 PlacesBefore, 23 PlacesAfterwards, 99 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 55 TrivialYvCompositions, 19 ConcurrentYvCompositions, 6 ChoiceCompositions, 80 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 324, independent conditional: 324, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 340, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 340, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 340, independent: 324, independent conditional: 0, independent unconditional: 324, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 317, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 317, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 340, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 317, unknown conditional: 0, unknown unconditional: 317] , Statistics on independence cache: Total cache size (in pairs): 499, Positive cache size: 488, Positive conditional cache size: 0, Positive unconditional cache size: 488, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [\old(size)=1, A={0:0}, arr={3:0}, counter=0, i=0, N=1, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [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) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, counter=0, N=1, pthread_create(&t1, 0, thread1, 0)=-2, t1={5:0}, t2={6:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, counter=0, N=1, pthread_create(&t2, 0, thread2, 0)=-1, t1={5:0}, t2={6:0}] [L83] 0 \read(t1) VAL [\read(t1)=-2, A={3:0}, counter=0, N=1, t1={5:0}, t2={6: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]); [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]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={3:0}, counter=-3, i=1, N=1, tmp=-3] [L49] COND FALSE 1 !(i