/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.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 12:01:25,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-10 12:01:25,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-10 12:01:25,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-10 12:01:25,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-10 12:01:25,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-10 12:01:25,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-10 12:01:25,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-10 12:01:25,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-10 12:01:25,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-10 12:01:25,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-10 12:01:25,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-10 12:01:25,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-10 12:01:25,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-10 12:01:25,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-10 12:01:25,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-10 12:01:25,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-10 12:01:25,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-10 12:01:25,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-10 12:01:25,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-10 12:01:25,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-10 12:01:25,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-10 12:01:25,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-10 12:01:25,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-10 12:01:25,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-10 12:01:25,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-10 12:01:25,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-10 12:01:25,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-10 12:01:25,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-10 12:01:25,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-10 12:01:25,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-10 12:01:25,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-10 12:01:25,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-10 12:01:25,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-10 12:01:25,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-10 12:01:25,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-10 12:01:25,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-10 12:01:25,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-10 12:01:25,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-10 12:01:25,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-10 12:01:25,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-10 12:01:25,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2022-10-10 12:01:25,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-10 12:01:25,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-10 12:01:25,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-10 12:01:25,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-10 12:01:25,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-10 12:01:25,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-10 12:01:25,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-10 12:01:25,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-10 12:01:25,997 INFO L138 SettingsManager]: * Use SBE=true [2022-10-10 12:01:25,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-10 12:01:25,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-10 12:01:25,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-10 12:01:25,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-10 12:01:25,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-10 12:01:25,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-10 12:01:25,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-10 12:01:25,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-10 12:01:25,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-10 12:01:25,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-10 12:01:25,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-10 12:01:26,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-10 12:01:26,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-10 12:01:26,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-10 12:01:26,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-10 12:01:26,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-10 12:01:26,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-10 12:01:26,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-10 12:01:26,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-10 12:01:26,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-10 12:01:26,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-10 12:01:26,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-10 12:01:26,001 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-10 12:01:26,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-10 12:01:26,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-10 12:01:26,002 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-10 12:01:26,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 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 12:01:26,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-10 12:01:26,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-10 12:01:26,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-10 12:01:26,363 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-10 12:01:26,363 INFO L275 PluginConnector]: CDTParser initialized [2022-10-10 12:01:26,365 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 12:01:26,418 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2335d12/295514ada0e945fe8e55c7cc380437c3/FLAG783d4cd1f [2022-10-10 12:01:27,036 INFO L306 CDTParser]: Found 1 translation units. [2022-10-10 12:01:27,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2022-10-10 12:01:27,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2335d12/295514ada0e945fe8e55c7cc380437c3/FLAG783d4cd1f [2022-10-10 12:01:27,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2335d12/295514ada0e945fe8e55c7cc380437c3 [2022-10-10 12:01:27,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-10 12:01:27,430 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-10 12:01:27,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-10 12:01:27,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-10 12:01:27,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-10 12:01:27,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 12:01:27" (1/1) ... [2022-10-10 12:01:27,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5456b442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:27, skipping insertion in model container [2022-10-10 12:01:27,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 12:01:27" (1/1) ... [2022-10-10 12:01:27,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-10 12:01:27,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-10 12:01:27,628 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-10-10 12:01:28,205 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 12:01:28,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-10 12:01:28,269 INFO L203 MainTranslator]: Completed pre-run [2022-10-10 12:01:28,280 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-10-10 12:01:28,314 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 12:01:28,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-10 12:01:28,472 INFO L208 MainTranslator]: Completed translation [2022-10-10 12:01:28,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28 WrapperNode [2022-10-10 12:01:28,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-10 12:01:28,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-10 12:01:28,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-10 12:01:28,474 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-10 12:01:28,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,566 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-10-10 12:01:28,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-10 12:01:28,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-10 12:01:28,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-10 12:01:28,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-10 12:01:28,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-10 12:01:28,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-10 12:01:28,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-10 12:01:28,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-10 12:01:28,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (1/1) ... [2022-10-10 12:01:28,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-10 12:01:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:01:28,669 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 12:01:28,691 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 12:01:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-10 12:01:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-10 12:01:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-10 12:01:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-10 12:01:28,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-10 12:01:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-10 12:01:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-10 12:01:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-10 12:01:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-10-10 12:01:28,709 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-10-10 12:01:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-10 12:01:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-10 12:01:28,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-10 12:01:28,711 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 12:01:29,028 INFO L234 CfgBuilder]: Building ICFG [2022-10-10 12:01:29,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-10 12:01:29,267 INFO L275 CfgBuilder]: Performing block encoding [2022-10-10 12:01:29,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-10 12:01:29,287 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-10 12:01:29,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 12:01:29 BoogieIcfgContainer [2022-10-10 12:01:29,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-10 12:01:29,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-10 12:01:29,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-10 12:01:29,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-10 12:01:29,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 12:01:27" (1/3) ... [2022-10-10 12:01:29,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6864fc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 12:01:29, skipping insertion in model container [2022-10-10 12:01:29,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 12:01:28" (2/3) ... [2022-10-10 12:01:29,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6864fc32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 12:01:29, skipping insertion in model container [2022-10-10 12:01:29,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 12:01:29" (3/3) ... [2022-10-10 12:01:29,298 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2022-10-10 12:01:29,308 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-10 12:01:29,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-10 12:01:29,317 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-10 12:01:29,318 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-10 12:01:29,386 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-10-10 12:01:29,434 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:29,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 12:01:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:01:29,438 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 12:01:29,444 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 12:01:29,474 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 12:01:29,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 12:01:29,487 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;@249e826c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:29,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 12:01:29,517 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:29,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash -34102460, now seen corresponding path program 1 times [2022-10-10 12:01:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243603501] [2022-10-10 12:01:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:30,018 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 12:01:30,020 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:30,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243603501] [2022-10-10 12:01:30,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243603501] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:30,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:30,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 12:01:30,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565161838] [2022-10-10 12:01:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:30,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 12:01:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:30,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 12:01:30,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 12:01:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,065 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:30,069 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 12:01:30,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-10 12:01:30,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 12:01:30,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-10 12:01:30,149 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-10-10 12:01:30,152 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8) [2022-10-10 12:01:30,159 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 12:01:30,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:01:30,161 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 12:01:30,163 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 12:01:30,166 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 12:01:30,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 12:01:30,167 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;@249e826c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:30,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 12:01:30,178 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:30,179 INFO L85 PathProgramCache]: Analyzing trace with hash 824109101, now seen corresponding path program 1 times [2022-10-10 12:01:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:30,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348701321] [2022-10-10 12:01:30,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:30,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 12:01:30,263 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:30,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348701321] [2022-10-10 12:01:30,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348701321] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:30,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:30,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 12:01:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923430708] [2022-10-10 12:01:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:30,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 12:01:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 12:01:30,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 12:01:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,265 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:30,266 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 12:01:30,266 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-10 12:01:30,274 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash -888642596, now seen corresponding path program 1 times [2022-10-10 12:01:30,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:30,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183611027] [2022-10-10 12:01:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:30,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:30,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:30,490 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 12:01:30,491 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:30,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183611027] [2022-10-10 12:01:30,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183611027] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:30,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:30,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 12:01:30,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111601931] [2022-10-10 12:01:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:30,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 12:01:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:30,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 12:01:30,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 12:01:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,494 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:30,494 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 12:01:30,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-10 12:01:30,597 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 12:01:30,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-10 12:01:30,602 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-10-10 12:01:30,603 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/8) [2022-10-10 12:01:30,615 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:30,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 12:01:30,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:01:30,617 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 12:01:30,619 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 12:01:30,622 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 12:01:30,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 12:01:30,623 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;@249e826c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:30,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 12:01:30,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1983115351, now seen corresponding path program 1 times [2022-10-10 12:01:30,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:30,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713942987] [2022-10-10 12:01:30,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:30,747 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 12:01:30,748 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:30,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713942987] [2022-10-10 12:01:30,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713942987] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:30,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:30,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 12:01:30,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86414062] [2022-10-10 12:01:30,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:30,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 12:01:30,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:30,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 12:01:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 12:01:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:30,751 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 12:01:30,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-10 12:01:30,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:30,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:30,763 INFO L85 PathProgramCache]: Analyzing trace with hash -170107804, now seen corresponding path program 1 times [2022-10-10 12:01:30,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:30,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427225019] [2022-10-10 12:01:30,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:30,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 12:01:30,967 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:30,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427225019] [2022-10-10 12:01:30,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427225019] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:30,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:30,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 12:01:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112436444] [2022-10-10 12:01:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:30,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 12:01:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 12:01:30,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 12:01:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:30,973 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 12:01:30,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:30,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-10 12:01:37,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-10 12:01:37,380 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:37,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:37,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1198635144, now seen corresponding path program 1 times [2022-10-10 12:01:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:37,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846384352] [2022-10-10 12:01:37,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:37,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:37,554 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 12:01:37,555 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:37,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846384352] [2022-10-10 12:01:37,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846384352] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:37,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:37,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-10 12:01:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508963094] [2022-10-10 12:01:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:37,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-10 12:01:37,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:37,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-10 12:01:37,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-10 12:01:37,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:37,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:37,564 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 12:01:37,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:37,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-10-10 12:01:37,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-10 12:01:49,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-10 12:01:49,380 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 12:01:49,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-10 12:01:49,381 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-10-10 12:01:49,381 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/8) [2022-10-10 12:01:49,385 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:49,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 12:01:49,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:01:49,387 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 12:01:49,388 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 12:01:49,394 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 12:01:49,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 12:01:49,395 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;@249e826c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:01:49,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 12:01:49,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:49,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1121045935, now seen corresponding path program 1 times [2022-10-10 12:01:49,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:49,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903412515] [2022-10-10 12:01:49,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:49,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:49,447 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 12:01:49,448 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:49,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903412515] [2022-10-10 12:01:49,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903412515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:49,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:49,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 12:01:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986833931] [2022-10-10 12:01:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:49,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 12:01:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 12:01:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 12:01:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:49,450 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 12:01:49,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-10 12:01:49,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 896697388, now seen corresponding path program 1 times [2022-10-10 12:01:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713627523] [2022-10-10 12:01:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:49,601 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 12:01:49,601 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713627523] [2022-10-10 12:01:49,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713627523] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:49,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:49,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-10 12:01:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025082217] [2022-10-10 12:01:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:49,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-10 12:01:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-10 12:01:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-10 12:01:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:49,604 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 12:01:49,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:49,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-10 12:01:53,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-10 12:01:53,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:01:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:01:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -972519732, now seen corresponding path program 1 times [2022-10-10 12:01:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:01:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961514991] [2022-10-10 12:01:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:01:53,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:01:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:01:53,834 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 12:01:53,835 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:01:53,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961514991] [2022-10-10 12:01:53,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961514991] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:01:53,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:01:53,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-10 12:01:53,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81987166] [2022-10-10 12:01:53,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:01:53,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-10 12:01:53,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:01:53,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-10 12:01:53,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-10 12:01:53,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:53,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:01:53,837 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 12:01:53,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:01:53,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-10-10 12:01:53,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-10 12:02:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-10 12:02:06,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 12:02:06,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-10 12:02:06,100 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-10-10 12:02:06,101 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/8) [2022-10-10 12:02:06,103 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:02:06,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 12:02:06,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:02:06,105 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 12:02:06,107 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 12:02:06,113 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 12:02:06,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 12:02:06,114 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;@249e826c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:02:06,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 12:02:06,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:02:06,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:02:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash 318555048, now seen corresponding path program 1 times [2022-10-10 12:02:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:02:06,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847475915] [2022-10-10 12:02:06,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:02:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:02:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:02:06,171 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 12:02:06,171 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:02:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847475915] [2022-10-10 12:02:06,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847475915] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:02:06,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:02:06,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 12:02:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222294369] [2022-10-10 12:02:06,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:02:06,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 12:02:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:02:06,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 12:02:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 12:02:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,173 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:02:06,173 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 12:02:06,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-10 12:02:06,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:02:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:02:06,184 INFO L85 PathProgramCache]: Analyzing trace with hash -112432435, now seen corresponding path program 1 times [2022-10-10 12:02:06,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:02:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977790492] [2022-10-10 12:02:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:02:06,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:02:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:02:06,770 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 12:02:06,770 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:02:06,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977790492] [2022-10-10 12:02:06,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977790492] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:02:06,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:02:06,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-10-10 12:02:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743964507] [2022-10-10 12:02:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:02:06,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-10 12:02:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:02:06,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-10 12:02:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-10-10 12:02:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:02:06,779 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 12:02:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:06,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:12,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-10 12:02:12,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-10 12:02:12,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:02:12,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:02:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1724617323, now seen corresponding path program 2 times [2022-10-10 12:02:12,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:02:12,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843078237] [2022-10-10 12:02:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:02:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:02:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:02:12,779 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 12:02:12,779 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:02:12,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843078237] [2022-10-10 12:02:12,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843078237] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:02:12,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:02:12,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-10-10 12:02:12,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941434175] [2022-10-10 12:02:12,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:02:12,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-10 12:02:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:02:12,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-10 12:02:12,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-10-10 12:02:12,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:12,781 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:02:12,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5625) internal successors, (121), 16 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 12:02:12,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:12,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-10-10 12:02:12,782 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-10 12:02:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-10 12:02:29,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-10 12:02:29,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:02:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:02:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash 752296937, now seen corresponding path program 3 times [2022-10-10 12:02:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:02:29,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793497759] [2022-10-10 12:02:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:02:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:02:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:02:29,773 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 12:02:29,774 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:02:29,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793497759] [2022-10-10 12:02:29,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793497759] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:02:29,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:02:29,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-10-10 12:02:29,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557249812] [2022-10-10 12:02:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:02:29,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-10 12:02:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:02:29,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-10 12:02:29,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-10-10 12:02:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:29,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:02:29,776 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 12:02:29,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:02:29,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-10 12:02:29,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-10 12:02:29,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:03:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:03:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-10 12:03:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-10 12:03:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-10 12:03:09,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-10 12:03:09,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:03:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:03:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1484521621, now seen corresponding path program 4 times [2022-10-10 12:03:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:03:09,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540252183] [2022-10-10 12:03:09,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:03:09,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:03:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:03:09,784 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 12:03:09,784 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:03:09,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540252183] [2022-10-10 12:03:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540252183] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:03:09,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:03:09,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-10-10 12:03:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413994240] [2022-10-10 12:03:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:03:09,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-10 12:03:09,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:03:09,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-10 12:03:09,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-10-10 12:03:09,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:03:09,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:03:09,787 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 12:03:09,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:03:09,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-10-10 12:03:09,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-10-10 12:03:09,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-10-10 12:03:09,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-10 12:06:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-10 12:06:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-10 12:06:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-10 12:06:25,964 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 12:06:25,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-10 12:06:25,965 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2022-10-10 12:06:25,965 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/8) [2022-10-10 12:06:25,968 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:06:25,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-10 12:06:25,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-10 12:06:26,001 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 12:06:26,002 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 12:06:26,009 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-10 12:06:26,010 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-10-10 12:06:26,010 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;@249e826c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-10 12:06:26,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-10 12:06:26,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:06:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:06:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash 806851193, now seen corresponding path program 1 times [2022-10-10 12:06:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:06:26,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511779453] [2022-10-10 12:06:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:06:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:06:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:06:26,061 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 12:06:26,062 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:06:26,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511779453] [2022-10-10 12:06:26,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511779453] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:06:26,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:06:26,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-10 12:06:26,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464812230] [2022-10-10 12:06:26,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:06:26,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-10 12:06:26,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:06:26,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-10 12:06:26,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-10 12:06:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:26,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:06:26,064 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 12:06:26,064 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:26,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-10 12:06:26,073 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:06:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:06:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1999905453, now seen corresponding path program 1 times [2022-10-10 12:06:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:06:26,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597696642] [2022-10-10 12:06:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:06:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:06:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:06:27,099 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 12:06:27,099 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:06:27,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597696642] [2022-10-10 12:06:27,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597696642] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:06:27,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:06:27,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-10-10 12:06:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448965127] [2022-10-10 12:06:27,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:06:27,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-10 12:06:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:06:27,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-10 12:06:27,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2022-10-10 12:06:27,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:27,101 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:06:27,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.16) internal successors, (129), 25 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 12:06:27,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:27,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-10 12:06:31,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-10 12:06:31,911 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:06:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:06:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1164222767, now seen corresponding path program 2 times [2022-10-10 12:06:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:06:31,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121562960] [2022-10-10 12:06:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:06:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:06:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:06:32,930 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 12:06:32,930 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:06:32,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121562960] [2022-10-10 12:06:32,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121562960] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:06:32,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:06:32,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-10-10 12:06:32,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241244440] [2022-10-10 12:06:32,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:06:32,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-10-10 12:06:32,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:06:32,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-10-10 12:06:32,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2022-10-10 12:06:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:32,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:06:32,933 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 12:06:32,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:32,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-10-10 12:06:32,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-10-10 12:06:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-10-10 12:06:39,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-10 12:06:39,325 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:06:39,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:06:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash 601744911, now seen corresponding path program 3 times [2022-10-10 12:06:39,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:06:39,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226830006] [2022-10-10 12:06:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:06:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:06:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-10 12:06:40,463 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 12:06:40,464 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-10 12:06:40,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226830006] [2022-10-10 12:06:40,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226830006] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-10 12:06:40,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-10 12:06:40,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-10-10 12:06:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463955856] [2022-10-10 12:06:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-10 12:06:40,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-10 12:06:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-10 12:06:40,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-10 12:06:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2022-10-10 12:06:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:40,466 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-10 12:06:40,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.161290322580645) internal successors, (129), 31 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 12:06:40,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:40,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-10-10 12:06:40,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-10-10 12:06:40,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-10 12:06:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-10 12:06:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-10-10 12:06:59,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-10 12:06:59,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-10 12:06:59,868 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-10 12:06:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-10 12:06:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1040824943, now seen corresponding path program 4 times [2022-10-10 12:06:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-10 12:06:59,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678160480] [2022-10-10 12:06:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-10 12:06:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-10 12:06:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-10 12:06:59,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-10 12:07:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-10 12:07:00,079 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-10-10 12:07:00,079 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-10 12:07:00,079 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-10 12:07:00,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-10 12:07:00,081 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2022-10-10 12:07:00,082 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (6/8) [2022-10-10 12:07:00,085 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-10 12:07:00,085 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-10 12:07:00,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 12:07:00 BasicIcfg [2022-10-10 12:07:00,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-10 12:07:00,196 INFO L158 Benchmark]: Toolchain (without parser) took 332766.35ms. Allocated memory was 190.8MB in the beginning and 257.9MB in the end (delta: 67.1MB). Free memory was 172.1MB in the beginning and 145.8MB in the end (delta: 26.4MB). Peak memory consumption was 199.7MB. Max. memory is 8.0GB. [2022-10-10 12:07:00,196 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 190.8MB. Free memory was 170.3MB in the beginning and 170.2MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-10 12:07:00,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1041.62ms. Allocated memory is still 190.8MB. Free memory was 172.1MB in the beginning and 150.2MB in the end (delta: 22.0MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. [2022-10-10 12:07:00,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.46ms. Allocated memory is still 190.8MB. Free memory was 150.2MB in the beginning and 147.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-10 12:07:00,197 INFO L158 Benchmark]: Boogie Preprocessor took 63.80ms. Allocated memory is still 190.8MB. Free memory was 147.0MB in the beginning and 144.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-10 12:07:00,197 INFO L158 Benchmark]: RCFGBuilder took 658.40ms. Allocated memory is still 190.8MB. Free memory was 144.4MB in the beginning and 121.8MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-10-10 12:07:00,198 INFO L158 Benchmark]: TraceAbstraction took 330903.13ms. Allocated memory was 190.8MB in the beginning and 257.9MB in the end (delta: 67.1MB). Free memory was 121.3MB in the beginning and 145.8MB in the end (delta: -24.5MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2022-10-10 12:07:00,199 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.19ms. Allocated memory is still 190.8MB. Free memory was 170.3MB in the beginning and 170.2MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1041.62ms. Allocated memory is still 190.8MB. Free memory was 172.1MB in the beginning and 150.2MB in the end (delta: 22.0MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 93.46ms. Allocated memory is still 190.8MB. Free memory was 150.2MB in the beginning and 147.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.80ms. Allocated memory is still 190.8MB. Free memory was 147.0MB in the beginning and 144.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 658.40ms. Allocated memory is still 190.8MB. Free memory was 144.4MB in the beginning and 121.8MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 330903.13ms. Allocated memory was 190.8MB in the beginning and 257.9MB in the end (delta: 67.1MB). Free memory was 121.3MB in the beginning and 145.8MB in the end (delta: -24.5MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Independence relation #1 benchmarks 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: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.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: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 3 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3490, positive: 3281, positive conditional: 3281, positive unconditional: 0, negative: 209, negative conditional: 209, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3355, positive: 3281, positive conditional: 3281, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3355, positive: 3281, positive conditional: 3281, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3486, positive: 3281, positive conditional: 0, positive unconditional: 3281, negative: 205, negative conditional: 131, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3486, positive: 3281, positive conditional: 0, positive unconditional: 3281, negative: 205, negative conditional: 1, negative unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3486, positive: 3281, positive conditional: 0, positive unconditional: 3281, negative: 205, negative conditional: 1, negative unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 567, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 27, negative conditional: 1, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 567, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 13, unknown conditional: 1, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17672, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 528, negative conditional: 0, negative unconditional: 528, unknown: 17144, unknown conditional: 2078, unknown unconditional: 15065] ], Cache Queries: [ total: 3486, positive: 2741, positive conditional: 0, positive unconditional: 2741, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 567, unknown conditional: 1, unknown unconditional: 566] , Statistics on independence cache: Total cache size (in pairs): 567, Positive cache size: 540, Positive conditional cache size: 0, Positive unconditional cache size: 540, Negative cache size: 27, Negative conditional cache size: 1, Negative unconditional cache size: 26, Eliminated conditions: 130, Maximal queried relation: 2, Independence queries for same thread: 135 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3500, positive: 3283, positive conditional: 3283, positive unconditional: 0, negative: 217, negative conditional: 217, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3358, positive: 3283, positive conditional: 3283, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3358, positive: 3283, positive conditional: 3283, positive unconditional: 0, negative: 75, negative conditional: 75, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3490, positive: 3283, positive conditional: 0, positive unconditional: 3283, negative: 207, negative conditional: 132, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3490, positive: 3283, positive conditional: 0, positive unconditional: 3283, negative: 207, negative conditional: 1, negative unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3490, positive: 3283, positive conditional: 0, positive unconditional: 3283, negative: 207, negative conditional: 1, negative unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 568, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 28, negative conditional: 1, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 568, positive: 540, positive conditional: 0, positive unconditional: 540, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16061, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 530, negative conditional: 16, negative unconditional: 514, unknown: 15531, unknown conditional: 0, unknown unconditional: 15531] ], Cache Queries: [ total: 3490, positive: 2743, positive conditional: 0, positive unconditional: 2743, negative: 179, negative conditional: 0, negative unconditional: 179, unknown: 568, unknown conditional: 1, unknown unconditional: 567] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 540, Positive conditional cache size: 0, Positive unconditional cache size: 540, Negative cache size: 28, Negative conditional cache size: 1, Negative unconditional cache size: 27, Eliminated conditions: 131, Maximal queried relation: 2, Independence queries for same thread: 142 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 22173, positive: 20392, positive conditional: 20392, positive unconditional: 0, negative: 1781, negative conditional: 1781, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20890, positive: 20392, positive conditional: 20392, positive unconditional: 0, negative: 498, negative conditional: 498, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20890, positive: 20392, positive conditional: 20392, positive unconditional: 0, negative: 498, negative conditional: 498, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22971, positive: 20392, positive conditional: 212, positive unconditional: 20180, negative: 2579, negative conditional: 1869, negative unconditional: 710, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22971, positive: 20392, positive conditional: 212, positive unconditional: 20180, negative: 2579, negative conditional: 1821, negative unconditional: 758, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22971, positive: 20392, positive conditional: 212, positive unconditional: 20180, negative: 2579, negative conditional: 1821, negative unconditional: 758, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1462, positive: 1080, positive conditional: 45, positive unconditional: 1035, negative: 382, negative conditional: 338, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1462, positive: 1035, positive conditional: 0, positive unconditional: 1035, negative: 427, negative conditional: 0, negative unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 427, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 222, negative conditional: 196, negative unconditional: 26, unknown: 160, unknown conditional: 142, unknown unconditional: 18] , SemanticIndependenceRelation.Query Time [ms]: [ total: 252442, positive: 2133, positive conditional: 2133, positive unconditional: 0, negative: 2079, negative conditional: 1591, negative unconditional: 487, unknown: 248230, unknown conditional: 222101, unknown unconditional: 26128] ], Cache Queries: [ total: 22971, positive: 19312, positive conditional: 167, positive unconditional: 19145, negative: 2197, negative conditional: 1483, negative unconditional: 714, unknown: 1462, unknown conditional: 383, unknown unconditional: 1079] , Statistics on independence cache: Total cache size (in pairs): 1462, Positive cache size: 1080, Positive conditional cache size: 45, Positive unconditional cache size: 1035, Negative cache size: 382, Negative conditional cache size: 338, Negative unconditional cache size: 44, Eliminated conditions: 48, Maximal queried relation: 4, Independence queries for same thread: 1283 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3894, positive: 3548, positive conditional: 3548, positive unconditional: 0, negative: 346, negative conditional: 346, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3585, positive: 3548, positive conditional: 3548, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3585, positive: 3548, positive conditional: 3548, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3724, positive: 3548, positive conditional: 30, positive unconditional: 3518, negative: 176, negative conditional: 109, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3724, positive: 3548, positive conditional: 30, positive unconditional: 3518, negative: 176, negative conditional: 109, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3724, positive: 3548, positive conditional: 30, positive unconditional: 3518, negative: 176, negative conditional: 109, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 677, positive: 621, positive conditional: 17, positive unconditional: 604, negative: 56, negative conditional: 35, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 677, positive: 604, positive conditional: 0, positive unconditional: 604, negative: 73, negative conditional: 0, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 73, positive: 17, positive conditional: 17, positive unconditional: 0, negative: 34, negative conditional: 22, negative unconditional: 12, unknown: 22, unknown conditional: 13, unknown unconditional: 9] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22464, positive: 888, positive conditional: 888, positive unconditional: 0, negative: 143, negative conditional: 48, negative unconditional: 95, unknown: 21433, unknown conditional: 10026, unknown unconditional: 11407] ], Cache Queries: [ total: 3724, positive: 2927, positive conditional: 13, positive unconditional: 2914, negative: 120, negative conditional: 74, negative unconditional: 46, unknown: 677, unknown conditional: 52, unknown unconditional: 625] , Statistics on independence cache: Total cache size (in pairs): 677, Positive cache size: 621, Positive conditional cache size: 17, Positive unconditional cache size: 604, Negative cache size: 56, Negative conditional cache size: 35, Negative unconditional cache size: 21, Eliminated conditions: 0, Maximal queried relation: 3, Independence queries for same thread: 309 - 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: 18.8s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 18.3s, 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.1s 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: 16.7s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.4s, 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.1s 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: 259.9s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 257.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: 98, 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.9s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 604 ConstructedInterpolants, 0 QuantifiedInterpolants, 6034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 34.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 30.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: 110, 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, 2.9s InterpolantComputationTime, 651 NumberOfCodeBlocks, 651 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 518 ConstructedInterpolants, 0 QuantifiedInterpolants, 8991 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 12:07:00,313 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 12:07:00,626 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forcibly destroying the process [2022-10-10 12:07:00,659 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 137 [2022-10-10 12:07:00,709 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 12:07:00,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-10-10 12:07:01,074 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 12:07:01,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-10 12:07:01,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...