/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-varabs.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 08:52:18,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 08:52:18,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 08:52:19,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 08:52:19,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 08:52:19,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 08:52:19,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 08:52:19,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 08:52:19,044 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 08:52:19,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 08:52:19,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 08:52:19,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 08:52:19,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 08:52:19,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 08:52:19,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 08:52:19,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 08:52:19,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 08:52:19,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 08:52:19,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 08:52:19,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 08:52:19,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 08:52:19,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 08:52:19,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 08:52:19,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 08:52:19,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 08:52:19,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 08:52:19,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 08:52:19,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 08:52:19,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 08:52:19,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 08:52:19,069 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 08:52:19,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 08:52:19,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 08:52:19,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 08:52:19,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 08:52:19,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 08:52:19,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 08:52:19,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 08:52:19,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 08:52:19,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 08:52:19,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 08:52:19,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-varabs.epf [2022-02-11 08:52:19,104 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 08:52:19,104 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 08:52:19,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 08:52:19,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 08:52:19,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 08:52:19,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 08:52:19,106 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 08:52:19,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 08:52:19,106 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 08:52:19,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 08:52:19,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 08:52:19,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 08:52:19,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 08:52:19,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 08:52:19,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 08:52:19,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 08:52:19,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 08:52:19,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 08:52:19,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 08:52:19,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 08:52:19,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 08:52:19,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 08:52:19,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 08:52:19,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 08:52:19,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 08:52:19,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 08:52:19,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 08:52:19,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 08:52:19,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 08:52:19,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 08:52:19,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 08:52:19,113 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 08:52:19,113 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-02-11 08:52:19,114 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 08:52:19,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 08:52:19,114 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 08:52:19,115 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-11 08:52:19,115 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 [2022-02-11 08:52:19,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 08:52:19,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 08:52:19,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 08:52:19,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-11 08:52:19,387 INFO L275 PluginConnector]: CDTParser initialized [2022-02-11 08:52:19,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-02-11 08:52:19,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890b031a6/7505e7ae3ba0489094091763a72debbc/FLAG5b0f0602c [2022-02-11 08:52:20,006 INFO L306 CDTParser]: Found 1 translation units. [2022-02-11 08:52:20,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-02-11 08:52:20,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890b031a6/7505e7ae3ba0489094091763a72debbc/FLAG5b0f0602c [2022-02-11 08:52:20,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/890b031a6/7505e7ae3ba0489094091763a72debbc [2022-02-11 08:52:20,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 08:52:20,457 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-11 08:52:20,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-11 08:52:20,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-11 08:52:20,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-11 08:52:20,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 08:52:20" (1/1) ... [2022-02-11 08:52:20,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed714f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:20, skipping insertion in model container [2022-02-11 08:52:20,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 08:52:20" (1/1) ... [2022-02-11 08:52:20,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-11 08:52:20,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-11 08:52:20,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-02-11 08:52:20,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 08:52:20,892 INFO L203 MainTranslator]: Completed pre-run [2022-02-11 08:52:20,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-02-11 08:52:20,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 08:52:21,022 INFO L208 MainTranslator]: Completed translation [2022-02-11 08:52:21,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21 WrapperNode [2022-02-11 08:52:21,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-11 08:52:21,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 08:52:21,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 08:52:21,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 08:52:21,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,100 INFO L137 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-02-11 08:52:21,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 08:52:21,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 08:52:21,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 08:52:21,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 08:52:21,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 08:52:21,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 08:52:21,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 08:52:21,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 08:52:21,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (1/1) ... [2022-02-11 08:52:21,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 08:52:21,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:52:21,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-11 08:52:21,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-11 08:52:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-11 08:52:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-11 08:52:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-11 08:52:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-11 08:52:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-11 08:52:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-11 08:52:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-11 08:52:21,242 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-11 08:52:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-11 08:52:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 08:52:21,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 08:52:21,244 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 08:52:21,350 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 08:52:21,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 08:52:21,619 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 08:52:21,627 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 08:52:21,628 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-02-11 08:52:21,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 08:52:21 BoogieIcfgContainer [2022-02-11 08:52:21,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 08:52:21,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 08:52:21,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 08:52:21,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 08:52:21,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.02 08:52:20" (1/3) ... [2022-02-11 08:52:21,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6334bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 08:52:21, skipping insertion in model container [2022-02-11 08:52:21,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:52:21" (2/3) ... [2022-02-11 08:52:21,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6334bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 08:52:21, skipping insertion in model container [2022-02-11 08:52:21,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 08:52:21" (3/3) ... [2022-02-11 08:52:21,656 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-02-11 08:52:21,661 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 08:52:21,661 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 08:52:21,661 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-11 08:52:21,661 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 08:52:21,738 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,738 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,738 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,738 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,739 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,739 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,739 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,739 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,739 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,739 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,740 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,740 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,747 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,748 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,748 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,748 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,749 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,749 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,749 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,749 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,749 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,750 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,750 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,750 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,750 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,750 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,751 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,751 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,751 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,751 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,751 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,751 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,752 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,753 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,754 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,754 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,754 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,754 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,754 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,754 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,755 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,755 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,755 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,755 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,755 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,756 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,756 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,756 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,756 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,756 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,757 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,757 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,763 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,764 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,765 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,766 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,767 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,768 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,769 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,770 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,771 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,772 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,773 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,774 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,775 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,775 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,780 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,780 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,781 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,782 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,783 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,784 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,785 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,786 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,787 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,788 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,789 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,791 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,791 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,796 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,796 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,797 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,803 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,804 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,804 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,805 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,806 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,806 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,806 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,806 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:21,812 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-11 08:52:21,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 08:52:21,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:52:21,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 08:52:21,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-11 08:52:21,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-02-11 08:52:21,925 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 08:52:21,925 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 08:52:23,575 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash -86401580, now seen corresponding path program 1 times [2022-02-11 08:52:23,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:23,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201737742] [2022-02-11 08:52:23,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:23,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:23,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201737742] [2022-02-11 08:52:23,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201737742] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:52:23,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 08:52:23,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 08:52:23,943 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403263923] [2022-02-11 08:52:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:52:23,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 08:52:23,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:23,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 08:52:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 08:52:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:23,990 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:23,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:52:23,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:24,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable0 [2022-02-11 08:52:24,056 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1089076987, now seen corresponding path program 1 times [2022-02-11 08:52:24,059 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:24,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009938665] [2022-02-11 08:52:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:24,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:24,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009938665] [2022-02-11 08:52:24,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009938665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:52:24,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 08:52:24,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 08:52:24,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458939180] [2022-02-11 08:52:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:52:24,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 08:52:24,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:24,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 08:52:24,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 08:52:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:24,188 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:24,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:52:24,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:24,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:25,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,ResultService [2022-02-11 08:52:25,182 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash -202434824, now seen corresponding path program 1 times [2022-02-11 08:52:25,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:25,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037989569] [2022-02-11 08:52:25,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:25,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:25,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:25,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037989569] [2022-02-11 08:52:25,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037989569] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:52:25,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835368208] [2022-02-11 08:52:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:25,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:52:25,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:52:25,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:52:25,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-11 08:52:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:25,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-11 08:52:25,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:52:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:26,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:52:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:26,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835368208] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:52:26,727 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:52:26,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-11 08:52:26,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382179090] [2022-02-11 08:52:26,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:52:26,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-11 08:52:26,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-11 08:52:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-11 08:52:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:26,739 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:26,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:52:26,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:26,740 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:27,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-11 08:52:27,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2,ResultService [2022-02-11 08:52:27,858 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1846768856, now seen corresponding path program 2 times [2022-02-11 08:52:27,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:27,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318975165] [2022-02-11 08:52:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 102 proven. 1 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2022-02-11 08:52:28,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:28,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318975165] [2022-02-11 08:52:28,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318975165] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:52:28,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704368175] [2022-02-11 08:52:28,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 08:52:28,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:52:28,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:52:28,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:52:28,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-11 08:52:28,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 08:52:28,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 08:52:28,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-11 08:52:28,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:52:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:28,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:52:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-02-11 08:52:29,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704368175] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:52:29,276 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:52:29,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-02-11 08:52:29,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571722855] [2022-02-11 08:52:29,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:52:29,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-11 08:52:29,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-11 08:52:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-11 08:52:29,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:29,280 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:29,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.105263157894736) internal successors, (230), 19 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:52:29,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:29,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:29,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:29,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:30,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:52:30,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-11 08:52:30,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,ResultService,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:52:30,232 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:30,232 INFO L85 PathProgramCache]: Analyzing trace with hash 241535475, now seen corresponding path program 1 times [2022-02-11 08:52:30,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:30,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779940084] [2022-02-11 08:52:30,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 08:52:30,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:30,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779940084] [2022-02-11 08:52:30,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779940084] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:52:30,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137970964] [2022-02-11 08:52:30,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:52:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:52:30,421 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) [2022-02-11 08:52:30,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-11 08:52:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:30,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-11 08:52:30,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:52:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 08:52:30,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:52:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 08:52:30,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137970964] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:52:30,914 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:52:30,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-11 08:52:30,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27430892] [2022-02-11 08:52:30,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:52:30,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-11 08:52:30,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-11 08:52:30,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-11 08:52:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:30,917 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:30,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 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) [2022-02-11 08:52:30,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:30,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:30,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:30,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:52:30,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:31,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:52:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:52:31,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-11 08:52:31,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,ResultService,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:52:31,432 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash -331369136, now seen corresponding path program 2 times [2022-02-11 08:52:31,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:31,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61882804] [2022-02-11 08:52:31,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 08:52:31,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:31,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61882804] [2022-02-11 08:52:31,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61882804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:52:31,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 08:52:31,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-11 08:52:31,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531991435] [2022-02-11 08:52:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:52:31,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-11 08:52:31,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-11 08:52:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-02-11 08:52:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:31,892 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:31,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:52:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:31,893 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:52:31,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:52:31,895 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:52:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:52:32,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 08:52:32,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable5 [2022-02-11 08:52:32,538 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:52:32,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:52:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash -475919971, now seen corresponding path program 1 times [2022-02-11 08:52:32,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:52:32,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945929442] [2022-02-11 08:52:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:52:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 08:52:33,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:52:33,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945929442] [2022-02-11 08:52:33,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945929442] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:52:33,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744532845] [2022-02-11 08:52:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:52:33,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:52:33,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:52:33,597 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) [2022-02-11 08:52:33,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-11 08:52:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:52:33,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-11 08:52:33,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:52:33,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-02-11 08:52:34,215 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 08:52:34,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-02-11 08:52:34,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-02-11 08:52:34,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-02-11 08:52:34,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2022-02-11 08:52:34,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 10 [2022-02-11 08:52:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-02-11 08:52:34,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:52:37,181 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:52:39,186 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-02-11 08:52:41,193 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-02-11 08:52:43,199 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-02-11 08:52:43,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-02-11 08:52:45,536 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2022-02-11 08:52:45,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_861 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_861) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-02-11 08:52:46,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-02-11 08:52:46,286 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-11 08:52:46,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-02-11 08:52:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-02-11 08:52:46,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744532845] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:52:46,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:52:46,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-02-11 08:52:46,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961329839] [2022-02-11 08:52:46,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:52:46,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-11 08:52:46,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:52:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-11 08:52:46,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1402, Unknown=7, NotChecked=486, Total=2070 [2022-02-11 08:52:46,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:46,308 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:52:46,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.260869565217392) internal successors, (242), 46 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:52:46,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:46,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:52:46,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:52:46,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:52:46,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:52:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 08:52:46,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:52:59,797 WARN L228 SmtUtils]: Spent 12.94s on a formula simplification. DAG size of input: 55 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:53:06,322 WARN L228 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:53:07,227 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) .cse1 (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse1 (= .cse2 .cse3)) (let ((.cse4 (@diff .cse3 .cse2))) (and (= .cse2 (store .cse3 .cse4 0)) .cse1 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 08:53:07,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 08:53:08,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 08:53:14,079 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-02-11 08:53:14,389 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-02-11 08:53:14,692 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (= |c_~#cache~0.base| 4)) is different from false [2022-02-11 08:53:25,014 WARN L228 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:53:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:53:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:53:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:53:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 08:53:25,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-02-11 08:53:25,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-11 08:53:25,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,ResultService,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:53:25,411 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:53:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:53:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash -184301972, now seen corresponding path program 1 times [2022-02-11 08:53:25,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:53:25,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698824322] [2022-02-11 08:53:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:53:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:54,475 WARN L228 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:12,818 WARN L228 SmtUtils]: Spent 7.36s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:28,040 WARN L228 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:48,673 WARN L228 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 13 proven. 189 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 08:55:54,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:55:54,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698824322] [2022-02-11 08:55:54,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698824322] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:55:54,269 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79288289] [2022-02-11 08:55:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:55:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:55:54,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:55:54,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:55:54,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-11 08:55:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:55:54,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-11 08:55:54,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:55:55,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-02-11 08:55:55,892 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 08:55:55,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-02-11 08:55:56,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-02-11 08:55:57,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-02-11 08:55:58,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2022-02-11 08:56:17,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-11 08:56:26,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 26 [2022-02-11 08:58:34,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-11 08:58:50,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 treesize of output 26 [2022-02-11 09:00:46,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 31 [2022-02-11 09:00:53,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 26 [2022-02-11 09:00:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 22 proven. 87 refuted. 93 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 09:00:54,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 09:00:55,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1054 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-02-11 09:00:55,219 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1054 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|)))) is different from false [2022-02-11 09:00:55,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1054 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2022-02-11 09:00:55,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1054 (Array Int Int))) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:00:55,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1054 (Array Int Int))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:00:55,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1054 (Array Int Int))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:00:56,751 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1054 (Array Int Int))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-02-11 09:00:56,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1054 (Array Int Int))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:00:57,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1054 (Array Int Int))) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 3)))) is different from false [2022-02-11 09:00:57,355 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1054 (Array Int Int))) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:01:00,023 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1054 (Array Int Int))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 4)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:01:00,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1054 (Array Int Int))) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:01:00,928 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int))) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1049)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0))) is different from false [2022-02-11 09:01:03,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1049)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:01:03,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1049) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28))) is different from false [2022-02-11 09:01:04,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 5 |c_t_funThread1of1ForFork0_#t~post41#1|)) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_1049) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 5)))) is different from false [2022-02-11 09:01:04,446 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 5 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_1049) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 5)))) is different from false [2022-02-11 09:01:06,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1045 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1045)))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_1049) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 5 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 5)))) is different from false [2022-02-11 09:01:10,065 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1053 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| Int) (v_ArrVal_1045 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| Int) (v_ArrVal_1049 Int) (v_ArrVal_1054 (Array Int Int)) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_79| v_ArrVal_1045)))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_1049) (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| 28) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73_113| |c_~#cache~0.offset| 1) v_ArrVal_1053))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1054) |c_~#cache~0.base|) (+ (* (- 1) |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117|) (- 1) (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| 28) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ 5 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77_113| 5)))) is different from false Received shutdown request... [2022-02-11 09:06:08,730 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-02-11 09:06:08,732 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-11 09:06:08,740 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:06:08,740 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:06:08,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-11 09:06:08,774 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:06:08,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 09:06:08,933 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 250 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 38 for 1ms.. [2022-02-11 09:06:08,937 INFO L733 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-02-11 09:06:08,938 INFO L313 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2022-02-11 09:06:08,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 09:06:08,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 09:06:08,942 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 09:06:08,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2022-02-11 09:06:08,944 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:06:08,949 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 09:06:08,949 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 09:06:08,949 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-11 09:06:08,950 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. [2022-02-11 09:06:08,950 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-11 09:06:08,950 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-11 09:06:08,951 INFO L733 BasicCegarLoop]: Path program histogram: [] [2022-02-11 09:06:08,951 INFO L313 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT,TIMEOUT (2/2) [2022-02-11 09:06:08,951 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-11 09:06:08,951 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 09:06:08,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 09:06:08 BasicIcfg [2022-02-11 09:06:08,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 09:06:08,955 INFO L158 Benchmark]: Toolchain (without parser) took 828497.69ms. Allocated memory was 170.9MB in the beginning and 418.4MB in the end (delta: 247.5MB). Free memory was 112.1MB in the beginning and 359.2MB in the end (delta: -247.1MB). Peak memory consumption was 1.9MB. Max. memory is 8.0GB. [2022-02-11 09:06:08,955 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 170.9MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 09:06:08,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.34ms. Allocated memory was 170.9MB in the beginning and 225.4MB in the end (delta: 54.5MB). Free memory was 111.8MB in the beginning and 177.2MB in the end (delta: -65.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-02-11 09:06:08,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.07ms. Allocated memory is still 225.4MB. Free memory was 177.2MB in the beginning and 174.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 09:06:08,955 INFO L158 Benchmark]: Boogie Preprocessor took 54.74ms. Allocated memory is still 225.4MB. Free memory was 174.7MB in the beginning and 172.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 09:06:08,956 INFO L158 Benchmark]: RCFGBuilder took 473.93ms. Allocated memory is still 225.4MB. Free memory was 172.6MB in the beginning and 155.3MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-02-11 09:06:08,956 INFO L158 Benchmark]: TraceAbstraction took 827321.91ms. Allocated memory was 225.4MB in the beginning and 418.4MB in the end (delta: 192.9MB). Free memory was 154.8MB in the beginning and 359.2MB in the end (delta: -204.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 09:06:08,957 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 170.9MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 565.34ms. Allocated memory was 170.9MB in the beginning and 225.4MB in the end (delta: 54.5MB). Free memory was 111.8MB in the beginning and 177.2MB in the end (delta: -65.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.07ms. Allocated memory is still 225.4MB. Free memory was 177.2MB in the beginning and 174.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.74ms. Allocated memory is still 225.4MB. Free memory was 174.7MB in the beginning and 172.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 473.93ms. Allocated memory is still 225.4MB. Free memory was 172.6MB in the beginning and 155.3MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 827321.91ms. Allocated memory was 225.4MB in the beginning and 418.4MB in the end (delta: 192.9MB). Free memory was 154.8MB in the beginning and 359.2MB in the end (delta: -204.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6631, positive: 6522, positive conditional: 235, positive unconditional: 6287, negative: 109, negative conditional: 94, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70529, positive: 70430, positive conditional: 1898, positive unconditional: 68532, negative: 99, negative conditional: 17, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70529, positive: 70430, positive conditional: 1898, positive unconditional: 68532, negative: 99, negative conditional: 17, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70532, positive: 70430, positive conditional: 567, positive unconditional: 69863, negative: 102, negative conditional: 3, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70532, positive: 70430, positive conditional: 126, positive unconditional: 70304, negative: 102, negative conditional: 2, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70532, positive: 70430, positive conditional: 126, positive unconditional: 70304, negative: 102, negative conditional: 2, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16970, positive: 16930, positive conditional: 0, positive unconditional: 16930, negative: 40, negative conditional: 2, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16970, positive: 16546, positive conditional: 0, positive unconditional: 16546, negative: 424, negative conditional: 0, negative unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 424, positive: 384, positive conditional: 0, positive unconditional: 384, negative: 14, negative conditional: 2, negative unconditional: 12, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1601, positive: 598, positive conditional: 0, positive unconditional: 598, negative: 21, negative conditional: 6, negative unconditional: 15, unknown: 983, unknown conditional: 0, unknown unconditional: 983] ], Cache Queries: [ total: 70532, positive: 53500, positive conditional: 126, positive unconditional: 53374, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 16970, unknown conditional: 2, unknown unconditional: 16968] , Statistics on independence cache: Total cache size (in pairs): 16970, Positive cache size: 16930, Positive conditional cache size: 0, Positive unconditional cache size: 16930, Negative cache size: 40, Negative conditional cache size: 2, Negative unconditional cache size: 38, Eliminated conditions: 442, Maximal queried relation: 3, Independence queries for same thread: 93 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 1.3s, Number of persistent set computation: 103, Number of trivial persistent sets: 55, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6302, positive: 6287, positive conditional: 0, positive unconditional: 6287, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6631, positive: 6522, positive conditional: 235, positive unconditional: 6287, negative: 109, negative conditional: 94, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70529, positive: 70430, positive conditional: 1898, positive unconditional: 68532, negative: 99, negative conditional: 17, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70529, positive: 70430, positive conditional: 1898, positive unconditional: 68532, negative: 99, negative conditional: 17, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70532, positive: 70430, positive conditional: 567, positive unconditional: 69863, negative: 102, negative conditional: 3, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70532, positive: 70430, positive conditional: 126, positive unconditional: 70304, negative: 102, negative conditional: 2, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70532, positive: 70430, positive conditional: 126, positive unconditional: 70304, negative: 102, negative conditional: 2, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16970, positive: 16930, positive conditional: 0, positive unconditional: 16930, negative: 40, negative conditional: 2, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16970, positive: 16546, positive conditional: 0, positive unconditional: 16546, negative: 424, negative conditional: 0, negative unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 424, positive: 384, positive conditional: 0, positive unconditional: 384, negative: 14, negative conditional: 2, negative unconditional: 12, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1601, positive: 598, positive conditional: 0, positive unconditional: 598, negative: 21, negative conditional: 6, negative unconditional: 15, unknown: 983, unknown conditional: 0, unknown unconditional: 983] ], Cache Queries: [ total: 70532, positive: 53500, positive conditional: 126, positive unconditional: 53374, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 16970, unknown conditional: 2, unknown unconditional: 16968] , Statistics on independence cache: Total cache size (in pairs): 16970, Positive cache size: 16930, Positive conditional cache size: 0, Positive unconditional cache size: 16930, Negative cache size: 40, Negative conditional cache size: 2, Negative unconditional cache size: 38, Eliminated conditions: 442, Maximal queried relation: 3, Independence queries for same thread: 93 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 250 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 38 for 1ms.. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 954]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 827.1s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 44.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 2458 NumberOfCodeBlocks, 2458 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3310 ConstructedInterpolants, 116 QuantifiedInterpolants, 13035 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2025 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 3539/3936 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 3 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown