/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-99e0210 [2023-03-23 19:12:43,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-23 19:12:43,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-23 19:12:43,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-23 19:12:43,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-23 19:12:43,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-23 19:12:43,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-23 19:12:43,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-23 19:12:43,737 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-23 19:12:43,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-23 19:12:43,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-23 19:12:43,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-23 19:12:43,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-23 19:12:43,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-23 19:12:43,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-23 19:12:43,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-23 19:12:43,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-23 19:12:43,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-23 19:12:43,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-23 19:12:43,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-23 19:12:43,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-23 19:12:43,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-23 19:12:43,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-23 19:12:43,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-23 19:12:43,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-23 19:12:43,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-23 19:12:43,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-23 19:12:43,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-23 19:12:43,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-23 19:12:43,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-23 19:12:43,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-23 19:12:43,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-23 19:12:43,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-23 19:12:43,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-23 19:12:43,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-23 19:12:43,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-23 19:12:43,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-23 19:12:43,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-23 19:12:43,768 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-23 19:12:43,769 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-23 19:12:43,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-23 19:12:43,770 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-03-23 19:12:43,791 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-23 19:12:43,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-23 19:12:43,791 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-23 19:12:43,791 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-23 19:12:43,792 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-23 19:12:43,792 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-23 19:12:43,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-23 19:12:43,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-23 19:12:43,793 INFO L138 SettingsManager]: * Use SBE=true [2023-03-23 19:12:43,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-23 19:12:43,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-23 19:12:43,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 19:12:43,795 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-23 19:12:43,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-03-23 19:12:43,796 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-03-23 19:12:43,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-23 19:12:43,796 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-03-23 19:12:43,796 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-03-23 19:12:43,796 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 [2023-03-23 19:12:43,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-23 19:12:44,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-23 19:12:44,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-23 19:12:44,013 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-23 19:12:44,028 INFO L275 PluginConnector]: CDTParser initialized [2023-03-23 19:12:44,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-03-23 19:12:45,047 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-23 19:12:45,252 INFO L351 CDTParser]: Found 1 translation units. [2023-03-23 19:12:45,253 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-03-23 19:12:45,270 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed3a53fc/11eee67fee574322b62605cc06904e9c/FLAGb2a758b21 [2023-03-23 19:12:45,280 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed3a53fc/11eee67fee574322b62605cc06904e9c [2023-03-23 19:12:45,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-23 19:12:45,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-03-23 19:12:45,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-23 19:12:45,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-23 19:12:45,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-23 19:12:45,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12637de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45, skipping insertion in model container [2023-03-23 19:12:45,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-23 19:12:45,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-23 19:12:45,671 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-03-23 19:12:45,679 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-03-23 19:12:45,684 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-03-23 19:12:45,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 19:12:45,704 INFO L203 MainTranslator]: Completed pre-run [2023-03-23 19:12:45,733 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-03-23 19:12:45,734 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-03-23 19:12:45,736 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-03-23 19:12:45,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-23 19:12:45,776 INFO L208 MainTranslator]: Completed translation [2023-03-23 19:12:45,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45 WrapperNode [2023-03-23 19:12:45,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-23 19:12:45,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-03-23 19:12:45,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-03-23 19:12:45,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-03-23 19:12:45,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,839 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-03-23 19:12:45,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-03-23 19:12:45,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-23 19:12:45,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-23 19:12:45,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-23 19:12:45,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,875 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-23 19:12:45,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-23 19:12:45,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-23 19:12:45,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-23 19:12:45,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (1/1) ... [2023-03-23 19:12:45,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-23 19:12:45,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:12:45,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-03-23 19:12:45,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-03-23 19:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-03-23 19:12:45,953 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-03-23 19:12:45,953 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-03-23 19:12:45,953 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-23 19:12:45,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-23 19:12:45,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-23 19:12:45,955 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-03-23 19:12:46,095 INFO L236 CfgBuilder]: Building ICFG [2023-03-23 19:12:46,097 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-23 19:12:46,341 INFO L277 CfgBuilder]: Performing block encoding [2023-03-23 19:12:46,348 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-23 19:12:46,348 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-03-23 19:12:46,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 07:12:46 BoogieIcfgContainer [2023-03-23 19:12:46,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-23 19:12:46,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-23 19:12:46,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-23 19:12:46,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-23 19:12:46,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 07:12:45" (1/3) ... [2023-03-23 19:12:46,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740ca590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 07:12:46, skipping insertion in model container [2023-03-23 19:12:46,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 07:12:45" (2/3) ... [2023-03-23 19:12:46,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740ca590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 07:12:46, skipping insertion in model container [2023-03-23 19:12:46,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 07:12:46" (3/3) ... [2023-03-23 19:12:46,355 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-03-23 19:12:46,360 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-03-23 19:12:46,367 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-23 19:12:46,367 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-03-23 19:12:46,367 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-03-23 19:12:46,439 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-03-23 19:12:46,471 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:12:46,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 19:12:46,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:12:46,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-03-23 19:12:46,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-03-23 19:12:46,506 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 19:12:46,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-03-23 19:12:46,519 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;@762319f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:12:46,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-23 19:12:46,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:46,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1212293680, now seen corresponding path program 1 times [2023-03-23 19:12:46,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150200171] [2023-03-23 19:12:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150200171] [2023-03-23 19:12:46,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150200171] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:46,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:46,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 19:12:46,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12146395] [2023-03-23 19:12:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:46,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 19:12:46,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 19:12:46,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 19:12:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:46,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:46,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:46,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:46,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-23 19:12:46,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:46,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash -361290882, now seen corresponding path program 1 times [2023-03-23 19:12:46,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:46,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260507453] [2023-03-23 19:12:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:46,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:47,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:47,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260507453] [2023-03-23 19:12:47,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260507453] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:47,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:47,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-23 19:12:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025017947] [2023-03-23 19:12:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:47,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 19:12:47,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:47,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 19:12:47,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-23 19:12:47,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:47,185 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:47,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:47,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:47,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:47,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:47,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-23 19:12:47,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:47,276 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash -629692782, now seen corresponding path program 1 times [2023-03-23 19:12:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942324753] [2023-03-23 19:12:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:48,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:48,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942324753] [2023-03-23 19:12:48,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942324753] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:48,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:48,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-03-23 19:12:48,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023776182] [2023-03-23 19:12:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:48,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-23 19:12:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-23 19:12:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-03-23 19:12:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:48,596 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:48,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:48,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:48,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:48,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:49,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:49,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-23 19:12:49,066 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:49,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -753887752, now seen corresponding path program 1 times [2023-03-23 19:12:49,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:49,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534866799] [2023-03-23 19:12:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:49,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:51,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534866799] [2023-03-23 19:12:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534866799] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-03-23 19:12:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315405976] [2023-03-23 19:12:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:51,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-03-23 19:12:51,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-03-23 19:12:51,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2023-03-23 19:12:51,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:51,145 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:51,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:51,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:51,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:51,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:51,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:52,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-03-23 19:12:52,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-23 19:12:52,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:52,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 551029371, now seen corresponding path program 1 times [2023-03-23 19:12:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:52,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434387304] [2023-03-23 19:12:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:52,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434387304] [2023-03-23 19:12:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434387304] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:52,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-23 19:12:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514018985] [2023-03-23 19:12:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:52,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 19:12:52,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:52,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 19:12:52,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-23 19:12:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:52,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:52,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:52,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:52,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:52,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:52,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-03-23 19:12:52,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:52,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:52,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-23 19:12:52,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:52,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash 111487193, now seen corresponding path program 1 times [2023-03-23 19:12:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67849449] [2023-03-23 19:12:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67849449] [2023-03-23 19:12:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67849449] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:55,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-03-23 19:12:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180179699] [2023-03-23 19:12:55,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:55,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-03-23 19:12:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-03-23 19:12:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2023-03-23 19:12:55,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:55,207 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:55,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:55,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:55,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:55,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:55,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:55,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:57,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:12:57,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-23 19:12:57,590 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:57,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:57,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1070179036, now seen corresponding path program 1 times [2023-03-23 19:12:57,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:57,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967941100] [2023-03-23 19:12:57,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:57,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:57,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:57,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967941100] [2023-03-23 19:12:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967941100] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:57,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:57,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:12:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559520771] [2023-03-23 19:12:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:57,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:12:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:12:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:12:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:57,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:57,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 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) [2023-03-23 19:12:57,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:57,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:57,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:57,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:57,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:57,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:12:57,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:12:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-03-23 19:12:58,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:58,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1519461850, now seen corresponding path program 1 times [2023-03-23 19:12:58,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27270981] [2023-03-23 19:12:58,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:58,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:58,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27270981] [2023-03-23 19:12:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27270981] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:12:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448296203] [2023-03-23 19:12:58,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:58,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:12:58,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:58,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:12:58,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:12:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:58,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:12:58,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:12:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-03-23 19:12:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-03-23 19:12:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-23 19:12:58,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-23 19:12:58,356 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-03-23 19:12:58,357 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-03-23 19:12:58,363 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:12:58,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 19:12:58,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:12:58,376 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) [2023-03-23 19:12:58,377 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 [2023-03-23 19:12:58,379 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 19:12:58,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-03-23 19:12:58,379 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;@762319f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:12:58,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-03-23 19:12:58,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-03-23 19:12:58,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1389819344, now seen corresponding path program 1 times [2023-03-23 19:12:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796695220] [2023-03-23 19:12:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796695220] [2023-03-23 19:12:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796695220] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:58,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 19:12:58,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786131392] [2023-03-23 19:12:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:58,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 19:12:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 19:12:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 19:12:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,393 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:58,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:58,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,516 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-03-23 19:12:58,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-03-23 19:12:58,517 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-03-23 19:12:58,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-23 19:12:58,518 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-03-23 19:12:58,518 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-03-23 19:12:58,520 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:12:58,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-03-23 19:12:58,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:12:58,522 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) [2023-03-23 19:12:58,536 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-03-23 19:12:58,536 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-03-23 19:12:58,536 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;@762319f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-03-23 19:12:58,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-03-23 19:12:58,537 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 [2023-03-23 19:12:58,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:58,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1177048018, now seen corresponding path program 1 times [2023-03-23 19:12:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979181184] [2023-03-23 19:12:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:58,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979181184] [2023-03-23 19:12:58,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979181184] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:58,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:58,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-03-23 19:12:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096800941] [2023-03-23 19:12:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-03-23 19:12:58,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:58,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-03-23 19:12:58,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-03-23 19:12:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:58,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:58,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-03-23 19:12:58,629 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:58,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash -397407360, now seen corresponding path program 1 times [2023-03-23 19:12:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508451629] [2023-03-23 19:12:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:58,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:58,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508451629] [2023-03-23 19:12:58,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508451629] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:58,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:12:58,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740634524] [2023-03-23 19:12:58,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:58,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:12:58,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:58,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:12:58,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:12:58,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:58,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-03-23 19:12:58,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:58,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1865440993, now seen corresponding path program 1 times [2023-03-23 19:12:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661236419] [2023-03-23 19:12:58,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-03-23 19:12:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661236419] [2023-03-23 19:12:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661236419] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-23 19:12:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676734762] [2023-03-23 19:12:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-23 19:12:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-23 19:12:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-23 19:12:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,821 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:58,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 4 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-03-23 19:12:58,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:58,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,844 INFO L85 PathProgramCache]: Analyzing trace with hash -107606974, now seen corresponding path program 1 times [2023-03-23 19:12:58,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88831939] [2023-03-23 19:12:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88831939] [2023-03-23 19:12:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88831939] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:58,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:58,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-23 19:12:58,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880609356] [2023-03-23 19:12:58,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:58,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-23 19:12:58,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:58,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-23 19:12:58,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-23 19:12:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,917 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:58,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:58,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-03-23 19:12:58,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:12:58,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:12:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash -114036003, now seen corresponding path program 1 times [2023-03-23 19:12:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:12:58,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408150590] [2023-03-23 19:12:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:12:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:12:58,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:12:59,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:12:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:12:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408150590] [2023-03-23 19:12:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408150590] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:12:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:12:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-03-23 19:12:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757926158] [2023-03-23 19:12:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:12:59,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-03-23 19:12:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:12:59,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-03-23 19:12:59,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-03-23 19:12:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:59,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:12:59,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.470588235294118) internal successors, (178), 17 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:12:59,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:12:59,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:59,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:12:59,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:12:59,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:00,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:00,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:00,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-03-23 19:13:00,052 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:13:00,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:13:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 474520386, now seen corresponding path program 1 times [2023-03-23 19:13:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:13:00,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134488072] [2023-03-23 19:13:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:00,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:13:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:13:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:13:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134488072] [2023-03-23 19:13:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134488072] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:13:02,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:13:02,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2023-03-23 19:13:02,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802461695] [2023-03-23 19:13:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:13:02,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-03-23 19:13:02,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:13:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-03-23 19:13:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2023-03-23 19:13:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:02,859 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:13:02,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.515151515151516) internal successors, (182), 33 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:13:02,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:02,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:02,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:02,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:02,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:02,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:03,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-03-23 19:13:03,082 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:13:03,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:13:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash 309063064, now seen corresponding path program 1 times [2023-03-23 19:13:03,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:13:03,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65891117] [2023-03-23 19:13:03,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:13:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-03-23 19:13:03,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:13:03,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65891117] [2023-03-23 19:13:03,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65891117] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:13:03,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:13:03,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-03-23 19:13:03,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775519358] [2023-03-23 19:13:03,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:13:03,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-23 19:13:03,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:13:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-23 19:13:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-03-23 19:13:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:03,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:13:03,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.5) internal successors, (189), 18 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:03,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:04,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:04,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-03-23 19:13:04,823 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:13:04,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:13:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 621167885, now seen corresponding path program 1 times [2023-03-23 19:13:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:13:04,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423857121] [2023-03-23 19:13:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:13:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:13:06,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:13:06,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423857121] [2023-03-23 19:13:06,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423857121] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:13:06,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122794255] [2023-03-23 19:13:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:06,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:13:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:13:06,060 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:13:06,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-23 19:13:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:06,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 85 conjunts are in the unsatisfiable core [2023-03-23 19:13:06,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:13:07,415 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-03-23 19:13:07,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2023-03-23 19:13:07,669 INFO L321 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2023-03-23 19:13:07,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 47 [2023-03-23 19:13:07,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-03-23 19:13:08,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:13:08,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-03-23 19:13:08,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:13:08,498 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-03-23 19:13:08,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 51 [2023-03-23 19:13:08,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:13:08,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-03-23 19:13:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:13:08,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:13:08,990 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or (< 0 |c_t2Thread1of1ForFork1_dequeue_~x~0#1|) (forall ((v_ArrVal_645 (Array Int Int))) (not (= 1 (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_645) |c_~#stored_elements~0.base|) .cse0))))) (forall ((v_ArrVal_645 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_645) |c_~#stored_elements~0.base|) .cse0)))))) is different from false [2023-03-23 19:13:10,644 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_#t~nondet55#1| Int) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_645 (Array Int Int)) (v_ArrVal_640 Int) (v_ArrVal_637 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse1 (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_#t~nondet55#1|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse1 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_637) .cse2 v_ArrVal_640)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_#t~nondet55#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_645) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0)) (not (= 800 (select .cse1 .cse2))) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2023-03-23 19:13:11,071 WARN L839 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_#t~nondet55#1| Int) (v_ArrVal_645 (Array Int Int)) (v_ArrVal_640 Int) (v_ArrVal_637 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_#t~nondet55#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_637) .cse1 v_ArrVal_640)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_#t~nondet55#1|))))) (or (not (= 800 (select .cse0 .cse1))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_645) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))) is different from false [2023-03-23 19:13:11,092 WARN L839 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_#t~nondet55#1| Int) (v_ArrVal_645 (Array Int Int)) (v_ArrVal_640 Int) (v_ArrVal_637 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_#t~nondet55#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_637) .cse1 v_ArrVal_640)))) (store .cse3 |c_~#stored_elements~0.base| (store (select .cse3 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|) |t1Thread1of1ForFork0_#t~nondet55#1|))))) (or (not (= 800 (select .cse0 .cse1))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_645) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0)) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))) is different from false [2023-03-23 19:13:11,129 INFO L321 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-03-23 19:13:11,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 178 treesize of output 168 [2023-03-23 19:13:11,189 INFO L321 Elim1Store]: treesize reduction 38, result has 56.8 percent of original size [2023-03-23 19:13:11,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 95 [2023-03-23 19:13:11,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:13:11,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 99 [2023-03-23 19:13:11,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-03-23 19:13:11,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-03-23 19:13:11,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:13:11,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 54 [2023-03-23 19:13:11,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-03-23 19:13:11,593 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:13:11,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36730 treesize of output 34702 [2023-03-23 19:13:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-23 19:13:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122794255] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:13:14,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:13:14,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 35, 34] total 86 [2023-03-23 19:13:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319310686] [2023-03-23 19:13:14,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:13:14,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2023-03-23 19:13:14,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:13:14,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2023-03-23 19:13:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=6065, Unknown=29, NotChecked=652, Total=7310 [2023-03-23 19:13:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:14,537 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:13:14,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 6.1395348837209305) internal successors, (528), 86 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:14,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:17,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-03-23 19:13:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:19,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:13:19,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-03-23 19:13:19,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-03-23 19:13:19,710 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:13:19,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:13:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 45408611, now seen corresponding path program 2 times [2023-03-23 19:13:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:13:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354233565] [2023-03-23 19:13:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:19,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:13:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-23 19:13:21,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:13:21,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354233565] [2023-03-23 19:13:21,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354233565] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-23 19:13:21,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-23 19:13:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-03-23 19:13:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249999616] [2023-03-23 19:13:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-23 19:13:21,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-03-23 19:13:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:13:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-03-23 19:13:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2023-03-23 19:13:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:21,686 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:13:21,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.517241379310345) internal successors, (189), 29 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:13:21,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:13:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-03-23 19:13:22,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-03-23 19:13:22,903 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:13:22,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:13:22,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2029857080, now seen corresponding path program 1 times [2023-03-23 19:13:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:13:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885457302] [2023-03-23 19:13:22,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:13:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-23 19:13:25,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-23 19:13:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885457302] [2023-03-23 19:13:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885457302] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-23 19:13:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021442751] [2023-03-23 19:13:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:13:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:13:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-23 19:13:25,849 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-03-23 19:13:25,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-03-23 19:13:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-23 19:13:26,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 103 conjunts are in the unsatisfiable core [2023-03-23 19:13:26,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-23 19:13:26,109 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-03-23 19:13:26,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-03-23 19:13:26,159 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-03-23 19:13:26,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-03-23 19:13:26,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-03-23 19:13:26,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-03-23 19:13:26,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-03-23 19:13:27,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-03-23 19:13:27,524 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-03-23 19:13:27,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2023-03-23 19:13:27,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-03-23 19:13:27,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-03-23 19:13:28,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:13:28,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2023-03-23 19:13:28,471 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-03-23 19:13:28,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2023-03-23 19:13:28,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-03-23 19:13:28,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-03-23 19:13:28,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-23 19:13:28,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-03-23 19:13:28,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-03-23 19:13:28,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-03-23 19:13:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-23 19:13:28,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-23 19:13:29,054 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int))) (not (= 800 (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))) is different from false [2023-03-23 19:13:32,053 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|) v_ArrVal_825) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|))))) is different from false [2023-03-23 19:13:32,066 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_825) (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|))))) is different from false [2023-03-23 19:13:32,080 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_825)))))) is different from false [2023-03-23 19:13:32,099 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (< (+ (select .cse3 .cse4) 1) v_ArrVal_825)))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 800)) is different from false [2023-03-23 19:13:32,114 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (< (+ .cse3 1) v_ArrVal_825))))) (= 800 .cse3)))) is different from false [2023-03-23 19:13:32,160 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (or (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_824 Int) (v_ArrVal_833 Int) (v_ArrVal_831 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_824) .cse5 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (< (+ .cse3 1) v_ArrVal_825))))) (= 800 .cse3)))) is different from false [2023-03-23 19:13:32,209 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_824 Int) (v_ArrVal_833 Int) (v_ArrVal_821 Int) (v_ArrVal_831 Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_821)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_824) .cse5 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (select .cse4 .cse5))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ .cse3 1) v_ArrVal_825) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (= 800 .cse3)))))) is different from false [2023-03-23 19:13:32,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_824 Int) (v_ArrVal_833 Int) (v_ArrVal_821 Int) (v_ArrVal_831 Int)) (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_821))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_824) .cse1 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse2 (select .cse6 .cse1)) (.cse4 (select .cse3 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (or (< (+ .cse2 1) v_ArrVal_825) (= .cse2 800) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (store (store (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse5 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|))))))))) is different from false [2023-03-23 19:13:32,292 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30| Int) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_824 Int) (v_ArrVal_833 Int) (v_ArrVal_821 Int) (v_ArrVal_831 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_821)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_824) .cse4 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse1 (select .cse5 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse6 .cse4))) (or (< (+ .cse0 1) v_ArrVal_825) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) (not (= 800 (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_831) .cse2 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (= .cse0 800))))))) is different from false [2023-03-23 19:13:33,755 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30| Int) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int) (v_ArrVal_833 Int) (v_ArrVal_821 Int) (v_ArrVal_831 Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_820))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) |c_~#queue~0.offset|) v_ArrVal_821)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_824) .cse1 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse2 (select .cse6 .cse1)) (.cse0 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) (= 800 .cse2) (< (+ .cse2 1) v_ArrVal_825) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) .cse5 v_ArrVal_831) .cse1 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))))) is different from false [2023-03-23 19:13:34,592 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30| Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (v_ArrVal_825 Int) (v_ArrVal_824 Int) (v_ArrVal_833 Int) (v_ArrVal_821 Int) (v_ArrVal_831 Int) (v_ArrVal_820 (Array Int Int)) (v_ArrVal_834 (Array Int Int)) (v_ArrVal_827 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (v_ArrVal_819 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_818)))) (let ((.cse10 (store (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_819) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_820))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) |c_~#queue~0.offset|) v_ArrVal_821)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse8 v_ArrVal_824) .cse1 v_ArrVal_825)) |c_~#stored_elements~0.base| v_ArrVal_827))) (let ((.cse2 (select .cse9 .cse1)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse6 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_30|) (< (+ .cse2 1) v_ArrVal_825) (not (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4)))) (= 800 .cse2) (not (= 800 (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_829) .cse8 v_ArrVal_831) .cse1 v_ArrVal_833)) |c_~#stored_elements~0.base| v_ArrVal_834) |c_~#queue~0.base|) .cse4))) (< (select .cse7 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|))))))))) is different from false [2023-03-23 19:13:34,662 INFO L321 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-03-23 19:13:34,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1114 treesize of output 967 [2023-03-23 19:13:34,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:13:34,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 962 treesize of output 946 [2023-03-23 19:13:34,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2023-03-23 19:13:34,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 363 treesize of output 347 [2023-03-23 19:13:34,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 530 treesize of output 498 [2023-03-23 19:13:34,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 94 [2023-03-23 19:13:35,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-03-23 19:13:35,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:13:35,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 339 treesize of output 317 [2023-03-23 19:13:35,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-23 19:13:35,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 114 [2023-03-23 19:13:36,205 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-03-23 19:13:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021442751] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-23 19:13:36,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-23 19:13:36,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 39] total 103 [2023-03-23 19:13:36,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915794556] [2023-03-23 19:13:36,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-23 19:13:36,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-03-23 19:13:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-23 19:13:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-03-23 19:13:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=7427, Unknown=48, NotChecked=2268, Total=10506 [2023-03-23 19:13:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:36,210 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-03-23 19:13:36,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 5.106796116504855) internal successors, (526), 103 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-03-23 19:13:36,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-03-23 19:14:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-03-23 19:14:01,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-03-23 19:14:01,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-23 19:14:01,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-03-23 19:14:01,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-23 19:14:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1695808685, now seen corresponding path program 1 times [2023-03-23 19:14:01,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-23 19:14:01,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564275169] [2023-03-23 19:14:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-23 19:14:01,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-23 19:14:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-23 19:14:01,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-03-23 19:14:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-03-23 19:14:01,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-03-23 19:14:01,925 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-03-23 19:14:01,925 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-03-23 19:14:01,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-03-23 19:14:01,927 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-23 19:14:01,928 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2023-03-23 19:14:01,930 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-03-23 19:14:01,930 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-03-23 19:14:02,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 07:14:02 BasicIcfg [2023-03-23 19:14:02,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-03-23 19:14:02,070 INFO L158 Benchmark]: Toolchain (without parser) took 76787.20ms. Allocated memory was 266.3MB in the beginning and 868.2MB in the end (delta: 601.9MB). Free memory was 211.7MB in the beginning and 719.7MB in the end (delta: -508.0MB). Peak memory consumption was 515.2MB. Max. memory is 8.0GB. [2023-03-23 19:14:02,070 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-03-23 19:14:02,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.34ms. Allocated memory is still 266.3MB. Free memory was 211.4MB in the beginning and 181.3MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-03-23 19:14:02,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.98ms. Allocated memory is still 266.3MB. Free memory was 181.3MB in the beginning and 178.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-03-23 19:14:02,070 INFO L158 Benchmark]: Boogie Preprocessor took 49.18ms. Allocated memory is still 266.3MB. Free memory was 178.2MB in the beginning and 176.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-03-23 19:14:02,070 INFO L158 Benchmark]: RCFGBuilder took 459.96ms. Allocated memory is still 266.3MB. Free memory was 176.1MB in the beginning and 218.2MB in the end (delta: -42.1MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2023-03-23 19:14:02,070 INFO L158 Benchmark]: TraceAbstraction took 75718.22ms. Allocated memory was 266.3MB in the beginning and 868.2MB in the end (delta: 601.9MB). Free memory was 217.2MB in the beginning and 719.7MB in the end (delta: -502.5MB). Peak memory consumption was 519.9MB. Max. memory is 8.0GB. [2023-03-23 19:14:02,071 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.10ms. Allocated memory is still 182.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 490.34ms. Allocated memory is still 266.3MB. Free memory was 211.4MB in the beginning and 181.3MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.98ms. Allocated memory is still 266.3MB. Free memory was 181.3MB in the beginning and 178.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.18ms. Allocated memory is still 266.3MB. Free memory was 178.2MB in the beginning and 176.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 459.96ms. Allocated memory is still 266.3MB. Free memory was 176.1MB in the beginning and 218.2MB in the end (delta: -42.1MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * TraceAbstraction took 75718.22ms. Allocated memory was 266.3MB in the beginning and 868.2MB in the end (delta: 601.9MB). Free memory was 217.2MB in the beginning and 719.7MB in the end (delta: -502.5MB). Peak memory consumption was 519.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14687, independent: 14241, independent conditional: 2914, independent unconditional: 11327, dependent: 446, dependent conditional: 380, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14324, independent: 14241, independent conditional: 2914, independent unconditional: 11327, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14324, independent: 14241, independent conditional: 2914, independent unconditional: 11327, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14471, independent: 14241, independent conditional: 26, independent unconditional: 14215, dependent: 230, dependent conditional: 121, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14471, independent: 14241, independent conditional: 26, independent unconditional: 14215, dependent: 230, dependent conditional: 35, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14471, independent: 14241, independent conditional: 26, independent unconditional: 14215, dependent: 230, dependent conditional: 35, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10719, independent: 10636, independent conditional: 11, independent unconditional: 10625, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10719, independent: 10621, independent conditional: 0, independent unconditional: 10621, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 98, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 88, independent conditional: 38, independent unconditional: 50, dependent: 151, dependent conditional: 44, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14471, independent: 3605, independent conditional: 15, independent unconditional: 3590, dependent: 147, dependent conditional: 18, dependent unconditional: 129, unknown: 10719, unknown conditional: 28, unknown unconditional: 10691] , Statistics on independence cache: Total cache size (in pairs): 10719, Positive cache size: 10636, Positive conditional cache size: 11, Positive unconditional cache size: 10625, Negative cache size: 83, Negative conditional cache size: 17, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 86, Maximal queried relation: 6, Independence queries for same thread: 363 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 881, Number of trivial persistent sets: 569, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11393, independent: 11327, independent conditional: 0, independent unconditional: 11327, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14687, independent: 14241, independent conditional: 2914, independent unconditional: 11327, dependent: 446, dependent conditional: 380, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14324, independent: 14241, independent conditional: 2914, independent unconditional: 11327, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14324, independent: 14241, independent conditional: 2914, independent unconditional: 11327, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14471, independent: 14241, independent conditional: 26, independent unconditional: 14215, dependent: 230, dependent conditional: 121, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14471, independent: 14241, independent conditional: 26, independent unconditional: 14215, dependent: 230, dependent conditional: 35, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14471, independent: 14241, independent conditional: 26, independent unconditional: 14215, dependent: 230, dependent conditional: 35, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10719, independent: 10636, independent conditional: 11, independent unconditional: 10625, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10719, independent: 10621, independent conditional: 0, independent unconditional: 10621, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 98, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 15, independent conditional: 11, independent unconditional: 4, dependent: 83, dependent conditional: 17, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 88, independent conditional: 38, independent unconditional: 50, dependent: 151, dependent conditional: 44, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14471, independent: 3605, independent conditional: 15, independent unconditional: 3590, dependent: 147, dependent conditional: 18, dependent unconditional: 129, unknown: 10719, unknown conditional: 28, unknown unconditional: 10691] , Statistics on independence cache: Total cache size (in pairs): 10719, Positive cache size: 10636, Positive conditional cache size: 11, Positive unconditional cache size: 10625, Negative cache size: 83, Negative conditional cache size: 17, Negative unconditional cache size: 66, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 86, Maximal queried relation: 6, Independence queries for same thread: 363 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7922, independent: 7814, independent conditional: 106, independent unconditional: 7708, dependent: 108, dependent conditional: 37, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7905, independent: 7814, independent conditional: 106, independent unconditional: 7708, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7905, independent: 7814, independent conditional: 106, independent unconditional: 7708, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7925, independent: 7814, independent conditional: 0, independent unconditional: 7814, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7925, independent: 7814, independent conditional: 0, independent unconditional: 7814, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7925, independent: 7814, independent conditional: 0, independent unconditional: 7814, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7645, independent: 7574, independent conditional: 0, independent unconditional: 7574, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7645, independent: 7570, independent conditional: 0, independent unconditional: 7570, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7925, independent: 240, independent conditional: 0, independent unconditional: 240, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7645, unknown conditional: 0, unknown unconditional: 7645] , Statistics on independence cache: Total cache size (in pairs): 7645, Positive cache size: 7574, Positive conditional cache size: 0, Positive unconditional cache size: 7574, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 187, Number of trivial persistent sets: 159, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7779, independent: 7708, independent conditional: 0, independent unconditional: 7708, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7922, independent: 7814, independent conditional: 106, independent unconditional: 7708, dependent: 108, dependent conditional: 37, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7905, independent: 7814, independent conditional: 106, independent unconditional: 7708, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7905, independent: 7814, independent conditional: 106, independent unconditional: 7708, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7925, independent: 7814, independent conditional: 0, independent unconditional: 7814, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7925, independent: 7814, independent conditional: 0, independent unconditional: 7814, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7925, independent: 7814, independent conditional: 0, independent unconditional: 7814, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7645, independent: 7574, independent conditional: 0, independent unconditional: 7574, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7645, independent: 7570, independent conditional: 0, independent unconditional: 7570, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7925, independent: 240, independent conditional: 0, independent unconditional: 240, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 7645, unknown conditional: 0, unknown unconditional: 7645] , Statistics on independence cache: Total cache size (in pairs): 7645, Positive cache size: 7574, Positive conditional cache size: 0, Positive unconditional cache size: 7574, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 17 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15978, independent: 15679, independent conditional: 2934, independent unconditional: 12745, dependent: 299, dependent conditional: 241, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15755, independent: 15679, independent conditional: 2934, independent unconditional: 12745, dependent: 76, dependent conditional: 18, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15755, independent: 15679, independent conditional: 2934, independent unconditional: 12745, dependent: 76, dependent conditional: 18, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15962, independent: 15679, independent conditional: 35, independent unconditional: 15644, dependent: 283, dependent conditional: 172, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15962, independent: 15679, independent conditional: 35, independent unconditional: 15644, dependent: 283, dependent conditional: 16, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15962, independent: 15679, independent conditional: 35, independent unconditional: 15644, dependent: 283, dependent conditional: 16, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12034, independent: 11973, independent conditional: 2, independent unconditional: 11971, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12034, independent: 11961, independent conditional: 0, independent unconditional: 11961, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, independent: 44, independent conditional: 2, independent unconditional: 43, dependent: 64, dependent conditional: 3, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15962, independent: 3706, independent conditional: 33, independent unconditional: 3673, dependent: 222, dependent conditional: 13, dependent unconditional: 209, unknown: 12034, unknown conditional: 5, unknown unconditional: 12029] , Statistics on independence cache: Total cache size (in pairs): 12034, Positive cache size: 11973, Positive conditional cache size: 2, Positive unconditional cache size: 11971, Negative cache size: 61, Negative conditional cache size: 3, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 156, Maximal queried relation: 8, Independence queries for same thread: 223 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 394, Number of trivial persistent sets: 300, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12803, independent: 12745, independent conditional: 0, independent unconditional: 12745, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15978, independent: 15679, independent conditional: 2934, independent unconditional: 12745, dependent: 299, dependent conditional: 241, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15755, independent: 15679, independent conditional: 2934, independent unconditional: 12745, dependent: 76, dependent conditional: 18, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15755, independent: 15679, independent conditional: 2934, independent unconditional: 12745, dependent: 76, dependent conditional: 18, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15962, independent: 15679, independent conditional: 35, independent unconditional: 15644, dependent: 283, dependent conditional: 172, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15962, independent: 15679, independent conditional: 35, independent unconditional: 15644, dependent: 283, dependent conditional: 16, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15962, independent: 15679, independent conditional: 35, independent unconditional: 15644, dependent: 283, dependent conditional: 16, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12034, independent: 11973, independent conditional: 2, independent unconditional: 11971, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12034, independent: 11961, independent conditional: 0, independent unconditional: 11961, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 12, independent conditional: 2, independent unconditional: 10, dependent: 61, dependent conditional: 3, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, independent: 44, independent conditional: 2, independent unconditional: 43, dependent: 64, dependent conditional: 3, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15962, independent: 3706, independent conditional: 33, independent unconditional: 3673, dependent: 222, dependent conditional: 13, dependent unconditional: 209, unknown: 12034, unknown conditional: 5, unknown unconditional: 12029] , Statistics on independence cache: Total cache size (in pairs): 12034, Positive cache size: 11973, Positive conditional cache size: 2, Positive unconditional cache size: 11971, Negative cache size: 61, Negative conditional cache size: 3, Negative unconditional cache size: 58, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 156, Maximal queried relation: 8, Independence queries for same thread: 223 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; VAL [m={3:0}] [L949] 0 int stored_elements[(800)]; VAL [m={3:0}, stored_elements={4:0}] [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [dequeue_flag=0, enqueue_flag=0, m={3:0}, stored_elements={4:0}] [L951] 0 QType queue; VAL [dequeue_flag=0, enqueue_flag=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1054] 0 pthread_t id1, id2; VAL [dequeue_flag=0, enqueue_flag=0, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1055] 0 enqueue_flag=(1) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L955] 0 q->tail=0 VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L956] 0 q->amount=0 VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] EXPR 0 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q->head=0, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] COND TRUE 0 q->head == q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, q->head=0, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L963] 0 return (-1); VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) VAL [dequeue_flag=0, empty(&queue)=-1, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-1, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, pthread_create(&id2, ((void *)0), t2, &queue)=0, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] 0 \read(id1) VAL [\read(id1)=-1, dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L980] 1 q->element[q->tail] = x VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L981] EXPR 1 q->amount VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->amount=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L981] 1 q->amount++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->amount++=0, q->amount=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L982] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L988] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L988] 1 q->tail++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail++=0, q->tail=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L990] 1 return 0; VAL [\old(x)=9, \result=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue(&queue,value)=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1013] 1 stored_elements[0]=value VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->head=0, q={5:0}, q={5:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] EXPR 1 q->tail VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->head=0, q->tail=1, q={5:0}, q={5:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L960] COND FALSE 1 !(q->head == q->tail) VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->head=0, q->tail=1, q={5:0}, q={5:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L966] 1 return 0; VAL [\result=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, empty(&queue)=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1018] 1 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1018] COND TRUE 1 i<((800)-1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->amount=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->amount++=1, q->amount=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L982] COND FALSE 1 !(q->tail == (800)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q->tail++=1, q->tail=1, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->element[q->head]=9, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->element[q->head]=9, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->amount=2, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->amount--=2, q->amount=2, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L997] COND FALSE 2 !(q->head == (800)) VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={3:0}, q->head++=0, q->head=0, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L1003] 2 return x; VAL [\result=9, dequeue_flag=1, enqueue_flag=0, m={3:0}, q={5:0}, q={5:0}, queue={5:0}, stored_elements={4:0}, x=9] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}, stored_elements[i]=0] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}, stored_elements[i]=0] [L1043] 2 reach_error() VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={3:0}, queue={5:0}, stored_elements={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 5.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: 86, 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, 5.9s InterpolantComputationTime, 880 NumberOfCodeBlocks, 880 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 872 ConstructedInterpolants, 0 QuantifiedInterpolants, 7786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, 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: 2, 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.0s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 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 errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 407 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 63.4s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 33.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: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 2299 NumberOfCodeBlocks, 2299 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2471 ConstructedInterpolants, 211 QuantifiedInterpolants, 50576 SizeOfPredicates, 79 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 58/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-03-23 19:14:02,103 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 [2023-03-23 19:14:02,290 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 [2023-03-23 19:14:02,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-03-23 19:14:02,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...