/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 02:03:49,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 02:03:49,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 02:03:49,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 02:03:49,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 02:03:49,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 02:03:49,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 02:03:49,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 02:03:49,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 02:03:49,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 02:03:49,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 02:03:49,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 02:03:49,990 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 02:03:49,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 02:03:49,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 02:03:49,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 02:03:49,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 02:03:50,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 02:03:50,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 02:03:50,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 02:03:50,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 02:03:50,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 02:03:50,014 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 02:03:50,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 02:03:50,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 02:03:50,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 02:03:50,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 02:03:50,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 02:03:50,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 02:03:50,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 02:03:50,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 02:03:50,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 02:03:50,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 02:03:50,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 02:03:50,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 02:03:50,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 02:03:50,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 02:03:50,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 02:03:50,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 02:03:50,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 02:03:50,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 02:03:50,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 02:03:50,046 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 02:03:50,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 02:03:50,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 02:03:50,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 02:03:50,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 02:03:50,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 02:03:50,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 02:03:50,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 02:03:50,047 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 02:03:50,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 02:03:50,047 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 02:03:50,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 02:03:50,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 02:03:50,053 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 02:03:50,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 02:03:50,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 02:03:50,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 02:03:50,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 02:03:50,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 02:03:50,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 02:03:50,054 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 02:03:50,055 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 02:03:50,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 02:03:50,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 02:03:50,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 02:03:50,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 02:03:50,055 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 02:03:50,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-20 02:03:50,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 02:03:50,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 02:03:50,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 02:03:50,273 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 02:03:50,274 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 02:03:50,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-05-20 02:03:50,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3734d4139/ae6f4c8c939040e4af3f0bb5f27c37e7/FLAG30eb6257d [2023-05-20 02:03:50,699 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 02:03:50,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-05-20 02:03:50,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3734d4139/ae6f4c8c939040e4af3f0bb5f27c37e7/FLAG30eb6257d [2023-05-20 02:03:50,715 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3734d4139/ae6f4c8c939040e4af3f0bb5f27c37e7 [2023-05-20 02:03:50,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 02:03:50,719 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 02:03:50,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 02:03:50,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 02:03:50,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 02:03:50,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75989953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50, skipping insertion in model container [2023-05-20 02:03:50,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 02:03:50,739 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 02:03:50,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1910,1923] [2023-05-20 02:03:50,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 02:03:50,883 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 02:03:50,905 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c[1910,1923] [2023-05-20 02:03:50,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 02:03:50,917 INFO L208 MainTranslator]: Completed translation [2023-05-20 02:03:50,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50 WrapperNode [2023-05-20 02:03:50,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 02:03:50,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 02:03:50,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 02:03:50,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 02:03:50,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,942 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-05-20 02:03:50,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 02:03:50,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 02:03:50,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 02:03:50,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 02:03:50,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 02:03:50,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 02:03:50,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 02:03:50,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 02:03:50,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (1/1) ... [2023-05-20 02:03:50,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 02:03:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:03:50,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 02:03:51,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 02:03:51,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 02:03:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 02:03:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 02:03:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 02:03:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 02:03:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 02:03:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 02:03:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 02:03:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 02:03:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 02:03:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 02:03:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 02:03:51,062 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 02:03:51,150 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 02:03:51,151 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 02:03:51,366 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 02:03:51,381 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 02:03:51,381 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-20 02:03:51,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 02:03:51 BoogieIcfgContainer [2023-05-20 02:03:51,382 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 02:03:51,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 02:03:51,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 02:03:51,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 02:03:51,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 02:03:50" (1/3) ... [2023-05-20 02:03:51,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314b8ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 02:03:51, skipping insertion in model container [2023-05-20 02:03:51,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 02:03:50" (2/3) ... [2023-05-20 02:03:51,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314b8ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 02:03:51, skipping insertion in model container [2023-05-20 02:03:51,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 02:03:51" (3/3) ... [2023-05-20 02:03:51,389 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2023-05-20 02:03:51,394 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 02:03:51,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 02:03:51,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 02:03:51,402 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 02:03:51,475 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 02:03:51,525 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 02:03:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 02:03:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:03:51,526 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 02:03:51,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 02:03:51,568 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 02:03:51,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 02:03:51,599 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@7251cff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 02:03:51,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 02:03:51,732 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:03:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:03:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1591861020, now seen corresponding path program 1 times [2023-05-20 02:03:51,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:03:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194311380] [2023-05-20 02:03:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:03:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:51,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:03:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194311380] [2023-05-20 02:03:51,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194311380] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 02:03:51,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 02:03:51,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 02:03:51,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522779187] [2023-05-20 02:03:51,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 02:03:51,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 02:03:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:03:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 02:03:51,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 02:03:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:51,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:03:51,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:03:51,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 02:03:52,030 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:03:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:03:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash -61270225, now seen corresponding path program 1 times [2023-05-20 02:03:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:03:52,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447941553] [2023-05-20 02:03:52,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:52,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:03:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:52,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:03:52,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447941553] [2023-05-20 02:03:52,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447941553] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 02:03:52,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 02:03:52,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-20 02:03:52,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133068474] [2023-05-20 02:03:52,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 02:03:52,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-20 02:03:52,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:03:52,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-20 02:03:52,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 02:03:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:52,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:03:52,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:03:52,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:52,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:03:52,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 02:03:52,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:03:52,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:03:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 655116107, now seen corresponding path program 1 times [2023-05-20 02:03:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:03:52,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712645257] [2023-05-20 02:03:52,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:03:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:03:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712645257] [2023-05-20 02:03:52,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712645257] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:03:52,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868463022] [2023-05-20 02:03:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:03:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:03:52,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 02:03:52,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 02:03:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:53,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 02:03:53,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:03:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:53,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:03:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:53,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868463022] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:03:53,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:03:53,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 13 [2023-05-20 02:03:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591237430] [2023-05-20 02:03:53,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:03:53,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-20 02:03:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:03:53,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-20 02:03:53,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-05-20 02:03:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:53,747 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:03:53,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:03:53,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:53,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 02:03:53,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:54,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:03:54,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 02:03:54,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 02:03:54,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-20 02:03:54,256 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:03:54,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:03:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash 286264451, now seen corresponding path program 1 times [2023-05-20 02:03:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:03:54,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544164977] [2023-05-20 02:03:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:54,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:03:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:03:54,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544164977] [2023-05-20 02:03:54,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544164977] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:03:54,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638041207] [2023-05-20 02:03:54,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:54,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:03:54,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:03:54,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 02:03:54,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 02:03:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:54,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2023-05-20 02:03:54,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:03:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:54,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:03:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:54,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638041207] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:03:54,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:03:54,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 17 [2023-05-20 02:03:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709837482] [2023-05-20 02:03:54,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:03:54,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-20 02:03:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:03:54,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-20 02:03:54,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-05-20 02:03:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:54,947 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:03:54,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0) internal successors, (119), 17 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:03:54,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:54,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:03:54,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-20 02:03:54,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:03:55,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:03:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 02:03:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 02:03:55,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-20 02:03:55,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:03:55,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:03:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:03:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 262151799, now seen corresponding path program 1 times [2023-05-20 02:03:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:03:55,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708759035] [2023-05-20 02:03:55,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:55,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:03:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:56,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:03:56,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708759035] [2023-05-20 02:03:56,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708759035] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:03:56,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874471323] [2023-05-20 02:03:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:03:56,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:03:56,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:03:56,090 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) [2023-05-20 02:03:56,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 02:03:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:03:56,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2023-05-20 02:03:56,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:03:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:03:56,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:04:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:04:00,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874471323] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:04:00,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:04:00,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 37 [2023-05-20 02:04:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537251290] [2023-05-20 02:04:00,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:04:00,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-20 02:04:00,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:04:00,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-20 02:04:00,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2023-05-20 02:04:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:00,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:04:00,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.5945945945945947) internal successors, (133), 37 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:04:00,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:00,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:04:00,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 02:04:00,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 02:04:00,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:04:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 02:04:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 02:04:08,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-05-20 02:04:08,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-20 02:04:08,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:04:08,647 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:04:08,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:04:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 340520229, now seen corresponding path program 2 times [2023-05-20 02:04:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:04:08,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797743615] [2023-05-20 02:04:08,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:04:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:04:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:04:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:04:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:04:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797743615] [2023-05-20 02:04:10,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797743615] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:04:10,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477951806] [2023-05-20 02:04:10,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 02:04:10,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:04:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:04:10,266 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 02:04:10,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-20 02:04:10,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 02:04:10,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 02:04:10,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 37 conjunts are in the unsatisfiable core [2023-05-20 02:04:10,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:04:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:04:19,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:04:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:04:51,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477951806] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:04:51,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:04:51,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 22] total 49 [2023-05-20 02:04:51,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908877068] [2023-05-20 02:04:51,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:04:51,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-20 02:04:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:04:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-20 02:04:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2118, Unknown=11, NotChecked=0, Total=2352 [2023-05-20 02:04:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:51,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:04:51,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.061224489795918) internal successors, (150), 49 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:04:51,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:51,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:04:51,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 02:04:51,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 02:04:51,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-05-20 02:04:51,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:04:57,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:05:25,423 WARN L233 SmtUtils]: Spent 7.55s on a formula simplification. DAG size of input: 91 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:05:27,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:05:39,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:06:02,802 WARN L233 SmtUtils]: Spent 15.50s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:06:05,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:06:07,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:06:26,721 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 91 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:06:29,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-20 02:06:31,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:06:33,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:06:35,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:07:26,784 WARN L233 SmtUtils]: Spent 41.94s on a formula simplification. DAG size of input: 112 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:07:51,712 WARN L233 SmtUtils]: Spent 16.36s on a formula simplification. DAG size of input: 102 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:07:53,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-20 02:07:54,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-20 02:07:57,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:07:59,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:08:01,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:08:03,943 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse2 (mod c_~a~0 4294967296))) (let ((.cse17 (* 2 c_~b~0)) (.cse0 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse2)) (.cse21 (+ c_~x_2~0 .cse11)) (.cse10 (* (div c_~x_2~0 4294967296) 4294967296))) (let ((.cse7 (* 2 (div c_~x_2~0 8589934592))) (.cse3 (< .cse21 (+ c_~x_1~0 .cse10 1))) (.cse4 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse8 (<= (+ c_~x_1~0 .cse10) .cse21)) (.cse12 (not .cse0)) (.cse1 (let ((.cse20 (+ c_~x_2~0 c_~b~0 .cse11)) (.cse19 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse19 c_~x_1~0) .cse20) (< .cse20 (+ .cse19 c_~x_1~0 1))))) (.cse13 (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse2)) (.cse5 (div c_~x_2~0 2)) (.cse6 (- c_~x_1~0)) (.cse16 (div (+ c_~x_2~0 .cse17) 4294967296))) (and (<= c_~a~0 c_~x_1~0) (or .cse0 .cse1 (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse2))) .cse3 (not (<= (+ .cse4 1) 0)) (<= (+ (div (+ (- 1) c_~x_1~0 (* .cse5 4294967294)) 4294967296) (div (+ .cse6 4294967297) 4294967296) .cse7 1) .cse5) .cse8 (<= .cse7 (div (+ .cse6 (- 2) (* .cse5 2) c_~a~0) 4294967296)) (let ((.cse9 (* (div c_~a~0 4294967296) 4294967296))) (or (and .cse3 (or (<= (+ .cse9 c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 .cse10) (+ c_~x_2~0 (* .cse4 4294967296) .cse11 c_~a~0)) .cse8)) (<= (+ .cse9 c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 4294967294) (+ .cse11 c_~a~0)))) (or .cse12 .cse13 (let ((.cse15 (+ c_~x_2~0 .cse17 .cse11)) (.cse14 (* .cse16 4294967296))) (and (<= (+ .cse14 c_~x_1~0) .cse15) (< .cse15 (+ .cse14 c_~x_1~0 1))))) (= (mod c_~x_2~0 2) 0) (< 1 .cse2) (or .cse12 .cse1 .cse13) (= 2 c_thread2Thread1of1ForFork1_~i~1) (not (< 1 (mod .cse5 4294967296))) (let ((.cse18 (mod c_~b~0 4294967296))) (or (and (< (+ (div (+ .cse6 c_~x_2~0 (- 3) .cse17) 4294967296) (div (+ c_~x_1~0 2) 4294967296)) .cse16) (< (+ .cse16 (div (+ (- c_~x_2~0) (* (- 2) c_~b~0) c_~x_1~0 (- 4294967295)) 4294967296)) (div (+ c_~x_1~0 (- 4294967294)) 4294967296))) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296) .cse18) (not (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse18)))))))) is different from false [2023-05-20 02:08:05,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:08:08,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:08:09,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:08:58,249 WARN L233 SmtUtils]: Spent 35.20s on a formula simplification. DAG size of input: 109 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:09:08,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:16,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:18,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:21,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:23,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:25,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:27,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:29,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:31,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:33,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:09:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:09:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:09:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 02:09:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 02:09:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-05-20 02:09:38,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-20 02:09:38,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-05-20 02:09:39,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:09:39,080 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 02:09:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 02:09:39,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1039290715, now seen corresponding path program 3 times [2023-05-20 02:09:39,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 02:09:39,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318804036] [2023-05-20 02:09:39,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 02:09:39,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 02:09:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 02:09:40,391 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:09:40,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 02:09:40,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318804036] [2023-05-20 02:09:40,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318804036] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 02:09:40,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855438017] [2023-05-20 02:09:40,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 02:09:40,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:09:40,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 02:09:40,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 02:09:40,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 02:09:40,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-05-20 02:09:40,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 02:09:40,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 49 conjunts are in the unsatisfiable core [2023-05-20 02:09:40,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 02:09:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:09:42,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 02:10:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 02:10:46,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855438017] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 02:10:46,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 02:10:46,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 28] total 65 [2023-05-20 02:10:46,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709312107] [2023-05-20 02:10:46,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 02:10:46,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-05-20 02:10:46,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 02:10:46,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-05-20 02:10:46,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=3800, Unknown=25, NotChecked=0, Total=4160 [2023-05-20 02:10:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:10:46,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 02:10:46,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.8153846153846156) internal successors, (183), 65 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-05-20 02:10:46,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 02:11:00,833 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 100 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:11:35,616 WARN L233 SmtUtils]: Spent 21.52s on a formula simplification. DAG size of input: 102 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:12:46,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:12:52,845 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 147 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:12:58,524 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 149 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:13:07,484 WARN L233 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 151 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:13:28,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:13:29,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:14:43,580 WARN L233 SmtUtils]: Spent 22.90s on a formula simplification. DAG size of input: 149 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:14:46,225 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_~x_1~0 4294967296)) (.cse16 (* c_~b~0 4))) (let ((.cse17 (* 4294967296 (div (+ .cse16 c_~x_2~0) 4294967296))) (.cse11 (mod c_~a~0 4294967296)) (.cse5 (* 4294967296 .cse23))) (let ((.cse13 (+ c_~x_2~0 .cse5)) (.cse21 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse1 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse11)) (.cse15 (+ c_~x_1~0 .cse17))) (let ((.cse4 (* 2 c_~b~0)) (.cse7 (let ((.cse27 (+ .cse16 c_~x_2~0 .cse5))) (and (<= .cse15 .cse27) (< .cse27 (+ c_~x_1~0 .cse17 1))))) (.cse14 (mod c_~b~0 4294967296)) (.cse6 (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse11)) (.cse8 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296) .cse11)) (.cse0 (not (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse11))) (.cse18 (let ((.cse26 (* 3 c_~b~0))) (let ((.cse25 (+ c_~x_2~0 .cse5 .cse26)) (.cse24 (* 4294967296 (div (+ c_~x_2~0 .cse26) 4294967296)))) (and (<= (+ c_~x_1~0 .cse24) .cse25) (< .cse25 (+ c_~x_1~0 .cse24 1)))))) (.cse9 (not .cse1)) (.cse10 (< .cse13 (+ c_~x_1~0 .cse21 1))) (.cse12 (+ c_~x_1~0 .cse21)) (.cse22 (div c_thread2Thread1of1ForFork1_~i~1 4294967296))) (and (or .cse0 .cse1 (let ((.cse3 (+ c_~x_2~0 .cse4 .cse5)) (.cse2 (* (div (+ c_~x_2~0 .cse4) 4294967296) 4294967296))) (and (<= (+ .cse2 c_~x_1~0) .cse3) (< .cse3 (+ .cse2 c_~x_1~0 1)))) (not .cse6)) (or .cse7 .cse8 .cse0 .cse9) (= c_~x_2~0 .cse4) (<= c_~x_1~0 c_~a~0) .cse10 (or .cse7 (< 4 .cse11) (<= .cse11 3)) (<= .cse12 .cse13) (not (< 1 .cse14)) (or (and (< .cse15 (+ .cse16 c_~x_2~0 (* (div (+ (- 4294967292) c_~x_1~0) 4294967296) 4294967296) 4294967293)) (< (+ .cse16 c_~x_2~0 (* (div (+ c_~x_1~0 4) 4294967296) 4294967296)) (+ 5 c_~x_1~0 .cse17))) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296) .cse14)) (or (< (mod (+ 4 |c_thread2Thread1of1ForFork1_#t~post2|) 4294967296) .cse11) (not (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post2| 1) 4294967296) .cse11)) .cse18 (not (< (mod (+ 3 |c_thread2Thread1of1ForFork1_#t~post2|) 4294967296) .cse11))) (<= (+ (* 17179869184 (div c_~b~0 4294967296)) c_~a~0) (+ (* (div (+ (- 1) c_~b~0) 1073741824) 4294967296) c_~x_1~0)) (< 1 .cse11) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or .cse0 (let ((.cse20 (+ c_~x_2~0 c_~b~0 .cse5)) (.cse19 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse19 c_~x_1~0) .cse20) (< .cse20 (+ .cse19 c_~x_1~0 1)))) .cse6) (or .cse8 .cse0 .cse18 .cse9) (= 2 c_thread2Thread1of1ForFork1_~i~1) (or (and .cse10 (<= (+ c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 .cse21 1) (+ c_~x_2~0 (* (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 3)) 4294967296) 4294967296) c_~a~0)) (<= (div c_~a~0 4294967296) (+ .cse22 .cse23))) (= .cse12 .cse13)) (<= .cse22 0)))))) is different from false [2023-05-20 02:14:48,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:14:55,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:16:21,471 WARN L233 SmtUtils]: Spent 17.38s on a formula simplification. DAG size of input: 135 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:16:24,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:16:26,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:16:28,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 02:18:07,623 WARN L233 SmtUtils]: Spent 39.60s on a formula simplification. DAG size of input: 137 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 02:18:10,300 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (div c_~x_1~0 4294967296))) (let ((.cse11 (* c_~b~0 4)) (.cse5 (* 4294967296 .cse23))) (let ((.cse14 (+ c_~x_2~0 .cse5)) (.cse21 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse12 (mod c_~a~0 4294967296)) (.cse10 (* 4294967296 (div (+ .cse11 c_~x_2~0) 4294967296)))) (let ((.cse8 (+ c_~x_1~0 .cse10)) (.cse15 (mod c_~b~0 4294967296)) (.cse6 (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse12)) (.cse0 (not (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse12))) (.cse1 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse12)) (.cse7 (< .cse14 (+ c_~x_1~0 .cse21 1))) (.cse13 (+ c_~x_1~0 .cse21)) (.cse20 (* 3 c_~b~0)) (.cse22 (div c_thread2Thread1of1ForFork1_~i~1 4294967296))) (and (or .cse0 .cse1 (let ((.cse4 (* 2 c_~b~0))) (let ((.cse3 (+ c_~x_2~0 .cse4 .cse5)) (.cse2 (* (div (+ c_~x_2~0 .cse4) 4294967296) 4294967296))) (and (<= (+ .cse2 c_~x_1~0) .cse3) (< .cse3 (+ .cse2 c_~x_1~0 1))))) (not .cse6)) (<= c_~x_1~0 c_~a~0) (= c_thread2Thread1of1ForFork1_~i~1 3) .cse7 (or (let ((.cse9 (+ .cse11 c_~x_2~0 .cse5))) (and (<= .cse8 .cse9) (< .cse9 (+ c_~x_1~0 .cse10 1)))) (< 4 .cse12) (<= .cse12 3)) (<= .cse13 .cse14) (not (< 1 .cse15)) (or (and (< .cse8 (+ .cse11 c_~x_2~0 (* (div (+ (- 4294967292) c_~x_1~0) 4294967296) 4294967296) 4294967293)) (< (+ .cse11 c_~x_2~0 (* (div (+ c_~x_1~0 4) 4294967296) 4294967296)) (+ 5 c_~x_1~0 .cse10))) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296) .cse15)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= (+ (* 17179869184 (div c_~b~0 4294967296)) c_~a~0) (+ (* (div (+ (- 1) c_~b~0) 1073741824) 4294967296) c_~x_1~0)) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (or .cse0 (let ((.cse17 (+ c_~x_2~0 c_~b~0 .cse5)) (.cse16 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse16 c_~x_1~0) .cse17) (< .cse17 (+ .cse16 c_~x_1~0 1)))) .cse6) (< 2 .cse12) (or (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 4) 4294967296) .cse12) .cse0 (let ((.cse19 (+ c_~x_2~0 .cse5 .cse20)) (.cse18 (* 4294967296 (div (+ c_~x_2~0 .cse20) 4294967296)))) (and (<= (+ c_~x_1~0 .cse18) .cse19) (< .cse19 (+ c_~x_1~0 .cse18 1)))) (not .cse1)) (or (and .cse7 (<= (+ c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 .cse21 1) (+ c_~x_2~0 (* (div (+ c_thread2Thread1of1ForFork1_~i~1 (- 3)) 4294967296) 4294967296) c_~a~0)) (<= (div c_~a~0 4294967296) (+ .cse22 .cse23))) (= .cse13 .cse14)) (= c_~x_2~0 .cse20) (<= .cse22 0)))))) is different from false [2023-05-20 02:18:18,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-05-20 02:18:33,094 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 02:18:33,094 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 02:18:33,095 WARN L249 SmtUtils]: Removed 11 from assertion stack [2023-05-20 02:18:33,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-05-20 02:18:33,117 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 02:18:33,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 02:18:33,296 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 4850ms.. [2023-05-20 02:18:33,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 02:18:33,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 02:18:33,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 02:18:33,306 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-05-20 02:18:33,310 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 02:18:33,310 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 02:18:33,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 02:18:33 BasicIcfg [2023-05-20 02:18:33,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 02:18:33,313 INFO L158 Benchmark]: Toolchain (without parser) took 882594.11ms. Allocated memory was 188.7MB in the beginning and 330.3MB in the end (delta: 141.6MB). Free memory was 165.8MB in the beginning and 152.7MB in the end (delta: 13.1MB). Peak memory consumption was 155.1MB. Max. memory is 8.0GB. [2023-05-20 02:18:33,314 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 02:18:33,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.30ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 165.8MB in the beginning and 201.4MB in the end (delta: -35.6MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-05-20 02:18:33,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.46ms. Allocated memory is still 226.5MB. Free memory was 200.9MB in the beginning and 199.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-20 02:18:33,315 INFO L158 Benchmark]: Boogie Preprocessor took 22.63ms. Allocated memory is still 226.5MB. Free memory was 199.8MB in the beginning and 198.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-20 02:18:33,316 INFO L158 Benchmark]: RCFGBuilder took 416.11ms. Allocated memory is still 226.5MB. Free memory was 198.3MB in the beginning and 185.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-05-20 02:18:33,316 INFO L158 Benchmark]: TraceAbstraction took 881928.05ms. Allocated memory was 226.5MB in the beginning and 330.3MB in the end (delta: 103.8MB). Free memory was 184.7MB in the beginning and 152.7MB in the end (delta: 32.0MB). Peak memory consumption was 137.3MB. Max. memory is 8.0GB. [2023-05-20 02:18:33,318 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.09ms. Allocated memory is still 188.7MB. Free memory is still 148.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.30ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 165.8MB in the beginning and 201.4MB in the end (delta: -35.6MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.46ms. Allocated memory is still 226.5MB. Free memory was 200.9MB in the beginning and 199.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.63ms. Allocated memory is still 226.5MB. Free memory was 199.8MB in the beginning and 198.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 416.11ms. Allocated memory is still 226.5MB. Free memory was 198.3MB in the beginning and 185.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 881928.05ms. Allocated memory was 226.5MB in the beginning and 330.3MB in the end (delta: 103.8MB). Free memory was 184.7MB in the beginning and 152.7MB in the end (delta: 32.0MB). Peak memory consumption was 137.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3941, independent: 2455, independent conditional: 1670, independent unconditional: 785, dependent: 1486, dependent conditional: 1480, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 1670, independent unconditional: 785, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 1670, independent unconditional: 785, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 690, independent: 684, independent conditional: 0, independent unconditional: 684, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 690, independent: 683, independent conditional: 0, independent unconditional: 683, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2461, independent: 1771, independent conditional: 0, independent unconditional: 1771, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 690, unknown conditional: 0, unknown unconditional: 690] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 684, Positive conditional cache size: 0, Positive unconditional cache size: 684, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1480 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 233, Number of trivial persistent sets: 160, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791, independent: 785, independent conditional: 0, independent unconditional: 785, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3941, independent: 2455, independent conditional: 1670, independent unconditional: 785, dependent: 1486, dependent conditional: 1480, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 1670, independent unconditional: 785, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 1670, independent unconditional: 785, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2461, independent: 2455, independent conditional: 0, independent unconditional: 2455, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 690, independent: 684, independent conditional: 0, independent unconditional: 684, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 690, independent: 683, independent conditional: 0, independent unconditional: 683, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2461, independent: 1771, independent conditional: 0, independent unconditional: 1771, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 690, unknown conditional: 0, unknown unconditional: 690] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 684, Positive conditional cache size: 0, Positive unconditional cache size: 684, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1480 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 4850ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 4850ms.. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 109 for 4850ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 96 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 881.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 762.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 116.6s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1098 ConstructedInterpolants, 12 QuantifiedInterpolants, 21975 SizeOfPredicates, 57 NumberOfNonLiveVariables, 771 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 13/141 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown