/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 X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 15:30:52,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 15:30:52,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 15:30:52,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 15:30:52,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 15:30:52,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 15:30:52,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 15:30:52,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 15:30:52,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 15:30:52,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 15:30:52,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 15:30:52,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 15:30:52,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 15:30:52,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 15:30:52,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 15:30:52,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 15:30:52,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 15:30:52,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 15:30:52,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 15:30:52,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 15:30:52,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 15:30:52,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 15:30:52,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 15:30:52,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 15:30:52,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 15:30:52,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 15:30:52,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 15:30:52,717 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 15:30:52,717 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 15:30:52,718 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 15:30:52,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 15:30:52,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 15:30:52,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 15:30:52,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 15:30:52,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 15:30:52,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 15:30:52,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 15:30:52,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 15:30:52,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 15:30:52,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 15:30:52,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 15:30:52,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 15:30:52,747 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 15:30:52,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 15:30:52,747 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 15:30:52,748 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 15:30:52,748 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 15:30:52,748 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 15:30:52,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 15:30:52,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 15:30:52,749 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 15:30:52,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 15:30:52,749 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 15:30:52,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 15:30:52,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 15:30:52,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 15:30:52,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 15:30:52,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 15:30:52,752 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 15:30:52,752 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 -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-20 15:30:52,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 15:30:52,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 15:30:52,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 15:30:52,931 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 15:30:52,931 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 15:30:52,932 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-12.i [2023-05-20 15:30:52,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be11c0ff5/5e82c665d9504209b4229f14258da421/FLAG9b44ff4a1 [2023-05-20 15:30:53,404 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 15:30:53,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i [2023-05-20 15:30:53,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be11c0ff5/5e82c665d9504209b4229f14258da421/FLAG9b44ff4a1 [2023-05-20 15:30:53,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be11c0ff5/5e82c665d9504209b4229f14258da421 [2023-05-20 15:30:53,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 15:30:53,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 15:30:53,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 15:30:53,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 15:30:53,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 15:30:53,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 03:30:53" (1/1) ... [2023-05-20 15:30:53,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5741c0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:53, skipping insertion in model container [2023-05-20 15:30:53,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 03:30:53" (1/1) ... [2023-05-20 15:30:53,772 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 15:30:53,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 15:30:54,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2023-05-20 15:30:54,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 15:30:54,041 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 15:30:54,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-12.i[30243,30256] [2023-05-20 15:30:54,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 15:30:54,091 INFO L208 MainTranslator]: Completed translation [2023-05-20 15:30:54,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54 WrapperNode [2023-05-20 15:30:54,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 15:30:54,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 15:30:54,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 15:30:54,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 15:30:54,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,136 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-05-20 15:30:54,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 15:30:54,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 15:30:54,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 15:30:54,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 15:30:54,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,161 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 15:30:54,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 15:30:54,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 15:30:54,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 15:30:54,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (1/1) ... [2023-05-20 15:30:54,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 15:30:54,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:54,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 15:30:54,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 15:30:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-20 15:30:54,247 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-20 15:30:54,247 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-20 15:30:54,247 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 15:30:54,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 15:30:54,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 15:30:54,249 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 15:30:54,382 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 15:30:54,383 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 15:30:54,541 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 15:30:54,546 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 15:30:54,546 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-05-20 15:30:54,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 03:30:54 BoogieIcfgContainer [2023-05-20 15:30:54,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 15:30:54,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 15:30:54,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 15:30:54,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 15:30:54,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 03:30:53" (1/3) ... [2023-05-20 15:30:54,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdb2dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 03:30:54, skipping insertion in model container [2023-05-20 15:30:54,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 03:30:54" (2/3) ... [2023-05-20 15:30:54,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdb2dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 03:30:54, skipping insertion in model container [2023-05-20 15:30:54,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 03:30:54" (3/3) ... [2023-05-20 15:30:54,556 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-12.i [2023-05-20 15:30:54,561 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 15:30:54,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 15:30:54,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 15:30:54,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 15:30:54,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-05-20 15:30:54,647 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:30:54,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 15:30:54,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:54,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 15:30:54,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 15:30:54,723 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 15:30:54,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 15:30:54,782 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;@25564dea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 15:30:54,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 15:30:54,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash -188900877, now seen corresponding path program 1 times [2023-05-20 15:30:54,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:54,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337957998] [2023-05-20 15:30:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:54,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:55,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:55,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337957998] [2023-05-20 15:30:55,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337957998] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:30:55,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:30:55,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 15:30:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376683716] [2023-05-20 15:30:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:30:55,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 15:30:55,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:55,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 15:30:55,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 15:30:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,216 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:55,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:55,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 15:30:55,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:55,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:55,234 INFO L85 PathProgramCache]: Analyzing trace with hash -694459502, now seen corresponding path program 1 times [2023-05-20 15:30:55,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:55,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805350572] [2023-05-20 15:30:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:55,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:55,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805350572] [2023-05-20 15:30:55,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805350572] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:30:55,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:30:55,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 15:30:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055304694] [2023-05-20 15:30:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:30:55,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 15:30:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:55,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 15:30:55,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 15:30:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:55,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:55,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 15:30:55,378 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:55,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -450083754, now seen corresponding path program 1 times [2023-05-20 15:30:55,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:55,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128326469] [2023-05-20 15:30:55,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:55,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:55,453 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-20 15:30:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128326469] [2023-05-20 15:30:55,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128326469] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:30:55,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:30:55,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 15:30:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598051855] [2023-05-20 15:30:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:30:55,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 15:30:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:55,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 15:30:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 15:30:55,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,455 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:55,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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-20 15:30:55,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-20 15:30:55,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1331916, now seen corresponding path program 1 times [2023-05-20 15:30:55,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:55,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357811027] [2023-05-20 15:30:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:55,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 15:30:55,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:55,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357811027] [2023-05-20 15:30:55,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357811027] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:30:55,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 15:30:55,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 15:30:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434010376] [2023-05-20 15:30:55,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:30:55,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 15:30:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 15:30:55,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 15:30:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:55,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:55,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:55,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-20 15:30:55,598 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:55,598 INFO L85 PathProgramCache]: Analyzing trace with hash -43157932, now seen corresponding path program 1 times [2023-05-20 15:30:55,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:55,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852995875] [2023-05-20 15:30:55,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:55,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852995875] [2023-05-20 15:30:55,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852995875] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:30:55,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182742194] [2023-05-20 15:30:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:55,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:55,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:55,787 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:30:55,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 15:30:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:55,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 15:30:55,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:30:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:55,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:30:56,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:56,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182742194] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:30:56,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:30:56,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 15:30:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423328609] [2023-05-20 15:30:56,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:30:56,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 15:30:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:56,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 15:30:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 15:30:56,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:56,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:56,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:56,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 15:30:56,296 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-20 15:30:56,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -698153053, now seen corresponding path program 1 times [2023-05-20 15:30:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:56,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243825568] [2023-05-20 15:30:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:56,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 15:30:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:56,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243825568] [2023-05-20 15:30:56,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243825568] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:30:56,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122204786] [2023-05-20 15:30:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:56,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:56,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:56,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:30:56,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 15:30:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:56,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 15:30:56,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:30:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 15:30:56,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:30:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 15:30:56,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122204786] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:30:56,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:30:56,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 15:30:56,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565326172] [2023-05-20 15:30:56,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:30:56,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 15:30:56,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 15:30:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 15:30:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,639 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:56,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:56,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:56,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:56,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:56,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-20 15:30:56,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:56,927 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:30:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash 22728182, now seen corresponding path program 1 times [2023-05-20 15:30:56,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:56,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725117864] [2023-05-20 15:30:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-20 15:30:57,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725117864] [2023-05-20 15:30:57,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725117864] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:30:57,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516837187] [2023-05-20 15:30:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:57,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:57,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:30:57,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 15:30:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:57,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 15:30:57,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:30:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-20 15:30:57,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:30:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-20 15:30:57,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516837187] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:30:57,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:30:57,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 15:30:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73528168] [2023-05-20 15:30:57,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:30:57,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 15:30:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 15:30:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 15:30:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:57,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:57,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:57,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:57,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:57,352 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-20 15:30:57,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:57,538 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-20 15:30:57,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:57,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1834869268, now seen corresponding path program 2 times [2023-05-20 15:30:57,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:57,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295283899] [2023-05-20 15:30:57,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:57,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:57,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295283899] [2023-05-20 15:30:57,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295283899] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:30:57,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19920804] [2023-05-20 15:30:57,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 15:30:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:57,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:57,687 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:30:57,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-20 15:30:57,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 15:30:57,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:30:57,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 15:30:57,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:30:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:57,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:30:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:30:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19920804] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:30:58,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:30:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 15:30:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495489402] [2023-05-20 15:30:58,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:30:58,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 15:30:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 15:30:58,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 15:30:58,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:58,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.0) internal successors, (180), 18 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-20 15:30:58,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:58,185 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-20 15:30:58,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:58,361 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-20 15:30:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1677972223, now seen corresponding path program 2 times [2023-05-20 15:30:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:58,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564178947] [2023-05-20 15:30:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 148 proven. 75 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-05-20 15:30:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564178947] [2023-05-20 15:30:58,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564178947] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:30:58,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660806216] [2023-05-20 15:30:58,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 15:30:58,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:58,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:30:58,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 15:30:58,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 15:30:58,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:30:58,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 15:30:58,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:30:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 148 proven. 75 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-05-20 15:30:58,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:30:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 148 proven. 75 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-05-20 15:30:58,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660806216] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:30:58,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:30:58,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 15:30:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996272360] [2023-05-20 15:30:58,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:30:58,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 15:30:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 15:30:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 15:30:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,734 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:58,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.666666666666666) internal successors, (210), 18 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:58,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:58,875 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-20 15:30:59,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:59,074 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-20 15:30:59,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1491178174, now seen corresponding path program 2 times [2023-05-20 15:30:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:59,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855706838] [2023-05-20 15:30:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:30:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-20 15:30:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:30:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855706838] [2023-05-20 15:30:59,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855706838] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:30:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887342437] [2023-05-20 15:30:59,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 15:30:59,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:59,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:30:59,221 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-20 15:30:59,293 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-20 15:30:59,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 15:30:59,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:30:59,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 15:30:59,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:30:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-20 15:30:59,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:30:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 180 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-20 15:30:59,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887342437] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:30:59,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:30:59,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 15:30:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434330171] [2023-05-20 15:30:59,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:30:59,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 15:30:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:30:59,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 15:30:59,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 15:30:59,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:59,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:30:59,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.444444444444445) internal successors, (224), 18 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:59,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:30:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:59,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:30:59,709 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-20 15:30:59,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:30:59,895 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-20 15:30:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:30:59,896 INFO L85 PathProgramCache]: Analyzing trace with hash 672786836, now seen corresponding path program 3 times [2023-05-20 15:30:59,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:30:59,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294014941] [2023-05-20 15:30:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:30:59,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:30:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:31:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:00,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294014941] [2023-05-20 15:31:00,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294014941] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:31:00,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985445815] [2023-05-20 15:31:00,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 15:31:00,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:31:00,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:00,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:31:00,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-20 15:31:00,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-05-20 15:31:00,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:31:00,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 15:31:00,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:31:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:31:00,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:31:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:31:00,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985445815] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:31:00,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:31:00,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-05-20 15:31:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373466843] [2023-05-20 15:31:00,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:31:00,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-05-20 15:31:00,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:00,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-05-20 15:31:00,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-05-20 15:31:00,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:00,716 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:00,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.294117647058824) internal successors, (316), 34 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:00,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:01,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:01,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-05-20 15:31:01,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-20 15:31:01,420 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-20 15:31:01,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:01,421 INFO L85 PathProgramCache]: Analyzing trace with hash 231266749, now seen corresponding path program 3 times [2023-05-20 15:31:01,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:01,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743045462] [2023-05-20 15:31:01,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:01,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 680 proven. 413 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2023-05-20 15:31:01,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:01,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743045462] [2023-05-20 15:31:01,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743045462] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:31:01,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048952267] [2023-05-20 15:31:01,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 15:31:01,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:31:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:01,821 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:31:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-20 15:31:01,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-05-20 15:31:01,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:31:01,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 32 conjunts are in the unsatisfiable core [2023-05-20 15:31:01,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:31:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 1387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:31:02,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:31:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 1387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:31:03,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048952267] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:31:03,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:31:03,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 33, 33] total 68 [2023-05-20 15:31:03,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224530035] [2023-05-20 15:31:03,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:31:03,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-05-20 15:31:03,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-05-20 15:31:03,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=807, Invalid=3749, Unknown=0, NotChecked=0, Total=4556 [2023-05-20 15:31:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:03,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:03,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 8.676470588235293) internal successors, (590), 68 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:03,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:05,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:05,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-20 15:31:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:31:05,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:31:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash -14992055, now seen corresponding path program 3 times [2023-05-20 15:31:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:05,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722314995] [2023-05-20 15:31:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:05,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2561 backedges. 1024 proven. 448 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2023-05-20 15:31:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722314995] [2023-05-20 15:31:05,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722314995] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:31:05,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096248987] [2023-05-20 15:31:05,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 15:31:05,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:31:05,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:05,888 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:31:05,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-20 15:31:06,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2023-05-20 15:31:06,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:31:06,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-20 15:31:06,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:31:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2561 backedges. 1080 proven. 512 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-05-20 15:31:06,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:31:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2561 backedges. 1080 proven. 512 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2023-05-20 15:31:06,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096248987] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:31:06,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:31:06,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 40 [2023-05-20 15:31:06,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014771064] [2023-05-20 15:31:06,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:31:06,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-20 15:31:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:06,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-20 15:31:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2023-05-20 15:31:06,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:06,765 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:06,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 10.2) internal successors, (408), 40 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:06,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:06,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:06,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:06,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:06,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:07,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-05-20 15:31:07,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-20 15:31:08,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-20 15:31:08,157 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:31:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash 977473851, now seen corresponding path program 4 times [2023-05-20 15:31:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:08,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947518331] [2023-05-20 15:31:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 1224 proven. 580 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2023-05-20 15:31:08,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:08,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947518331] [2023-05-20 15:31:08,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947518331] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:31:08,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469108045] [2023-05-20 15:31:08,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 15:31:08,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:31:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:08,793 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:31:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-20 15:31:08,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 15:31:08,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:31:08,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-20 15:31:08,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:31:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 1224 proven. 580 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2023-05-20 15:31:09,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 15:31:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 1224 proven. 580 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2023-05-20 15:31:09,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469108045] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 15:31:09,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 15:31:09,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 27 [2023-05-20 15:31:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221039981] [2023-05-20 15:31:09,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 15:31:09,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-20 15:31:09,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:09,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-20 15:31:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2023-05-20 15:31:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:09,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:09,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.0) internal successors, (297), 27 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:09,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:09,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:09,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:09,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:09,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:09,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-05-20 15:31:09,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-05-20 15:31:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-05-20 15:31:09,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-05-20 15:31:09,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-05-20 15:31:09,995 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:31:09,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:09,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1971190055, now seen corresponding path program 4 times [2023-05-20 15:31:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:09,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817186902] [2023-05-20 15:31:09,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 15:31:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4268 backedges. 3940 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 15:31:11,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 15:31:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817186902] [2023-05-20 15:31:11,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817186902] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 15:31:11,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612850539] [2023-05-20 15:31:11,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 15:31:11,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 15:31:11,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 15:31:11,725 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 15:31:11,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-20 15:31:11,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 15:31:11,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 15:31:11,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 26 conjunts are in the unsatisfiable core [2023-05-20 15:31:11,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 15:31:12,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4268 backedges. 3267 proven. 0 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2023-05-20 15:31:12,150 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 15:31:12,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612850539] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 15:31:12,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 15:31:12,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [53] total 55 [2023-05-20 15:31:12,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358742904] [2023-05-20 15:31:12,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 15:31:12,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-20 15:31:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 15:31:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-20 15:31:12,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=2236, Unknown=0, NotChecked=0, Total=2970 [2023-05-20 15:31:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:12,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 15:31:12,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.666666666666666) internal successors, (288), 27 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 15:31:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:12,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-05-20 15:31:12,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-05-20 15:31:12,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-05-20 15:31:12,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-20 15:31:12,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-20 15:31:12,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-05-20 15:31:12,747 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 15:31:12,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 15:31:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1330946169, now seen corresponding path program 5 times [2023-05-20 15:31:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 15:31:12,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787118953] [2023-05-20 15:31:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 15:31:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 15:31:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 15:31:12,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 15:31:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 15:31:13,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 15:31:13,004 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 15:31:13,005 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 15:31:13,006 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 15:31:13,007 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 15:31:13,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-05-20 15:31:13,011 INFO L444 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1] [2023-05-20 15:31:13,015 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 15:31:13,015 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 15:31:13,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 03:31:13 BasicIcfg [2023-05-20 15:31:13,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 15:31:13,232 INFO L158 Benchmark]: Toolchain (without parser) took 19471.22ms. Allocated memory was 203.4MB in the beginning and 470.8MB in the end (delta: 267.4MB). Free memory was 180.3MB in the beginning and 410.3MB in the end (delta: -230.0MB). Peak memory consumption was 294.4MB. Max. memory is 8.0GB. [2023-05-20 15:31:13,233 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 15:31:13,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.76ms. Allocated memory is still 203.4MB. Free memory was 180.1MB in the beginning and 168.9MB in the end (delta: 11.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2023-05-20 15:31:13,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.54ms. Allocated memory is still 203.4MB. Free memory was 168.9MB in the beginning and 166.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 15:31:13,233 INFO L158 Benchmark]: Boogie Preprocessor took 25.99ms. Allocated memory is still 203.4MB. Free memory was 166.8MB in the beginning and 165.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 15:31:13,233 INFO L158 Benchmark]: RCFGBuilder took 384.43ms. Allocated memory is still 203.4MB. Free memory was 165.2MB in the beginning and 151.4MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-05-20 15:31:13,233 INFO L158 Benchmark]: TraceAbstraction took 18682.65ms. Allocated memory was 203.4MB in the beginning and 470.8MB in the end (delta: 267.4MB). Free memory was 150.1MB in the beginning and 410.3MB in the end (delta: -260.2MB). Peak memory consumption was 265.3MB. Max. memory is 8.0GB. [2023-05-20 15:31:13,234 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 203.4MB. Free memory was 163.7MB in the beginning and 163.6MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.76ms. Allocated memory is still 203.4MB. Free memory was 180.1MB in the beginning and 168.9MB in the end (delta: 11.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.54ms. Allocated memory is still 203.4MB. Free memory was 168.9MB in the beginning and 166.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.99ms. Allocated memory is still 203.4MB. Free memory was 166.8MB in the beginning and 165.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 384.43ms. Allocated memory is still 203.4MB. Free memory was 165.2MB in the beginning and 151.4MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18682.65ms. Allocated memory was 203.4MB in the beginning and 470.8MB in the end (delta: 267.4MB). Free memory was 150.1MB in the beginning and 410.3MB in the end (delta: -260.2MB). Peak memory consumption was 265.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31769, independent: 27264, independent conditional: 25535, independent unconditional: 1729, dependent: 4505, dependent conditional: 4498, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 25535, independent unconditional: 1729, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 25535, independent unconditional: 1729, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 0, independent unconditional: 27264, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 0, independent unconditional: 27264, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 0, independent unconditional: 27264, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1652, independent: 1645, independent conditional: 0, independent unconditional: 1645, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1652, independent: 1644, independent conditional: 0, independent unconditional: 1644, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27271, independent: 25619, independent conditional: 0, independent unconditional: 25619, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1652, unknown conditional: 0, unknown unconditional: 1652] , Statistics on independence cache: Total cache size (in pairs): 1652, Positive cache size: 1645, Positive conditional cache size: 0, Positive unconditional cache size: 1645, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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: 4498 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 142, Number of trivial persistent sets: 77, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1736, independent: 1729, independent conditional: 0, independent unconditional: 1729, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31769, independent: 27264, independent conditional: 25535, independent unconditional: 1729, dependent: 4505, dependent conditional: 4498, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 25535, independent unconditional: 1729, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 25535, independent unconditional: 1729, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 0, independent unconditional: 27264, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 0, independent unconditional: 27264, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27271, independent: 27264, independent conditional: 0, independent unconditional: 27264, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1652, independent: 1645, independent conditional: 0, independent unconditional: 1645, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1652, independent: 1644, independent conditional: 0, independent unconditional: 1644, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27271, independent: 25619, independent conditional: 0, independent unconditional: 25619, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1652, unknown conditional: 0, unknown unconditional: 1652] , Statistics on independence cache: Total cache size (in pairs): 1652, Positive cache size: 1645, Positive conditional cache size: 0, Positive unconditional cache size: 1645, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, 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: 4498 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L702] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, next=0, prev=0] [L682] 0 int i, j; VAL [cur=1, i=0, j=0, next=0, prev=0] [L685] 0 int p, q; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L703] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L713] 0 pthread_t id1, id2; VAL [\old(argc)=196421, argc=196421, argv={196420:196419}, argv={196420:196419}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=196421, argc=196421, argv={196420:196419}, argv={196420:196419}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=196421, argc=196421, argv={196420:196419}, argv={196420:196419}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=196421, arg={0:0}, argc=196421, argv={196420:196419}, argv={196420:196419}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=196421, arg={0:0}, arg={0:0}, argc=196421, argv={196420:196419}, argv={196420:196419}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=1, p=0, prev=1, q=0, x=1] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=1, p=1, prev=1, q=0, x=1] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=1, p=1, prev=1, q=0, x=1] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=0, x=1] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=2, p=1, prev=1, q=1, x=1] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=2, p=1, prev=1, q=1, x=1] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=2, j=3, next=2, p=1, prev=1, q=1, x=1] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=2, j=3, next=2, p=1, prev=1, q=1, x=2] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=2, j=3, next=2, p=1, prev=1, q=1, x=2] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=3, next=2, p=1, prev=1, q=1, x=2] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=3, next=2, p=2, prev=1, q=1, x=2] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=3, next=2, p=2, prev=1, q=1, x=2] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=1, x=2] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=3, p=2, prev=1, q=2, x=2] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=3, p=2, prev=2, q=2, x=2] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=5, j=8, next=3, p=2, prev=2, q=2, x=2] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=5, j=8, next=3, p=2, prev=2, q=2, x=3] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=5, j=8, next=3, p=2, prev=2, q=2, x=3] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=8, next=3, p=2, prev=2, q=2, x=3] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=8, next=3, p=3, prev=2, q=2, x=3] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=8, next=3, p=3, prev=2, q=2, x=3] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=2, x=3] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=5, p=3, prev=2, q=3, x=3] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=5, p=3, prev=3, q=3, x=3] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=13, j=21, next=5, p=3, prev=3, q=3, x=3] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=13, j=21, next=5, p=3, prev=3, q=3, x=4] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=13, j=21, next=5, p=3, prev=3, q=3, x=4] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=21, next=5, p=3, prev=3, q=3, x=4] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=21, next=5, p=4, prev=3, q=3, x=4] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=21, next=5, p=4, prev=3, q=3, x=4] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=3, x=4] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=8, p=4, prev=3, q=4, x=4] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=8, p=4, prev=5, q=4, x=4] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=34, j=55, next=8, p=4, prev=5, q=4, x=4] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=34, j=55, next=8, p=4, prev=5, q=4, x=5] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=34, j=55, next=8, p=4, prev=5, q=4, x=5] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=55, next=8, p=4, prev=5, q=4, x=5] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=55, next=8, p=5, prev=5, q=4, x=5] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=55, next=8, p=5, prev=5, q=4, x=5] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=4, x=5] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=13, p=5, prev=5, q=5, x=5] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=13, p=5, prev=8, q=5, x=5] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=5] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=6] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=89, j=144, next=13, p=5, prev=8, q=5, x=6] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=144, next=13, p=5, prev=8, q=5, x=6] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=144, next=13, p=6, prev=8, q=5, x=6] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=144, next=13, p=6, prev=8, q=5, x=6] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=5, x=6] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=21, p=6, prev=8, q=6, x=6] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=21, p=6, prev=13, q=6, x=6] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=6] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=7] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=233, j=377, next=21, p=6, prev=13, q=6, x=7] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=377, next=21, p=6, prev=13, q=6, x=7] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=377, next=21, p=7, prev=13, q=6, x=7] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=377, next=21, p=7, prev=13, q=6, x=7] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=6, x=7] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=34, p=7, prev=13, q=7, x=7] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=34, p=7, prev=21, q=7, x=7] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=7] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=987, next=34, p=7, prev=21, q=7, x=8] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=987, next=34, p=8, prev=21, q=7, x=8] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=987, next=34, p=8, prev=21, q=7, x=8] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=7, x=8] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=55, p=8, prev=21, q=8, x=8] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=55, p=8, prev=34, q=8, x=8] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1597, j=2584, next=55, p=8, prev=34, q=8, x=8] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1597, j=2584, next=55, p=8, prev=34, q=8, x=9] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=1597, j=2584, next=55, p=8, prev=34, q=8, x=9] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=2584, next=55, p=8, prev=34, q=8, x=9] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=2584, next=55, p=9, prev=34, q=8, x=9] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=2584, next=55, p=9, prev=34, q=8, x=9] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=8, x=9] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=89, p=9, prev=34, q=9, x=9] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=89, p=9, prev=55, q=9, x=9] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=4181, j=6765, next=89, p=9, prev=55, q=9, x=9] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=4181, j=6765, next=89, p=9, prev=55, q=9, x=10] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=4181, j=6765, next=89, p=9, prev=55, q=9, x=10] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=6765, next=89, p=9, prev=55, q=9, x=10] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=6765, next=89, p=10, prev=55, q=9, x=10] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=6765, next=89, p=10, prev=55, q=9, x=10] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=9, x=10] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=144, p=10, prev=55, q=10, x=10] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=144, p=10, prev=89, q=10, x=10] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=10946, j=17711, next=144, p=10, prev=89, q=10, x=10] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=10946, j=17711, next=144, p=10, prev=89, q=10, x=11] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=10946, j=17711, next=144, p=10, prev=89, q=10, x=11] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=17711, next=144, p=10, prev=89, q=10, x=11] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=17711, next=144, p=11, prev=89, q=10, x=11] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=17711, next=144, p=11, prev=89, q=10, x=11] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=10, x=11] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=233, p=11, prev=89, q=11, x=11] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=11] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=11] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=12] [L687] COND TRUE 1 p < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=12] [L689] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=46368, next=233, p=11, prev=144, q=11, x=12] [L687] 1 p++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=46368, next=233, p=12, prev=144, q=11, x=12] [L695] COND TRUE 2 q < 12 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=46368, next=233, p=12, prev=144, q=11, x=12] [L697] 2 j = j + i VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=233, p=12, prev=144, q=11, x=12] [L695] 2 q++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=233, p=12, prev=144, q=12, x=12] [L705] COND TRUE 0 x < 26 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=233, p=12, prev=144, q=12, x=12] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=377, p=12, prev=144, q=12, x=12] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=12] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=12] [L705] 0 x++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L687] COND FALSE 1 !(p < 12) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L692] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L695] COND FALSE 2 !(q < 12) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L700] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=377, p=12, prev=233, q=12, x=13] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=610, p=12, prev=233, q=12, x=13] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=75025, j=121393, next=610, p=12, prev=377, q=12, x=13] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=610, p=12, prev=377, q=12, x=13] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=610, p=12, prev=377, q=12, x=14] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=610, p=12, prev=377, q=12, x=14] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=987, p=12, prev=377, q=12, x=14] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=75025, j=121393, next=987, p=12, prev=610, q=12, x=14] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=987, p=12, prev=610, q=12, x=14] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=987, p=12, prev=610, q=12, x=15] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=987, p=12, prev=610, q=12, x=15] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=1597, p=12, prev=610, q=12, x=15] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=75025, j=121393, next=1597, p=12, prev=987, q=12, x=15] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=1597, p=12, prev=987, q=12, x=15] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=1597, p=12, prev=987, q=12, x=16] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=1597, p=12, prev=987, q=12, x=16] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=2584, p=12, prev=987, q=12, x=16] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=75025, j=121393, next=2584, p=12, prev=1597, q=12, x=16] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=2584, p=12, prev=1597, q=12, x=16] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=2584, p=12, prev=1597, q=12, x=17] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=2584, p=12, prev=1597, q=12, x=17] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=4181, p=12, prev=1597, q=12, x=17] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=75025, j=121393, next=4181, p=12, prev=2584, q=12, x=17] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=4181, p=12, prev=2584, q=12, x=17] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=4181, p=12, prev=2584, q=12, x=18] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=4181, p=12, prev=2584, q=12, x=18] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=6765, p=12, prev=2584, q=12, x=18] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=75025, j=121393, next=6765, p=12, prev=4181, q=12, x=18] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=6765, p=12, prev=4181, q=12, x=18] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=6765, p=12, prev=4181, q=12, x=19] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=6765, p=12, prev=4181, q=12, x=19] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=10946, p=12, prev=4181, q=12, x=19] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=75025, j=121393, next=10946, p=12, prev=6765, q=12, x=19] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=10946, p=12, prev=6765, q=12, x=19] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=10946, p=12, prev=6765, q=12, x=20] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=10946, p=12, prev=6765, q=12, x=20] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=17711, p=12, prev=6765, q=12, x=20] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=75025, j=121393, next=17711, p=12, prev=10946, q=12, x=20] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=17711, p=12, prev=10946, q=12, x=20] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=17711, p=12, prev=10946, q=12, x=21] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=17711, p=12, prev=10946, q=12, x=21] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=28657, p=12, prev=10946, q=12, x=21] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=75025, j=121393, next=28657, p=12, prev=17711, q=12, x=21] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=28657, p=12, prev=17711, q=12, x=21] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=28657, p=12, prev=17711, q=12, x=22] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=28657, p=12, prev=17711, q=12, x=22] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=46368, p=12, prev=17711, q=12, x=22] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=75025, j=121393, next=46368, p=12, prev=28657, q=12, x=22] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=46368, p=12, prev=28657, q=12, x=22] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=46368, p=12, prev=28657, q=12, x=23] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=46368, p=12, prev=28657, q=12, x=23] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=75025, p=12, prev=28657, q=12, x=23] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=75025, j=121393, next=75025, p=12, prev=46368, q=12, x=23] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=75025, p=12, prev=46368, q=12, x=23] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=75025, p=12, prev=46368, q=12, x=24] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=75025, p=12, prev=46368, q=12, x=24] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=121393, p=12, prev=46368, q=12, x=24] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=75025, j=121393, next=121393, p=12, prev=75025, q=12, x=24] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=121393, p=12, prev=75025, q=12, x=24] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=121393, p=12, prev=75025, q=12, x=25] [L705] COND TRUE 0 x < 26 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=121393, p=12, prev=75025, q=12, x=25] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=196418, p=12, prev=75025, q=12, x=25] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=121393, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=25] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=25] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L705] COND FALSE 0 !(x < 26) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L710] 0 return prev; VAL [\result={0:0}, \result={0:0}, \result=121393, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); VAL [\old(argc)=196421, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=196421, argv={196420:196419}, argv={196420:196419}, correct=121393, cur=196418, fib()=121393, i=75025, id1={5:0}, id2={3:0}, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=196421, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=196421, argv={196420:196419}, argv={196420:196419}, assert_cond=0, correct=121393, cur=196418, i=75025, id1={5:0}, id2={3:0}, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, expression=0, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=196418, expression=0, i=75025, j=121393, next=196418, p=12, prev=121393, q=12, x=26] - UnprovableResult [Line: 720]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 117 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 5.1s, 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: 381, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 5281 NumberOfCodeBlocks, 5260 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 6754 ConstructedInterpolants, 0 QuantifiedInterpolants, 13170 SizeOfPredicates, 124 NumberOfNonLiveVariables, 4457 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 36 InterpolantComputations, 5 PerfectInterpolantSequences, 23627/32169 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 proved your program to be incorrect! [2023-05-20 15:31:13,275 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-20 15:31:13,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...