/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy BADGER --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-e57bdd3-m [2022-10-10 11:39:37,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-10 11:39:37,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-10 11:39:37,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-10 11:39:37,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-10 11:39:37,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-10 11:39:37,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-10 11:39:37,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-10 11:39:37,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-10 11:39:37,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-10 11:39:37,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-10 11:39:37,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-10 11:39:37,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-10 11:39:37,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-10 11:39:37,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-10 11:39:37,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-10 11:39:37,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-10 11:39:37,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-10 11:39:37,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-10 11:39:37,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-10 11:39:37,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-10 11:39:37,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-10 11:39:37,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-10 11:39:37,754 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-10 11:39:37,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-10 11:39:37,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-10 11:39:37,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-10 11:39:37,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-10 11:39:37,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-10 11:39:37,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-10 11:39:37,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-10 11:39:37,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-10 11:39:37,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-10 11:39:37,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-10 11:39:37,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-10 11:39:37,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-10 11:39:37,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-10 11:39:37,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-10 11:39:37,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-10 11:39:37,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-10 11:39:37,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-10 11:39:37,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-10 11:39:37,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-10 11:39:37,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-10 11:39:37,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-10 11:39:37,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-10 11:39:37,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-10 11:39:37,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-10 11:39:37,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-10 11:39:37,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-10 11:39:37,800 INFO L138 SettingsManager]: * Use SBE=true [2022-10-10 11:39:37,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-10 11:39:37,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-10 11:39:37,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-10 11:39:37,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-10 11:39:37,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-10 11:39:37,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-10 11:39:37,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-10 11:39:37,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-10 11:39:37,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-10 11:39:37,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-10 11:39:37,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-10 11:39:37,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-10 11:39:37,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-10 11:39:37,804 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-10 11:39:37,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-10 11:39:37,804 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-10 11:39:37,804 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-10 11:39:37,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-10 11:39:37,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-10 11:39:37,805 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-10 11:39:37,805 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-10 11:39:37,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-10 11:39:37,805 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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: Trace refinement strategy -> BADGER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2022-10-10 11:39:38,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-10 11:39:38,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-10 11:39:38,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-10 11:39:38,124 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-10 11:39:38,125 INFO L275 PluginConnector]: CDTParser initialized [2022-10-10 11:39:38,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2022-10-10 11:39:38,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90ccd4ab/52c3ad83861b42979c41e693a975b18a/FLAGb3fc01c9e [2022-10-10 11:39:38,788 INFO L306 CDTParser]: Found 1 translation units. [2022-10-10 11:39:38,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2022-10-10 11:39:38,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90ccd4ab/52c3ad83861b42979c41e693a975b18a/FLAGb3fc01c9e [2022-10-10 11:39:39,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90ccd4ab/52c3ad83861b42979c41e693a975b18a [2022-10-10 11:39:39,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-10 11:39:39,028 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-10 11:39:39,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-10 11:39:39,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-10 11:39:39,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-10 11:39:39,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b8a12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39, skipping insertion in model container [2022-10-10 11:39:39,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-10 11:39:39,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-10 11:39:39,252 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-10-10 11:39:39,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2022-10-10 11:39:39,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-10 11:39:39,712 INFO L203 MainTranslator]: Completed pre-run [2022-10-10 11:39:39,724 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-10-10 11:39:39,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2022-10-10 11:39:39,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-10 11:39:39,879 INFO L208 MainTranslator]: Completed translation [2022-10-10 11:39:39,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39 WrapperNode [2022-10-10 11:39:39,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-10 11:39:39,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-10 11:39:39,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-10 11:39:39,881 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-10 11:39:39,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,964 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-10-10 11:39:39,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-10 11:39:39,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-10 11:39:39,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-10 11:39:39,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-10 11:39:39,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:39,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:40,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:40,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:40,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:40,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-10 11:39:40,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-10 11:39:40,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-10 11:39:40,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-10 11:39:40,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (1/1) ... [2022-10-10 11:39:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-10 11:39:40,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:40,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-10 11:39:40,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-10 11:39:40,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-10 11:39:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-10 11:39:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-10-10 11:39:40,116 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-10-10 11:39:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-10 11:39:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-10 11:39:40,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-10 11:39:40,117 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-10 11:39:40,480 INFO L234 CfgBuilder]: Building ICFG [2022-10-10 11:39:40,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-10 11:39:40,770 INFO L275 CfgBuilder]: Performing block encoding [2022-10-10 11:39:40,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-10 11:39:40,786 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-10 11:39:40,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:40 BoogieIcfgContainer [2022-10-10 11:39:40,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-10 11:39:40,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-10 11:39:40,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-10 11:39:40,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-10 11:39:40,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:39:39" (1/3) ... [2022-10-10 11:39:40,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fe15b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:39:40, skipping insertion in model container [2022-10-10 11:39:40,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:39:39" (2/3) ... [2022-10-10 11:39:40,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fe15b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:39:40, skipping insertion in model container [2022-10-10 11:39:40,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:39:40" (3/3) ... [2022-10-10 11:39:40,802 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2022-10-10 11:39:40,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-10 11:39:40,820 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-10 11:39:40,821 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-10 11:39:40,821 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-10 11:39:40,887 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-10 11:39:40,932 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-10 11:39:40,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 11:39:40,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:40,934 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) [2022-10-10 11:39:40,935 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 [2022-10-10 11:39:40,963 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 11:39:40,970 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 11:39:40,976 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;@ca4a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 11:39:40,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 11:39:41,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash -34102460, now seen corresponding path program 1 times [2022-10-10 11:39:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:41,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67589881] [2022-10-10 11:39:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:41,481 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:41,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67589881] [2022-10-10 11:39:41,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67589881] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:41,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:41,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 11:39:41,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124924212] [2022-10-10 11:39:41,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:41,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 11:39:41,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 11:39:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 11:39:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,519 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:41,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:41,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-10 11:39:41,625 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 11:39:41,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-10 11:39:41,629 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-10-10 11:39:41,631 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8) [2022-10-10 11:39:41,642 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-10 11:39:41,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 11:39:41,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:41,644 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-10 11:39:41,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-10 11:39:41,655 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 11:39:41,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 11:39:41,657 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;@ca4a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 11:39:41,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 11:39:41,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:41,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash 824109101, now seen corresponding path program 1 times [2022-10-10 11:39:41,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:41,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967508797] [2022-10-10 11:39:41,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:41,802 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967508797] [2022-10-10 11:39:41,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967508797] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:41,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:41,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 11:39:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150922676] [2022-10-10 11:39:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:41,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 11:39:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 11:39:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 11:39:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,807 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:41,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:41,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-10 11:39:41,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash -888642596, now seen corresponding path program 1 times [2022-10-10 11:39:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:41,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21004264] [2022-10-10 11:39:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:41,941 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:41,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21004264] [2022-10-10 11:39:41,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21004264] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:41,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:41,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 11:39:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689641040] [2022-10-10 11:39:41,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:41,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 11:39:41,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 11:39:41,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 11:39:41,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:41,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:41,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:41,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-10 11:39:42,062 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 11:39:42,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-10 11:39:42,064 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-10-10 11:39:42,064 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/8) [2022-10-10 11:39:42,075 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-10 11:39:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 11:39:42,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:42,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-10 11:39:42,090 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 11:39:42,091 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 11:39:42,092 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;@ca4a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 11:39:42,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 11:39:42,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-10 11:39:42,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:42,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1983115351, now seen corresponding path program 1 times [2022-10-10 11:39:42,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:42,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014515724] [2022-10-10 11:39:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:42,217 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:42,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014515724] [2022-10-10 11:39:42,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014515724] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:42,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:42,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 11:39:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84992908] [2022-10-10 11:39:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:42,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 11:39:42,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:42,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 11:39:42,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 11:39:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:42,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.0) internal successors, (80), 2 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:42,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-10 11:39:42,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:42,239 INFO L85 PathProgramCache]: Analyzing trace with hash -170107804, now seen corresponding path program 1 times [2022-10-10 11:39:42,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:42,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623234775] [2022-10-10 11:39:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:42,445 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:42,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623234775] [2022-10-10 11:39:42,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623234775] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:42,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:42,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 11:39:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906965645] [2022-10-10 11:39:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:42,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 11:39:42,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:42,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 11:39:42,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 11:39:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,448 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:42,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:42,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-10 11:39:42,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-10 11:39:42,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1198635144, now seen corresponding path program 1 times [2022-10-10 11:39:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071783559] [2022-10-10 11:39:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:42,967 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:42,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071783559] [2022-10-10 11:39:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071783559] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:42,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-10 11:39:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232266591] [2022-10-10 11:39:42,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:42,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-10 11:39:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:42,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-10 11:39:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-10 11:39:42,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:42,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:42,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:42,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-10 11:39:42,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-10 11:39:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-10 11:39:43,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 11:39:43,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-10 11:39:43,170 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-10-10 11:39:43,171 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/8) [2022-10-10 11:39:43,173 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-10 11:39:43,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 11:39:43,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:43,179 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-10 11:39:43,187 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 11:39:43,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 11:39:43,187 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;@ca4a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 11:39:43,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 11:39:43,206 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:43,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:43,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1121045935, now seen corresponding path program 1 times [2022-10-10 11:39:43,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:43,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600181667] [2022-10-10 11:39:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:43,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-10-10 11:39:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:43,263 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600181667] [2022-10-10 11:39:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600181667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:43,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:43,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 11:39:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637883267] [2022-10-10 11:39:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:43,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 11:39:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:43,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 11:39:43,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 11:39:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,265 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:43,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:43,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-10 11:39:43,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 896697388, now seen corresponding path program 1 times [2022-10-10 11:39:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:43,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816124878] [2022-10-10 11:39:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:43,393 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816124878] [2022-10-10 11:39:43,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816124878] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:43,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:43,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 11:39:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205030659] [2022-10-10 11:39:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:43,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 11:39:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 11:39:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 11:39:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,409 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:43,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:43,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-10 11:39:43,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-10 11:39:43,701 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:43,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash -972519732, now seen corresponding path program 1 times [2022-10-10 11:39:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:43,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996854389] [2022-10-10 11:39:43,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:43,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:43,801 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:43,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996854389] [2022-10-10 11:39:43,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996854389] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:43,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:43,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-10 11:39:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188497499] [2022-10-10 11:39:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:43,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-10 11:39:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:43,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-10 11:39:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-10 11:39:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,804 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:43,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:43,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-10 11:39:43,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-10 11:39:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-10 11:39:43,987 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 11:39:43,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-10 11:39:43,988 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-10-10 11:39:43,988 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/8) [2022-10-10 11:39:43,991 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-10 11:39:43,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 11:39:43,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:43,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-10 11:39:44,005 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 11:39:44,005 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 11:39:44,005 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;@ca4a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 11:39:44,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 11:39:44,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-10-10 11:39:44,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 318555048, now seen corresponding path program 1 times [2022-10-10 11:39:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:44,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929037168] [2022-10-10 11:39:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:44,135 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:44,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929037168] [2022-10-10 11:39:44,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929037168] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:44,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:44,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 11:39:44,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181930943] [2022-10-10 11:39:44,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:44,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 11:39:44,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 11:39:44,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 11:39:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:44,138 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:44,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:44,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:44,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-10 11:39:44,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:44,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash -112432435, now seen corresponding path program 1 times [2022-10-10 11:39:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:44,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515611024] [2022-10-10 11:39:44,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:44,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:44,736 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:44,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515611024] [2022-10-10 11:39:44,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515611024] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:44,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:44,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-10 11:39:44,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473172558] [2022-10-10 11:39:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:44,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-10 11:39:44,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-10 11:39:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-10-10 11:39:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:44,741 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:44,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.066666666666666) internal successors, (121), 15 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:44,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:44,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:45,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:45,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-10 11:39:45,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-10 11:39:45,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash 535077707, now seen corresponding path program 2 times [2022-10-10 11:39:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:45,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204820892] [2022-10-10 11:39:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:45,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:45,987 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204820892] [2022-10-10 11:39:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204820892] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:45,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:45,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-10 11:39:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627713053] [2022-10-10 11:39:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-10 11:39:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-10 11:39:45,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-10-10 11:39:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:45,989 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:45,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.066666666666666) internal successors, (121), 15 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:45,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:45,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-10 11:39:45,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:47,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-10 11:39:47,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-10 11:39:47,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-10 11:39:47,040 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:47,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 752296937, now seen corresponding path program 3 times [2022-10-10 11:39:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:47,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503003211] [2022-10-10 11:39:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:47,538 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:47,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503003211] [2022-10-10 11:39:47,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503003211] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:47,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:47,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-10-10 11:39:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714206311] [2022-10-10 11:39:47,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:47,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-10 11:39:47,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:47,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-10 11:39:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-10-10 11:39:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:47,541 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:47,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.722222222222222) internal successors, (121), 18 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:47,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:47,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-10 11:39:47,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-10-10 11:39:47,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:49,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-10 11:39:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-10 11:39:49,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-10 11:39:49,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 11:39:49,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-10 11:39:49,345 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-10-10 11:39:49,347 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/8) [2022-10-10 11:39:49,349 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-10 11:39:49,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 11:39:49,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 11:39:49,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-10 11:39:49,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2022-10-10 11:39:49,385 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 11:39:49,385 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 11:39:49,386 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;@ca4a0d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 11:39:49,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 11:39:49,447 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:49,447 INFO L85 PathProgramCache]: Analyzing trace with hash 806851193, now seen corresponding path program 1 times [2022-10-10 11:39:49,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:49,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107052462] [2022-10-10 11:39:49,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:49,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:49,491 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:49,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107052462] [2022-10-10 11:39:49,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107052462] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:49,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:49,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 11:39:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907187029] [2022-10-10 11:39:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:49,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 11:39:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 11:39:49,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 11:39:49,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:49,493 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:49,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.5) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:49,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:49,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:49,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-10 11:39:49,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1999905453, now seen corresponding path program 1 times [2022-10-10 11:39:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:49,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790524343] [2022-10-10 11:39:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:49,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:50,587 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:50,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790524343] [2022-10-10 11:39:50,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790524343] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:50,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:50,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-10-10 11:39:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032115762] [2022-10-10 11:39:50,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:50,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-10 11:39:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:50,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-10 11:39:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2022-10-10 11:39:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:50,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:50,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:50,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:50,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-10 11:39:53,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-10 11:39:53,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1164222767, now seen corresponding path program 2 times [2022-10-10 11:39:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:53,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76788419] [2022-10-10 11:39:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:53,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:54,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:54,300 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76788419] [2022-10-10 11:39:54,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76788419] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:54,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:54,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-10-10 11:39:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035292580] [2022-10-10 11:39:54,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:54,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-10 11:39:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-10 11:39:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-10-10 11:39:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:54,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:54,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 29 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:54,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:54,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-10-10 11:39:54,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-10 11:39:58,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-10 11:39:58,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-10 11:39:58,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:39:58,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:39:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 601744911, now seen corresponding path program 3 times [2022-10-10 11:39:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:39:58,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077312549] [2022-10-10 11:39:58,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:39:58,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:39:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 11:39:59,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-10 11:39:59,116 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 11:39:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077312549] [2022-10-10 11:39:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077312549] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 11:39:59,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 11:39:59,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-10-10 11:39:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921989518] [2022-10-10 11:39:59,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 11:39:59,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-10 11:39:59,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 11:39:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-10 11:39:59,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-10-10 11:39:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:59,119 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 11:39:59,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.448275862068965) internal successors, (129), 29 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-10 11:39:59,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:39:59,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-10-10 11:39:59,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-10-10 11:39:59,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:40:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 11:40:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-10-10 11:40:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-10 11:40:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-10-10 11:40:02,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-10 11:40:02,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 11:40:02,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 11:40:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1040824943, now seen corresponding path program 4 times [2022-10-10 11:40:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 11:40:02,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098968593] [2022-10-10 11:40:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 11:40:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 11:40:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-10 11:40:02,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-10 11:40:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-10 11:40:02,710 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-10-10 11:40:02,710 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-10 11:40:02,710 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 11:40:02,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-10 11:40:02,711 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2022-10-10 11:40:02,713 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (6/8) [2022-10-10 11:40:02,716 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-10 11:40:02,716 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-10 11:40:02,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:40:02 BasicIcfg [2022-10-10 11:40:02,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-10 11:40:02,817 INFO L158 Benchmark]: Toolchain (without parser) took 23789.63ms. Allocated memory was 199.2MB in the beginning and 354.4MB in the end (delta: 155.2MB). Free memory was 160.1MB in the beginning and 146.9MB in the end (delta: 13.2MB). Peak memory consumption was 169.2MB. Max. memory is 8.0GB. [2022-10-10 11:40:02,817 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 199.2MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-10 11:40:02,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 848.90ms. Allocated memory is still 199.2MB. Free memory was 159.9MB in the beginning and 140.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2022-10-10 11:40:02,818 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.10ms. Allocated memory is still 199.2MB. Free memory was 140.0MB in the beginning and 136.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-10 11:40:02,818 INFO L158 Benchmark]: Boogie Preprocessor took 73.44ms. Allocated memory is still 199.2MB. Free memory was 136.9MB in the beginning and 134.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-10 11:40:02,818 INFO L158 Benchmark]: RCFGBuilder took 755.06ms. Allocated memory is still 199.2MB. Free memory was 134.3MB in the beginning and 111.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-10-10 11:40:02,818 INFO L158 Benchmark]: TraceAbstraction took 22019.97ms. Allocated memory was 199.2MB in the beginning and 354.4MB in the end (delta: 155.2MB). Free memory was 110.7MB in the beginning and 146.9MB in the end (delta: -36.2MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. [2022-10-10 11:40:02,820 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.15ms. Allocated memory is still 199.2MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 848.90ms. Allocated memory is still 199.2MB. Free memory was 159.9MB in the beginning and 140.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 84.10ms. Allocated memory is still 199.2MB. Free memory was 140.0MB in the beginning and 136.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.44ms. Allocated memory is still 199.2MB. Free memory was 136.9MB in the beginning and 134.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 755.06ms. Allocated memory is still 199.2MB. Free memory was 134.3MB in the beginning and 111.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 22019.97ms. Allocated memory was 199.2MB in the beginning and 354.4MB in the end (delta: 155.2MB). Free memory was 110.7MB in the beginning and 146.9MB in the end (delta: -36.2MB). Peak memory consumption was 120.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 3, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3414, positive: 3267, positive conditional: 3267, positive unconditional: 0, negative: 147, negative conditional: 147, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3279, positive: 3267, positive conditional: 0, positive unconditional: 3267, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 553, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3279, positive: 2724, positive conditional: 0, positive unconditional: 2724, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 553, unknown conditional: 0, unknown unconditional: 553] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3414, positive: 3267, positive conditional: 3267, positive unconditional: 0, negative: 147, negative conditional: 147, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3279, positive: 3267, positive conditional: 0, positive unconditional: 3267, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 553, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3279, positive: 2724, positive conditional: 0, positive unconditional: 2724, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 553, unknown conditional: 0, unknown unconditional: 553] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 167, positive: 143, positive conditional: 143, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3414, positive: 3267, positive conditional: 3267, positive unconditional: 0, negative: 147, negative conditional: 147, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3279, positive: 3267, positive conditional: 0, positive unconditional: 3267, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 553, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3279, positive: 2724, positive conditional: 0, positive unconditional: 2724, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 553, unknown conditional: 0, unknown unconditional: 553] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 29, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3239, positive: 3124, positive conditional: 3124, positive unconditional: 0, negative: 115, negative conditional: 115, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3414, positive: 3267, positive conditional: 3267, positive unconditional: 0, negative: 147, negative conditional: 147, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3279, positive: 3267, positive conditional: 0, positive unconditional: 3267, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 553, positive: 543, positive conditional: 0, positive unconditional: 543, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3279, positive: 2724, positive conditional: 0, positive unconditional: 2724, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 553, unknown conditional: 0, unknown unconditional: 553] , Statistics on independence cache: Total cache size (in pairs): 553, Positive cache size: 543, Positive conditional cache size: 0, Positive unconditional cache size: 543, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Independence queries for same thread: 135, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3424, positive: 3270, positive conditional: 3270, positive unconditional: 0, negative: 154, negative conditional: 154, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3282, positive: 3270, positive conditional: 0, positive unconditional: 3270, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 554, positive: 544, positive conditional: 0, positive unconditional: 544, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, positive: 2726, positive conditional: 0, positive unconditional: 2726, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 554, unknown conditional: 0, unknown unconditional: 554] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3424, positive: 3270, positive conditional: 3270, positive unconditional: 0, negative: 154, negative conditional: 154, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3282, positive: 3270, positive conditional: 0, positive unconditional: 3270, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 554, positive: 544, positive conditional: 0, positive unconditional: 544, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, positive: 2726, positive conditional: 0, positive unconditional: 2726, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 554, unknown conditional: 0, unknown unconditional: 554] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 173, positive: 146, positive conditional: 146, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3424, positive: 3270, positive conditional: 3270, positive unconditional: 0, negative: 154, negative conditional: 154, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3282, positive: 3270, positive conditional: 0, positive unconditional: 3270, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 554, positive: 544, positive conditional: 0, positive unconditional: 544, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, positive: 2726, positive conditional: 0, positive unconditional: 2726, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 554, unknown conditional: 0, unknown unconditional: 554] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Independence queries for same thread: 34, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3241, positive: 3124, positive conditional: 3124, positive unconditional: 0, negative: 117, negative conditional: 117, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3424, positive: 3270, positive conditional: 3270, positive unconditional: 0, negative: 154, negative conditional: 154, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3282, positive: 3270, positive conditional: 0, positive unconditional: 3270, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 554, positive: 544, positive conditional: 0, positive unconditional: 544, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3282, positive: 2726, positive conditional: 0, positive unconditional: 2726, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 554, unknown conditional: 0, unknown unconditional: 554] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 544, Positive conditional cache size: 0, Positive unconditional cache size: 544, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Independence queries for same thread: 142, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 22, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17020, positive: 15808, positive conditional: 15808, positive unconditional: 0, negative: 1212, negative conditional: 1212, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15991, positive: 15808, positive conditional: 0, positive unconditional: 15808, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1075, positive: 1056, positive conditional: 0, positive unconditional: 1056, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15991, positive: 14752, positive conditional: 0, positive unconditional: 14752, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 1075, unknown conditional: 0, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 4, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 22, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17020, positive: 15808, positive conditional: 15808, positive unconditional: 0, negative: 1212, negative conditional: 1212, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15991, positive: 15808, positive conditional: 0, positive unconditional: 15808, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1075, positive: 1056, positive conditional: 0, positive unconditional: 1056, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15991, positive: 14752, positive conditional: 0, positive unconditional: 14752, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 1075, unknown conditional: 0, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 8, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 283, positive: 250, positive conditional: 250, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17020, positive: 15808, positive conditional: 15808, positive unconditional: 0, negative: 1212, negative conditional: 1212, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15991, positive: 15808, positive conditional: 0, positive unconditional: 15808, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1075, positive: 1056, positive conditional: 0, positive unconditional: 1056, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15991, positive: 14752, positive conditional: 0, positive unconditional: 14752, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 1075, unknown conditional: 0, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 37, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3220, positive: 2986, positive conditional: 2986, positive unconditional: 0, negative: 234, negative conditional: 234, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17020, positive: 15808, positive conditional: 15808, positive unconditional: 0, negative: 1212, negative conditional: 1212, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15991, positive: 15808, positive conditional: 0, positive unconditional: 15808, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1075, positive: 1056, positive conditional: 0, positive unconditional: 1056, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15991, positive: 14752, positive conditional: 0, positive unconditional: 14752, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 1075, unknown conditional: 0, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 635, Positive cache size: 626, Positive conditional cache size: 0, Positive unconditional cache size: 626, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Independence queries for same thread: 251, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 13473, positive: 12536, positive conditional: 12536, positive unconditional: 0, negative: 937, negative conditional: 937, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17020, positive: 15808, positive conditional: 15808, positive unconditional: 0, negative: 1212, negative conditional: 1212, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15991, positive: 15808, positive conditional: 0, positive unconditional: 15808, negative: 183, negative conditional: 0, negative unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1075, positive: 1056, positive conditional: 0, positive unconditional: 1056, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15991, positive: 14752, positive conditional: 0, positive unconditional: 14752, negative: 164, negative conditional: 0, negative unconditional: 164, unknown: 1075, unknown conditional: 0, unknown unconditional: 1075] , Statistics on independence cache: Total cache size (in pairs): 1075, Positive cache size: 1056, Positive conditional cache size: 0, Positive unconditional cache size: 1056, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Independence queries for same thread: 1029, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 23, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3846, positive: 3504, positive conditional: 3504, positive unconditional: 0, negative: 342, negative conditional: 342, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, positive: 3504, positive conditional: 0, positive unconditional: 3504, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, positive: 624, positive conditional: 0, positive unconditional: 624, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3534, positive: 2880, positive conditional: 0, positive unconditional: 2880, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 5, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 23, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3846, positive: 3504, positive conditional: 3504, positive unconditional: 0, negative: 342, negative conditional: 342, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, positive: 3504, positive conditional: 0, positive unconditional: 3504, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, positive: 624, positive conditional: 0, positive unconditional: 624, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3534, positive: 2880, positive conditional: 0, positive unconditional: 2880, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 10, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 163, positive: 141, positive conditional: 141, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3846, positive: 3504, positive conditional: 3504, positive unconditional: 0, negative: 342, negative conditional: 342, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, positive: 3504, positive conditional: 0, positive unconditional: 3504, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, positive: 624, positive conditional: 0, positive unconditional: 624, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3534, positive: 2880, positive conditional: 0, positive unconditional: 2880, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Independence queries for same thread: 31, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 290, positive: 247, positive conditional: 247, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3846, positive: 3504, positive conditional: 3504, positive unconditional: 0, negative: 342, negative conditional: 342, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, positive: 3504, positive conditional: 0, positive unconditional: 3504, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, positive: 624, positive conditional: 0, positive unconditional: 624, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3534, positive: 2880, positive conditional: 0, positive unconditional: 2880, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 200, Positive conditional cache size: 0, Positive unconditional cache size: 200, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Independence queries for same thread: 70, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3347, positive: 3080, positive conditional: 3080, positive unconditional: 0, negative: 267, negative conditional: 267, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3846, positive: 3504, positive conditional: 3504, positive unconditional: 0, negative: 342, negative conditional: 342, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3534, positive: 3504, positive conditional: 0, positive unconditional: 3504, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 637, positive: 624, positive conditional: 0, positive unconditional: 624, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3534, positive: 2880, positive conditional: 0, positive unconditional: 2880, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 637, unknown conditional: 0, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 637, Positive cache size: 624, Positive conditional cache size: 0, Positive unconditional cache size: 624, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Independence queries for same thread: 312, Statistics for Abstraction: - PositiveResult [Line: 1675]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1675]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1675]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1675]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1675]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={3:0}, t2={4:0}] [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={3:0}, t2={4:0}] [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; VAL [\result=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, my_drv_init()=0, ret=0, t1={3:0}, t2={4:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1736] 0 struct my_data data; VAL [data={6:0}, my_dev={0:0}, ret=0, t1={3:0}, t2={4:0}] [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 VAL [data={6:0}, data={6:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1706] 0 data->shared.b = 0 VAL [data={6:0}, data={6:0}, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] EXPR 0 data->shared.a VAL [data={6:0}, data={6:0}, data->shared.a=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b VAL [data={6:0}, data={6:0}, data->shared.b=0, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, my_dev={0:0}, t1={3:0}, t2={4:0}] [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, data={6:0}, data={6:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [data={6:0}, data={6:0}, my_dev={0:0}, res=0, t1={3:0}, t2={4:0}] [L1712] 0 my_dev = &data->dev VAL [data={6:0}, data={6:0}, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=-2, res=0, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=-1, res=0, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 2 data->shared.b = lb + 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1699] 1 data->shared.b = lb + 1 VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result={0:0}, \result=0, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, res=0, t1={3:0}, t2={4:0}] [L1737] RET, EXPR 0 my_drv_probe(&data) [L1737] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1722] 0 \read(t1) VAL [\read(t1)=-2, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=-2, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, pthread_join(t1, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=-1, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, pthread_join(t2, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data.shared.a=1, lb=0, my_dev={6:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, expression=1, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1740] RET 0 ldv_assert(data.shared.a==1) [L1741] EXPR 0 data.shared.b VAL [\result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data.shared.b=1, lb=0, my_dev={6:24}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1741] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.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: 6, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.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: 9, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 191 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, 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: 19, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 3.6s, 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: 67, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 488 NumberOfCodeBlocks, 488 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 484 ConstructedInterpolants, 0 QuantifiedInterpolants, 4277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 9.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 120, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 651 NumberOfCodeBlocks, 651 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 518 ConstructedInterpolants, 0 QuantifiedInterpolants, 8870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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! [2022-10-10 11:40:02,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2022-10-10 11:40:03,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2022-10-10 11:40:03,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Ended with exit code 0 [2022-10-10 11:40:03,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2022-10-10 11:40:03,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2022-10-10 11:40:03,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2022-10-10 11:40:04,086 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...