/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/parallel-misc-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 06:10:30,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 06:10:30,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 06:10:30,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 06:10:30,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 06:10:30,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 06:10:30,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 06:10:30,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 06:10:30,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 06:10:30,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 06:10:30,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 06:10:30,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 06:10:30,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 06:10:30,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 06:10:30,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 06:10:30,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 06:10:30,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 06:10:30,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 06:10:30,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 06:10:30,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 06:10:30,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 06:10:30,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 06:10:30,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 06:10:30,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 06:10:30,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 06:10:30,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 06:10:30,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 06:10:30,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 06:10:30,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 06:10:30,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 06:10:30,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 06:10:30,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 06:10:30,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 06:10:30,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 06:10:30,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 06:10:30,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 06:10:30,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 06:10:30,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 06:10:30,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 06:10:30,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 06:10:30,609 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 06:10:30,610 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 06:10:30,642 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 06:10:30,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 06:10:30,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 06:10:30,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 06:10:30,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 06:10:30,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 06:10:30,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 06:10:30,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 06:10:30,645 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 06:10:30,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 06:10:30,646 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 06:10:30,647 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 06:10:30,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 06:10:30,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 06:10:30,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 06:10:30,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 06:10:30,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 06:10:30,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 06:10:30,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 06:10:30,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 06:10:30,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 06:10:30,651 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 06:10:30,651 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-04 06:10:30,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 06:10:30,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 06:10:30,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 06:10:30,947 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 06:10:30,948 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 06:10:30,949 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2023-05-04 06:10:31,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1458bb2b8/40cf03d1fa454eb5a5f3ed3911b68cf2/FLAGeb827d602 [2023-05-04 06:10:31,476 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 06:10:31,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2023-05-04 06:10:31,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1458bb2b8/40cf03d1fa454eb5a5f3ed3911b68cf2/FLAGeb827d602 [2023-05-04 06:10:31,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1458bb2b8/40cf03d1fa454eb5a5f3ed3911b68cf2 [2023-05-04 06:10:31,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 06:10:31,859 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 06:10:31,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 06:10:31,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 06:10:31,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 06:10:31,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:10:31" (1/1) ... [2023-05-04 06:10:31,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cd9c8e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:31, skipping insertion in model container [2023-05-04 06:10:31,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 06:10:31" (1/1) ... [2023-05-04 06:10:31,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 06:10:31,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 06:10:32,083 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/parallel-misc-2.wvr.c[2554,2567] [2023-05-04 06:10:32,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 06:10:32,093 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 06:10:32,112 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/parallel-misc-2.wvr.c[2554,2567] [2023-05-04 06:10:32,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 06:10:32,124 INFO L208 MainTranslator]: Completed translation [2023-05-04 06:10:32,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32 WrapperNode [2023-05-04 06:10:32,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 06:10:32,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 06:10:32,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 06:10:32,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 06:10:32,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,158 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2023-05-04 06:10:32,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 06:10:32,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 06:10:32,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 06:10:32,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 06:10:32,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,191 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 06:10:32,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 06:10:32,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 06:10:32,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 06:10:32,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (1/1) ... [2023-05-04 06:10:32,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 06:10:32,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:10:32,242 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-04 06:10:32,266 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-04 06:10:32,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 06:10:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 06:10:32,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 06:10:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 06:10:32,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 06:10:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 06:10:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 06:10:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 06:10:32,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 06:10:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 06:10:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 06:10:32,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 06:10:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 06:10:32,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 06:10:32,296 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 06:10:32,431 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 06:10:32,433 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 06:10:32,734 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 06:10:32,762 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 06:10:32,763 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 06:10:32,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:10:32 BoogieIcfgContainer [2023-05-04 06:10:32,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 06:10:32,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 06:10:32,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 06:10:32,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 06:10:32,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 06:10:31" (1/3) ... [2023-05-04 06:10:32,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7909c322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:10:32, skipping insertion in model container [2023-05-04 06:10:32,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 06:10:32" (2/3) ... [2023-05-04 06:10:32,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7909c322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 06:10:32, skipping insertion in model container [2023-05-04 06:10:32,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 06:10:32" (3/3) ... [2023-05-04 06:10:32,776 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2023-05-04 06:10:32,785 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 06:10:32,794 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 06:10:32,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 06:10:32,795 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 06:10:32,872 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 06:10:32,929 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 06:10:32,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 06:10:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:10:32,937 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-04 06:10:32,960 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-04 06:10:32,982 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 06:10:33,002 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 06:10:33,008 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;@63cacffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 06:10:33,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 06:10:33,139 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-04 06:10:33,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1067701860, now seen corresponding path program 1 times [2023-05-04 06:10:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:33,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46269344] [2023-05-04 06:10:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:33,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 06:10:33,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:33,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46269344] [2023-05-04 06:10:33,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46269344] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:10:33,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:10:33,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 06:10:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522861412] [2023-05-04 06:10:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:10:33,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 06:10:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 06:10:33,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 06:10:33,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:33,443 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:33,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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-04 06:10:33,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 06:10:33,503 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-04 06:10:33,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash -883030954, now seen corresponding path program 1 times [2023-05-04 06:10:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:33,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769389558] [2023-05-04 06:10:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:10:34,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:34,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769389558] [2023-05-04 06:10:34,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769389558] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:10:34,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:10:34,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 06:10:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649551795] [2023-05-04 06:10:34,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:10:34,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 06:10:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:34,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 06:10:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-05-04 06:10:34,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:34,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-04 06:10:34,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:10:34,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 06:10:34,281 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-04 06:10:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2011438240, now seen corresponding path program 1 times [2023-05-04 06:10:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:34,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235535472] [2023-05-04 06:10:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:34,588 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-04 06:10:34,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:34,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235535472] [2023-05-04 06:10:34,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235535472] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:10:34,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:10:34,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 06:10:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976239835] [2023-05-04 06:10:34,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:10:34,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 06:10:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 06:10:34,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-05-04 06:10:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,591 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:34,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-04 06:10:34,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 06:10:34,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 06:10:34,775 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-04 06:10:34,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -67095585, now seen corresponding path program 1 times [2023-05-04 06:10:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012426477] [2023-05-04 06:10:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:10:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:34,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012426477] [2023-05-04 06:10:34,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012426477] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:10:34,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:10:34,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 06:10:34,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82987307] [2023-05-04 06:10:34,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:10:34,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 06:10:34,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:34,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 06:10:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-05-04 06:10:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:34,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-04 06:10:34,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:34,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:34,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:34,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:35,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:35,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 06:10:35,161 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-04 06:10:35,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:35,162 INFO L85 PathProgramCache]: Analyzing trace with hash -795979897, now seen corresponding path program 1 times [2023-05-04 06:10:35,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:35,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041661602] [2023-05-04 06:10:35,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:35,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:10:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:35,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041661602] [2023-05-04 06:10:35,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041661602] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:10:35,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787475778] [2023-05-04 06:10:35,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:35,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:10:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:10:35,765 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-04 06:10:35,785 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-04 06:10:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:35,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2023-05-04 06:10:35,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:10:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:10:36,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:10:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:10:36,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787475778] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:10:36,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:10:36,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-05-04 06:10:36,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681146344] [2023-05-04 06:10:36,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:10:36,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-05-04 06:10:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-05-04 06:10:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-05-04 06:10:36,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:36,533 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:36,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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-04 06:10:36,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:36,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:36,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:36,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:36,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:37,265 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-04 06:10:37,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:10:37,441 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-04 06:10:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:37,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1923404051, now seen corresponding path program 1 times [2023-05-04 06:10:37,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:37,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556415898] [2023-05-04 06:10:37,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 06:10:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:37,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556415898] [2023-05-04 06:10:37,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556415898] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:10:37,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:10:37,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 06:10:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991242644] [2023-05-04 06:10:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:10:37,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 06:10:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:37,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 06:10:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 06:10:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,640 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:37,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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-04 06:10:37,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:37,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:37,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:37,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 06:10:37,696 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-04 06:10:37,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1046026216, now seen corresponding path program 2 times [2023-05-04 06:10:37,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:37,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270553726] [2023-05-04 06:10:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-04 06:10:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:37,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270553726] [2023-05-04 06:10:37,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270553726] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 06:10:37,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 06:10:37,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 06:10:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339045558] [2023-05-04 06:10:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 06:10:37,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 06:10:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 06:10:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 06:10:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,875 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:37,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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-04 06:10:37,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:37,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:37,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:37,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:37,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 06:10:37,914 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 06:10:37,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 571945928, now seen corresponding path program 1 times [2023-05-04 06:10:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:37,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419687572] [2023-05-04 06:10:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:10:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419687572] [2023-05-04 06:10:38,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419687572] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:10:38,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125569550] [2023-05-04 06:10:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:38,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:10:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:10:38,777 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-04 06:10:38,795 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-04 06:10:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:38,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-04 06:10:38,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:10:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 06:10:39,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:10:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 06:10:39,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125569550] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:10:39,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:10:39,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 26 [2023-05-04 06:10:39,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027033358] [2023-05-04 06:10:39,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:10:39,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-05-04 06:10:39,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:10:39,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-05-04 06:10:39,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2023-05-04 06:10:39,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:39,455 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:10:39,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.923076923076923) internal successors, (180), 26 states have internal predecessors, (180), 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-04 06:10:39,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:39,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:39,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:39,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:39,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:39,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:39,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:39,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:10:42,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-04 06:10:42,206 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-04 06:10:42,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:10:42,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 06:10:42,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:10:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash -864771372, now seen corresponding path program 2 times [2023-05-04 06:10:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:10:42,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932973769] [2023-05-04 06:10:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:10:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:10:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:10:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 06:10:43,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:10:43,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932973769] [2023-05-04 06:10:43,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932973769] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:10:43,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721135703] [2023-05-04 06:10:43,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 06:10:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:10:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:10:43,079 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-04 06:10:43,135 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-04 06:10:43,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 06:10:43,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 06:10:43,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 37 conjunts are in the unsatisfiable core [2023-05-04 06:10:43,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:10:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 26 proven. 33 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 06:10:44,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:11:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:11:01,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721135703] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:11:01,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:11:01,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 22] total 49 [2023-05-04 06:11:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540533642] [2023-05-04 06:11:01,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:11:01,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-04 06:11:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:11:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-04 06:11:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2154, Unknown=0, NotChecked=0, Total=2352 [2023-05-04 06:11:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:11:01,917 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:11:01,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 4.938775510204081) internal successors, (242), 49 states have internal predecessors, (242), 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-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-04 06:11:01,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:12:07,038 WARN L233 SmtUtils]: Spent 44.12s on a formula simplification that was a NOOP. DAG size: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:12:09,641 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-04 06:12:11,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:12:13,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:12:15,519 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-04 06:12:19,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:12:21,826 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-04 06:12:25,118 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-04 06:12:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:12:29,902 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-04 06:12:32,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-04 06:12:34,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:12:44,749 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ c_~i2~0 1) 4294967296))) (let ((.cse12 (mod (+ 2 c_~i2~0) 4294967296)) (.cse11 (div (+ (- .cse1) 4294967293) 4294967296))) (let ((.cse0 (* (mod c_~N~0 2147483648) 2)) (.cse9 (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4294967295) 4294967296)) (.cse3 (* .cse11 8589934592)) (.cse5 (+ 4294967297 .cse12 (* (div (+ (- 4294967294) .cse12) 4294967296) 4294967296))) (.cse6 (- .cse12)) (.cse7 (* .cse11 4294967296)) (.cse4 (* (div (mod (+ 3 c_~i2~0) 4294967296) 2) 2)) (.cse8 (+ 1 .cse1))) (and (<= (+ c_~i1~0 1) (+ (* (div (+ c_~i1~0 (- c_~i2~0) 1) 4294967296) 4294967296) c_~i2~0)) (<= c_~i1~0 (+ |c_thread2Thread1of1ForFork1_#t~post4| (* (div (+ c_~i1~0 (- |c_thread2Thread1of1ForFork1_#t~post4|)) 4294967296) 4294967296))) (or (< (mod (+ c_~i1~0 2) 4294967296) .cse0) (not (< (mod c_~i2~0 4294967296) .cse0)) (< .cse1 .cse0)) (let ((.cse2 (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4) 4294967296))) (or (< (+ (* (div .cse2 4294967296) 4294967296) .cse3 .cse4) .cse5) (< (+ (* (div (+ (- 1) (* 2 (div .cse2 2)) .cse6) 4294967296) 4294967296) .cse7 .cse4) .cse8))) (< (mod |c_thread2Thread1of1ForFork1_#t~post4| 4294967296) .cse0) (= .cse9 0) (< (mod c_~i1~0 4294967296) .cse0) (= .cse9 (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4294967295) 4294967296)) (let ((.cse10 (mod (+ c_~i1~0 4) 4294967296))) (or (< (+ .cse3 (* (div .cse10 4294967296) 4294967296) .cse4) .cse5) (< (+ (* (div (+ (- 1) (* (div .cse10 2) 2) .cse6) 4294967296) 4294967296) .cse7 .cse4) .cse8))))))) is different from false [2023-05-04 06:13:29,214 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-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:13:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-05-04 06:13:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-05-04 06:13:30,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 06:13:30,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:13:30,468 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 06:13:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:13:30,469 INFO L85 PathProgramCache]: Analyzing trace with hash 473174605, now seen corresponding path program 3 times [2023-05-04 06:13:30,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:13:30,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764811569] [2023-05-04 06:13:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:13:30,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:13:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:13:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:13:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:13:31,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764811569] [2023-05-04 06:13:31,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764811569] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:13:31,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689238392] [2023-05-04 06:13:31,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 06:13:31,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:13:31,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:13:31,694 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-04 06:13:31,694 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-04 06:13:32,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-05-04 06:13:32,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 06:13:32,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 29 conjunts are in the unsatisfiable core [2023-05-04 06:13:32,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:13:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 06:13:33,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:13:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 4 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 06:13:47,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689238392] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:13:47,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:13:47,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 54 [2023-05-04 06:13:47,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225553506] [2023-05-04 06:13:47,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:13:47,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-05-04 06:13:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:13:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-05-04 06:13:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2604, Unknown=0, NotChecked=0, Total=2862 [2023-05-04 06:13:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:13:47,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:13:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.555555555555555) internal successors, (300), 54 states have internal predecessors, (300), 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-04 06:13:47,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:13:47,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:13:47,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2023-05-04 06:13:47,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:14:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-05-04 06:14:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 06:14:30,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 06:14:30,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-05-04 06:14:30,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 06:14:30,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:14:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash 936999151, now seen corresponding path program 4 times [2023-05-04 06:14:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:14:30,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640714312] [2023-05-04 06:14:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:14:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:14:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:14:32,528 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 187 proven. 181 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2023-05-04 06:14:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:14:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640714312] [2023-05-04 06:14:32,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640714312] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:14:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666199956] [2023-05-04 06:14:32,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-04 06:14:32,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:14:32,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:14:32,531 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-04 06:14:32,532 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-04 06:14:33,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-04 06:14:33,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 06:14:33,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjunts are in the unsatisfiable core [2023-05-04 06:14:33,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:14:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 170 proven. 93 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-05-04 06:14:34,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:14:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 170 proven. 93 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2023-05-04 06:14:38,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666199956] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:14:38,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:14:38,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17, 17] total 54 [2023-05-04 06:14:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262398401] [2023-05-04 06:14:38,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:14:38,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-05-04 06:14:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:14:38,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-05-04 06:14:38,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2692, Unknown=0, NotChecked=0, Total=2862 [2023-05-04 06:14:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:14:38,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:14:38,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.666666666666667) internal successors, (306), 54 states have internal predecessors, (306), 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-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-05-04 06:14:38,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-05-04 06:14:38,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-05-04 06:14:38,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:14:54,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:15:31,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:15:44,360 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-04 06:15:46,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:15:47,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:15:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:15:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:15:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:15:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-05-04 06:15:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-04 06:15:51,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 06:15:51,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:15:51,320 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 06:15:51,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 06:15:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1284503573, now seen corresponding path program 5 times [2023-05-04 06:15:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 06:15:51,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077672347] [2023-05-04 06:15:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 06:15:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 06:15:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 06:15:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 188 proven. 273 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 06:15:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 06:15:54,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077672347] [2023-05-04 06:15:54,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077672347] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 06:15:54,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219250528] [2023-05-04 06:15:54,033 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-04 06:15:54,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 06:15:54,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 06:15:54,035 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 06:15:54,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 06:16:02,064 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2023-05-04 06:16:02,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 06:16:02,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 71 conjunts are in the unsatisfiable core [2023-05-04 06:16:02,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 06:16:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 66 proven. 402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:16:05,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 06:16:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 66 proven. 402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 06:16:34,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219250528] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 06:16:34,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 06:16:34,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38, 38] total 112 [2023-05-04 06:16:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053154767] [2023-05-04 06:16:34,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 06:16:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2023-05-04 06:16:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 06:16:34,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2023-05-04 06:16:34,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=11710, Unknown=35, NotChecked=0, Total=12432 [2023-05-04 06:16:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:16:34,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 06:16:34,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 4.026785714285714) internal successors, (451), 112 states have internal predecessors, (451), 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-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-05-04 06:16:34,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 06:16:55,217 WARN L233 SmtUtils]: Spent 10.64s on a formula simplification. DAG size of input: 93 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:16:56,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:16:57,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:16:59,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:17:02,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 06:17:04,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-04 06:17:46,779 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_~i1~0 4294967296)))) (let ((.cse1 (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse0)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4294967295) 4294967296))) (and (<= (+ c_~i2~0 .cse0) (+ c_~i1~0 (* (div (+ (- 2) c_~i2~0) 4294967296) 4294967296) 1)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ c_~i2~0 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 5) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 2 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (<= .cse1 (+ c_~i1~0 (* (div (+ |c_thread2Thread1of1ForFork1_#t~post4| (- 1)) 4294967296) 4294967296))) (<= .cse1 (+ (* (div |c_thread2Thread1of1ForFork1_#t~post4| 4294967296) 4294967296) c_~i1~0)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (< (mod (+ 5 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (- 1) c_~i2~0) 4294967296) 4294967296) (* 4294967296 (div (+ (- c_~i2~0) |c_thread1Thread1of1ForFork0_#t~post3| 1) 4294967296)) 4294967293)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod c_~i2~0 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ (* 4294967296 (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 6) 4294967296)) 4294967289)) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (= .cse2 0) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 2) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (< (mod (+ c_~i2~0 4) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (= .cse2 (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4294967295) 4294967296)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 6) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 3 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (<= c_~i1~0 (+ .cse0 4294967293)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 3) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ (* 4294967296 (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 6) 4294967296)) 4294967289)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648)))))) is different from false [2023-05-04 06:19:11,292 WARN L233 SmtUtils]: Spent 15.65s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:19:43,255 WARN L233 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 61 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:19:47,298 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4294967296 (div c_~i1~0 4294967296)))) (let ((.cse0 (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse1)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4294967293) 4294967296))) (and (<= .cse0 (+ c_~i1~0 1 (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_#t~post4| (- 3)) 4294967296)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ c_~i2~0 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 5) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 2 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (<= .cse0 (+ c_~i1~0 (* (div (+ |c_thread2Thread1of1ForFork1_#t~post4| (- 2)) 4294967296) 4294967296) 1)) (<= (+ c_~i2~0 .cse1) (+ c_~i1~0 2 (* 4294967296 (div (+ (- 4) c_~i2~0) 4294967296)))) (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (- c_~i2~0) |c_thread1Thread1of1ForFork0_#t~post3| 2) 4294967296) 4294967296) 4294967293 (* (div (+ (- 3) c_~i2~0) 4294967296) 4294967296))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (< (mod (+ 5 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod c_~i2~0 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ (* 4294967296 (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 6) 4294967296)) 4294967289)) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (= .cse2 0) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 2) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (< (mod (+ c_~i2~0 4) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 6) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 3 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (<= c_~i1~0 (+ .cse1 4294967293)) (= .cse2 (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4294967294) 4294967296)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 3) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ (* 4294967296 (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 6) 4294967296)) 4294967289)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648)))))) is different from false [2023-05-04 06:20:05,047 WARN L233 SmtUtils]: Spent 7.72s on a formula simplification. DAG size of input: 121 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:20:52,932 WARN L233 SmtUtils]: Spent 15.46s on a formula simplification that was a NOOP. DAG size: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:21:17,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4294967296 (div c_~i1~0 4294967296)))) (let ((.cse0 (mod (+ 4294967291 c_~i2~0) 4294967296)) (.cse1 (+ c_~i2~0 .cse2))) (and (= .cse0 (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4294967293) 4294967296)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (< (mod (+ 6 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (<= .cse1 (+ c_~i1~0 (* (div (+ (- 2) c_~i2~0) 4294967296) 4294967296) 1)) (<= .cse1 (+ c_~i1~0 2 (* 4294967296 (div (+ (- 4) c_~i2~0) 4294967296)))) (= .cse0 0) (<= .cse1 (+ c_~i1~0 3 (* (div (+ (- 5) c_~i2~0) 4294967296) 4294967296))) (<= c_~i1~0 (+ .cse2 4294967293))))) is different from false [2023-05-04 06:21:20,885 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4294967296 (div c_~i1~0 4294967296)))) (let ((.cse2 (* (div (+ (- 5) c_~i2~0) 4294967296) 4294967296)) (.cse1 (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4294967291) 4294967296)) (.cse0 (+ |c_thread2Thread1of1ForFork1_#t~post4| .cse3))) (and (<= .cse0 (+ c_~i1~0 (* (div (+ |c_thread2Thread1of1ForFork1_#t~post4| (- 4)) 4294967296) 4294967296) 2)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ c_~i2~0 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 5) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 2 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (< (mod (+ 5 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (= .cse1 (mod (+ |c_thread1Thread1of1ForFork0_#t~post3| 4294967293) 4294967296)) (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (- c_~i2~0) |c_thread1Thread1of1ForFork0_#t~post3| 3) 4294967296) 4294967296) .cse2 4294967293)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod c_~i2~0 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ (* 4294967296 (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 6) 4294967296)) 4294967289)) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 4) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (<= (+ c_~i2~0 .cse3) (+ c_~i1~0 3 .cse2)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 2) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (= .cse1 0) (<= .cse0 (+ c_~i1~0 2 (* (div (+ |c_thread2Thread1of1ForFork1_#t~post4| (- 5)) 4294967296) 4294967296))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (< (mod (+ c_~i2~0 4) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 9) 4294967296) 4294967296) 4294967286)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 6) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 3 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648) (<= c_~i1~0 (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 8) 4294967296) 4294967296) 4294967287)))) (<= c_~i1~0 (+ .cse3 4294967293)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ 4294967288 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 7) 4294967296) 4294967296))) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 3) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= c_~i1~0 (+ (* 4294967296 (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) c_~i1~0 6) 4294967296)) 4294967289)) (< (mod (+ |c_thread2Thread1of1ForFork1_#t~post4| 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648)))))) is different from false [2023-05-04 06:21:34,992 WARN L233 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 125 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:21:36,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 4294967290 c_~i2~0) 4294967296))) (and (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ 4294967286 (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) |c_thread1Thread1of1ForFork0_#t~post3| 9) 4294967296) 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (< (mod (+ 5 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (= .cse0 0) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) 7 |c_thread1Thread1of1ForFork0_#t~post3|) 4294967296) 4294967296) 4294967288)) (< (mod (+ c_~i2~0 1) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (- c_~i2~0) |c_thread1Thread1of1ForFork0_#t~post3| 3) 4294967296) 4294967296) (* (div (+ (- 5) c_~i2~0) 4294967296) 4294967296) 4294967293)) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (< (mod (+ 6 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) |c_thread1Thread1of1ForFork0_#t~post3| 10) 4294967296) 4294967296) 4294967285)) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))) (= (mod (+ c_~i1~0 4294967292) 4294967296) .cse0) (forall ((aux_mod_aux_mod_~N~0_21_32 Int) (aux_div_aux_mod_~N~0_21_32 Int)) (or (< (mod (+ 3 c_~i2~0) 4294967296) (+ (* aux_mod_aux_mod_~N~0_21_32 2) (* aux_div_aux_mod_~N~0_21_32 4294967296))) (< (+ aux_mod_aux_mod_~N~0_21_32 (* aux_div_aux_mod_~N~0_21_32 2147483648)) 0) (<= |c_thread1Thread1of1ForFork0_#t~post3| (+ (* (div (+ (* (- 2) aux_mod_aux_mod_~N~0_21_32) |c_thread1Thread1of1ForFork0_#t~post3| 8) 4294967296) 4294967296) 4294967287)) (>= aux_mod_aux_mod_~N~0_21_32 2147483648))))) is different from false [2023-05-04 06:22:18,988 WARN L233 SmtUtils]: Spent 28.21s on a formula simplification. DAG size of input: 98 DAG size of output: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:23:38,675 WARN L233 SmtUtils]: Spent 20.39s on a formula simplification. DAG size of input: 136 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 06:24:28,099 WARN L233 SmtUtils]: Spent 17.28s on a formula simplification. DAG size of input: 106 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 06:24:50,260 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-04 06:24:50,260 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-04 06:24:50,260 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 06:24:51,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 06:24:51,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 06:24:51,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 06:24:51,391 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-05-04 06:24:51,393 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 06:24:51,393 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 06:24:51,393 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 06:24:51,397 INFO L444 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2023-05-04 06:24:51,399 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 06:24:51,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 06:24:51,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 06:24:51 BasicIcfg [2023-05-04 06:24:51,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 06:24:51,402 INFO L158 Benchmark]: Toolchain (without parser) took 859542.46ms. Allocated memory was 178.3MB in the beginning and 370.1MB in the end (delta: 191.9MB). Free memory was 154.1MB in the beginning and 213.9MB in the end (delta: -59.9MB). Peak memory consumption was 132.6MB. Max. memory is 8.0GB. [2023-05-04 06:24:51,402 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 127.9MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 06:24:51,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.98ms. Allocated memory is still 178.3MB. Free memory was 153.9MB in the beginning and 156.2MB in the end (delta: -2.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2023-05-04 06:24:51,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.15ms. Allocated memory is still 178.3MB. Free memory was 156.2MB in the beginning and 154.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-04 06:24:51,402 INFO L158 Benchmark]: Boogie Preprocessor took 47.75ms. Allocated memory is still 178.3MB. Free memory was 154.8MB in the beginning and 153.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 06:24:51,407 INFO L158 Benchmark]: RCFGBuilder took 558.03ms. Allocated memory is still 178.3MB. Free memory was 153.4MB in the beginning and 139.1MB in the end (delta: 14.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-05-04 06:24:51,407 INFO L158 Benchmark]: TraceAbstraction took 858632.03ms. Allocated memory was 178.3MB in the beginning and 370.1MB in the end (delta: 191.9MB). Free memory was 138.0MB in the beginning and 213.9MB in the end (delta: -75.9MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. [2023-05-04 06:24:51,425 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.16ms. Allocated memory is still 127.9MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.98ms. Allocated memory is still 178.3MB. Free memory was 153.9MB in the beginning and 156.2MB in the end (delta: -2.4MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.15ms. Allocated memory is still 178.3MB. Free memory was 156.2MB in the beginning and 154.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.75ms. Allocated memory is still 178.3MB. Free memory was 154.8MB in the beginning and 153.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 558.03ms. Allocated memory is still 178.3MB. Free memory was 153.4MB in the beginning and 139.1MB in the end (delta: 14.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 858632.03ms. Allocated memory was 178.3MB in the beginning and 370.1MB in the end (delta: 191.9MB). Free memory was 138.0MB in the beginning and 213.9MB in the end (delta: -75.9MB). Peak memory consumption was 117.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4492, independent: 3328, independent conditional: 1931, independent unconditional: 1397, dependent: 1164, dependent conditional: 1158, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3334, independent: 3328, independent conditional: 1931, independent unconditional: 1397, 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: 3334, independent: 3328, independent conditional: 1931, independent unconditional: 1397, 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: 3334, independent: 3328, independent conditional: 0, independent unconditional: 3328, 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: 3334, independent: 3328, independent conditional: 0, independent unconditional: 3328, 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: 3334, independent: 3328, independent conditional: 0, independent unconditional: 3328, 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: 1056, independent: 1050, independent conditional: 0, independent unconditional: 1050, 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: 1056, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3334, independent: 2278, independent conditional: 0, independent unconditional: 2278, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1056, unknown conditional: 0, unknown unconditional: 1056] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1050, Positive conditional cache size: 0, Positive unconditional cache size: 1050, 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: 1158 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 191, Number of trivial persistent sets: 119, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1403, independent: 1397, independent conditional: 0, independent unconditional: 1397, 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: 4492, independent: 3328, independent conditional: 1931, independent unconditional: 1397, dependent: 1164, dependent conditional: 1158, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3334, independent: 3328, independent conditional: 1931, independent unconditional: 1397, 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: 3334, independent: 3328, independent conditional: 1931, independent unconditional: 1397, 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: 3334, independent: 3328, independent conditional: 0, independent unconditional: 3328, 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: 3334, independent: 3328, independent conditional: 0, independent unconditional: 3328, 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: 3334, independent: 3328, independent conditional: 0, independent unconditional: 3328, 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: 1056, independent: 1050, independent conditional: 0, independent unconditional: 1050, 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: 1056, independent: 1042, independent conditional: 0, independent unconditional: 1042, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 14, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3334, independent: 2278, independent conditional: 0, independent unconditional: 2278, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1056, unknown conditional: 0, unknown unconditional: 1056] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1050, Positive conditional cache size: 0, Positive unconditional cache size: 1050, 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: 1158 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 121 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 858.4s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 765.9s, 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: 386, 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, 10.5s SatisfiabilityAnalysisTime, 80.1s InterpolantComputationTime, 2138 NumberOfCodeBlocks, 2125 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2927 ConstructedInterpolants, 88 QuantifiedInterpolants, 33422 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1562 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 1497/3475 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