/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-NewStatesSleep-NoLbe-Random42.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-14 03:01:19,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-14 03:01:19,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-14 03:01:19,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-14 03:01:19,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-14 03:01:19,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-14 03:01:19,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-14 03:01:19,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-14 03:01:19,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-14 03:01:19,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-14 03:01:19,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-14 03:01:19,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-14 03:01:19,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-14 03:01:19,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-14 03:01:19,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-14 03:01:19,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-14 03:01:19,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-14 03:01:19,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-14 03:01:19,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-14 03:01:19,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-14 03:01:19,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-14 03:01:19,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-14 03:01:19,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-14 03:01:19,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-14 03:01:19,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-14 03:01:19,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-14 03:01:19,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-14 03:01:19,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-14 03:01:19,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-14 03:01:19,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-14 03:01:19,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-14 03:01:19,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-14 03:01:19,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-14 03:01:19,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-14 03:01:19,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-14 03:01:19,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-14 03:01:19,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-14 03:01:19,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-14 03:01:19,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-14 03:01:19,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-14 03:01:19,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-14 03:01:19,244 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-NewStatesSleep-NoLbe-Random42.epf [2021-06-14 03:01:19,272 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-14 03:01:19,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-14 03:01:19,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-14 03:01:19,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-14 03:01:19,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-14 03:01:19,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-14 03:01:19,274 INFO L138 SettingsManager]: * Use SBE=true [2021-06-14 03:01:19,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-14 03:01:19,274 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-14 03:01:19,275 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-14 03:01:19,275 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-14 03:01:19,275 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-14 03:01:19,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-14 03:01:19,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-14 03:01:19,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-14 03:01:19,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * DFS Order used in POR=RANDOM [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-14 03:01:19,277 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-14 03:01:19,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-14 03:01:19,278 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-06-14 03:01:19,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-14 03:01:19,278 INFO L138 SettingsManager]: * Random seed used by POR DFS order=42 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 [2021-06-14 03:01:19,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-14 03:01:19,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-14 03:01:19,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-14 03:01:19,572 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-14 03:01:19,572 INFO L275 PluginConnector]: CDTParser initialized [2021-06-14 03:01:19,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2021-06-14 03:01:19,629 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0ed1892/9040397911454dcc993bf9663d61de36/FLAG3a13cb664 [2021-06-14 03:01:20,044 INFO L306 CDTParser]: Found 1 translation units. [2021-06-14 03:01:20,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2021-06-14 03:01:20,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0ed1892/9040397911454dcc993bf9663d61de36/FLAG3a13cb664 [2021-06-14 03:01:20,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc0ed1892/9040397911454dcc993bf9663d61de36 [2021-06-14 03:01:20,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-14 03:01:20,073 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-14 03:01:20,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-14 03:01:20,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-14 03:01:20,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-14 03:01:20,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdee402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20, skipping insertion in model container [2021-06-14 03:01:20,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-14 03:01:20,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-14 03:01:20,464 WARN L224 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_72-funloop_hard_racing.i[41060,41073] [2021-06-14 03:01:20,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-14 03:01:20,506 INFO L203 MainTranslator]: Completed pre-run [2021-06-14 03:01:20,538 WARN L224 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_72-funloop_hard_racing.i[41060,41073] [2021-06-14 03:01:20,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-14 03:01:20,631 INFO L208 MainTranslator]: Completed translation [2021-06-14 03:01:20,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20 WrapperNode [2021-06-14 03:01:20,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-14 03:01:20,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-14 03:01:20,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-14 03:01:20,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-14 03:01:20,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,682 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-14 03:01:20,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-14 03:01:20,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-14 03:01:20,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-14 03:01:20,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... [2021-06-14 03:01:20,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-14 03:01:20,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-14 03:01:20,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-14 03:01:20,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-14 03:01:20,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-14 03:01:20,759 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-14 03:01:20,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-14 03:01:20,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-14 03:01:20,760 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-14 03:01:21,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-14 03:01:21,159 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-06-14 03:01:21,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:01:21 BoogieIcfgContainer [2021-06-14 03:01:21,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-14 03:01:21,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-14 03:01:21,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-14 03:01:21,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-14 03:01:21,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:01:20" (1/3) ... [2021-06-14 03:01:21,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235c0ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:01:21, skipping insertion in model container [2021-06-14 03:01:21,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:01:20" (2/3) ... [2021-06-14 03:01:21,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@235c0ec5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:01:21, skipping insertion in model container [2021-06-14 03:01:21,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:01:21" (3/3) ... [2021-06-14 03:01:21,165 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2021-06-14 03:01:21,169 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-14 03:01:21,169 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-14 03:01:21,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-14 03:01:21,169 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-14 03:01:21,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,189 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,189 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,189 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,190 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,191 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,192 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,192 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,209 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,210 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,211 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,212 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,213 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,214 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,215 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,216 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,217 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,218 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,219 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,220 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,221 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,222 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,223 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:01:21,227 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-14 03:01:21,239 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-06-14 03:01:21,277 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:01:21,278 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:01:21,278 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:01:21,278 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:01:21,278 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:01:21,278 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:01:21,278 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:01:21,278 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:01:21,360 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:21,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash -389233480, now seen corresponding path program 1 times [2021-06-14 03:01:21,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:21,369 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087516806] [2021-06-14 03:01:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-14 03:01:21,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:21,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087516806] [2021-06-14 03:01:21,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087516806] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-14 03:01:21,485 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-14 03:01:21,485 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-14 03:01:21,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627301727] [2021-06-14 03:01:21,489 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-14 03:01:21,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-14 03:01:21,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-14 03:01:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:21,499 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:21,500 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:01:21,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:21,550 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-14 03:01:21,551 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1683725653, now seen corresponding path program 1 times [2021-06-14 03:01:21,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:21,551 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867665916] [2021-06-14 03:01:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:21,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-14 03:01:21,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:21,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867665916] [2021-06-14 03:01:21,663 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867665916] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:21,663 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779880210] [2021-06-14 03:01:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:21,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-14 03:01:21,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:01:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-14 03:01:21,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779880210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:21,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:01:21,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-14 03:01:21,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863115106] [2021-06-14 03:01:21,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-14 03:01:21,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-14 03:01:21,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-14 03:01:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:21,928 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:21,928 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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) [2021-06-14 03:01:21,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:21,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:22,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:22,193 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1807966504, now seen corresponding path program 2 times [2021-06-14 03:01:22,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:22,194 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246033722] [2021-06-14 03:01:22,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-14 03:01:22,271 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:22,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246033722] [2021-06-14 03:01:22,271 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246033722] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:22,271 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268712779] [2021-06-14 03:01:22,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:22,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-14 03:01:22,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:01:22,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-14 03:01:22,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:01:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-14 03:01:22,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268712779] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:22,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:01:22,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-14 03:01:22,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940072159] [2021-06-14 03:01:22,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-14 03:01:22,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-14 03:01:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-14 03:01:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:22,485 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:22,485 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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) [2021-06-14 03:01:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:22,485 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:22,757 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:22,757 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1117841611, now seen corresponding path program 3 times [2021-06-14 03:01:22,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:22,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629324067] [2021-06-14 03:01:22,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-14 03:01:22,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:22,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629324067] [2021-06-14 03:01:22,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629324067] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:22,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424822427] [2021-06-14 03:01:22,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:22,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-14 03:01:22,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:01:22,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-14 03:01:22,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:01:22,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-06-14 03:01:22,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:22,983 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:22,983 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:22,983 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-14 03:01:22,999 INFO L388 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 [2021-06-14 03:01:23,000 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,004 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,004 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-14 03:01:23,079 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-14 03:01:23,080 INFO L388 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 [2021-06-14 03:01:23,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,089 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,089 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,090 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-14 03:01:23,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:01:23,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:01:23,132 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,136 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,136 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,143 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,144 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-14 03:01:23,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:01:23,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:01:23,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,230 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,236 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,236 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-14 03:01:23,262 INFO L388 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 [2021-06-14 03:01:23,264 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:23,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:23,268 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-14 03:01:23,268 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-14 03:01:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-14 03:01:23,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424822427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:23,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:01:23,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2021-06-14 03:01:23,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612710030] [2021-06-14 03:01:23,329 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-14 03:01:23,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-14 03:01:23,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-14 03:01:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:23,333 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:23,333 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.444444444444445) internal successors, (116), 18 states have internal predecessors, (116), 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) [2021-06-14 03:01:23,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:23,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:23,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:23,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:01:24,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:24,013 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:24,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2093638744, now seen corresponding path program 1 times [2021-06-14 03:01:24,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:24,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031254332] [2021-06-14 03:01:24,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-14 03:01:24,107 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:24,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031254332] [2021-06-14 03:01:24,107 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031254332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:24,107 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447716726] [2021-06-14 03:01:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:24,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-14 03:01:24,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:01:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-14 03:01:24,318 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447716726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:24,318 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:01:24,318 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-14 03:01:24,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844806456] [2021-06-14 03:01:24,319 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-14 03:01:24,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-14 03:01:24,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-14 03:01:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:24,320 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:24,320 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:01:24,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:24,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:24,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:24,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:01:24,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:01:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:01:24,661 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:24,661 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:24,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1997882235, now seen corresponding path program 2 times [2021-06-14 03:01:24,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:24,662 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983153210] [2021-06-14 03:01:24,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-14 03:01:24,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:24,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983153210] [2021-06-14 03:01:24,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983153210] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:24,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765821687] [2021-06-14 03:01:24,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:24,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-14 03:01:24,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:01:24,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-14 03:01:24,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:01:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-14 03:01:24,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765821687] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:24,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:01:24,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-14 03:01:24,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966130552] [2021-06-14 03:01:24,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-14 03:01:24,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:24,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-14 03:01:24,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-14 03:01:24,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:24,981 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:24,981 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.333333333333333) internal successors, (110), 15 states have internal predecessors, (110), 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) [2021-06-14 03:01:24,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:24,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:24,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:24,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:01:24,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:01:24,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:01:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:01:25,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:01:25,324 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:25,325 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:01:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:01:25,325 INFO L82 PathProgramCache]: Analyzing trace with hash -527917624, now seen corresponding path program 3 times [2021-06-14 03:01:25,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:01:25,325 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148447421] [2021-06-14 03:01:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:01:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:01:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-14 03:01:25,423 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:01:25,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148447421] [2021-06-14 03:01:25,424 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148447421] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:25,424 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302498897] [2021-06-14 03:01:25,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:01:25,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-14 03:01:25,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:01:25,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-14 03:01:25,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:01:25,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-06-14 03:01:25,524 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,526 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-14 03:01:25,545 INFO L388 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 [2021-06-14 03:01:25,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,550 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-14 03:01:25,637 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-14 03:01:25,637 INFO L388 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 [2021-06-14 03:01:25,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,641 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,642 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,642 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-14 03:01:25,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:01:25,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:01:25,668 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,674 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,674 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,680 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,680 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-14 03:01:25,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:01:25,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:01:25,768 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,772 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,772 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,781 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:17 [2021-06-14 03:01:25,823 INFO L388 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 20 treesize of output 15 [2021-06-14 03:01:25,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:25,828 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:25,842 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-14 03:01:25,842 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2021-06-14 03:01:26,754 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-14 03:01:26,816 INFO L388 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 25 treesize of output 20 [2021-06-14 03:01:26,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:26,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:26,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-14 03:01:26,822 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-06-14 03:01:27,172 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int)) (and (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-14 03:01:27,955 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-14 03:01:28,553 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-06-14 03:01:29,082 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-14 03:01:29,643 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-14 03:01:29,860 INFO L388 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 32 treesize of output 28 [2021-06-14 03:01:29,861 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:01:29,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:01:29,881 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-06-14 03:01:29,881 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-14 03:01:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 8 not checked. [2021-06-14 03:01:30,023 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302498897] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:01:30,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:01:30,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2021-06-14 03:01:30,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864123354] [2021-06-14 03:01:30,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-14 03:01:30,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:01:30,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-14 03:01:30,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=516, Unknown=7, NotChecked=250, Total=870 [2021-06-14 03:01:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:30,024 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:01:30,025 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 6.4) internal successors, (192), 30 states have internal predecessors, (192), 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) [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:01:30,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:01:31,828 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-14 03:01:32,971 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-14 03:02:18,800 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:02:38,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-14 03:02:38,866 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:02:38,866 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:02:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:02:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1524219349, now seen corresponding path program 4 times [2021-06-14 03:02:38,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:02:38,867 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079190962] [2021-06-14 03:02:38,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:02:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:02:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-14 03:02:39,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:02:39,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079190962] [2021-06-14 03:02:39,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079190962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:02:39,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180015111] [2021-06-14 03:02:39,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:02:39,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-14 03:02:39,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:02:39,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-14 03:02:39,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:02:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-14 03:02:39,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180015111] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:02:39,258 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:02:39,258 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-14 03:02:39,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855451570] [2021-06-14 03:02:39,258 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-14 03:02:39,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:02:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-14 03:02:39,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-14 03:02:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:02:39,259 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:02:39,259 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.315789473684211) internal successors, (120), 19 states have internal predecessors, (120), 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) [2021-06-14 03:02:39,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:02:39,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:02:39,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:02:39,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:02:39,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:02:39,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:02:39,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2021-06-14 03:02:39,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:02:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:02:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:02:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:02:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:02:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:02:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:02:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-14 03:02:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:02:39,676 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-14 03:02:39,677 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:02:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:02:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1039992472, now seen corresponding path program 5 times [2021-06-14 03:02:39,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:02:39,678 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650454184] [2021-06-14 03:02:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:02:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:02:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-14 03:02:39,840 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:02:39,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650454184] [2021-06-14 03:02:39,840 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650454184] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:02:39,840 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483063703] [2021-06-14 03:02:39,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:02:40,252 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-06-14 03:02:40,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:02:40,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-14 03:02:40,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:02:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-14 03:02:40,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483063703] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:02:40,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:02:40,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-14 03:02:40,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423487556] [2021-06-14 03:02:40,409 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-14 03:02:40,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:02:40,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-14 03:02:40,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-14 03:02:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:02:40,410 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:02:40,410 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 21 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:02:40,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:02:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:02:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:02:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:02:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:02:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:02:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:02:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-14 03:02:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:02:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-14 03:02:40,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-14 03:02:40,839 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:02:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:02:40,839 INFO L82 PathProgramCache]: Analyzing trace with hash 40353717, now seen corresponding path program 6 times [2021-06-14 03:02:40,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:02:40,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288897536] [2021-06-14 03:02:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:02:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:02:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-14 03:02:41,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:02:41,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288897536] [2021-06-14 03:02:41,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288897536] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:02:41,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603219418] [2021-06-14 03:02:41,015 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:02:41,150 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-14 03:02:41,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:02:41,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 41 conjunts are in the unsatisfiable core [2021-06-14 03:02:41,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:02:41,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-06-14 03:02:41,172 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,174 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,174 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-14 03:02:41,188 INFO L388 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 [2021-06-14 03:02:41,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,193 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-14 03:02:41,276 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-14 03:02:41,276 INFO L388 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 [2021-06-14 03:02:41,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,282 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,282 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-14 03:02:41,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:02:41,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:02:41,313 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,316 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,316 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,320 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,321 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,321 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-14 03:02:41,404 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:02:41,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:02:41,408 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,411 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,411 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,418 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:29, output treesize:10 [2021-06-14 03:02:41,488 INFO L388 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 [2021-06-14 03:02:41,488 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,492 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,492 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-06-14 03:02:41,572 INFO L388 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 [2021-06-14 03:02:41,573 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,574 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,575 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-14 03:02:41,575 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-06-14 03:02:41,682 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:02:41,767 INFO L388 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 26 treesize of output 21 [2021-06-14 03:02:41,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:41,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:41,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-14 03:02:41,774 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2021-06-14 03:02:42,399 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-14 03:02:42,449 INFO L388 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 [2021-06-14 03:02:42,450 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:42,453 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:42,455 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-14 03:02:42,455 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:25 [2021-06-14 03:02:42,974 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int) (v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 Int)) (and (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (= (select |c_#memory_int| |c_~#cache~0.base|) (store (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 (select .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21))) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-14 03:02:43,662 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (= (select |c_#memory_int| |c_~#cache~0.base|) (store (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 (select .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21))) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102))) is different from true [2021-06-14 03:02:44,290 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (= (select |c_#memory_int| |c_~#cache~0.base|) (store (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 (select .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21))) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-06-14 03:02:44,791 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int) (v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 Int)) (and (= (store (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 (select .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21))) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-14 03:02:45,435 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int) (v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21 (select .cse0 v_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_21))) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-14 03:02:45,596 INFO L388 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 38 treesize of output 34 [2021-06-14 03:02:45,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:02:45,607 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:02:45,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2021-06-14 03:02:45,615 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:58, output treesize:51 [2021-06-14 03:02:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 189 trivial. 26 not checked. [2021-06-14 03:02:45,780 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603219418] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:02:45,780 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:02:45,781 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2021-06-14 03:02:45,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306730835] [2021-06-14 03:02:45,781 INFO L462 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-06-14 03:02:45,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:02:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-06-14 03:02:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1312, Unknown=6, NotChecked=390, Total=1892 [2021-06-14 03:02:45,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:02:45,783 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:02:45,783 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 44 states, 44 states have (on average 5.4772727272727275) internal successors, (241), 44 states have internal predecessors, (241), 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) [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-14 03:02:45,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:02:48,152 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-14 03:02:48,524 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2021-06-14 03:02:48,870 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-14 03:02:57,214 WARN L205 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-14 03:03:19,151 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-14 03:03:19,514 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-06-14 03:03:19,882 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-06-14 03:03:36,457 WARN L205 SmtUtils]: Spent 943.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-14 03:05:01,932 WARN L205 SmtUtils]: Spent 794.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-14 03:05:31,961 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-06-14 03:05:53,213 WARN L205 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-14 03:05:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-14 03:05:54,500 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:05:54,501 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:05:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:05:54,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1593396866, now seen corresponding path program 7 times [2021-06-14 03:05:54,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:05:54,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163377040] [2021-06-14 03:05:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:05:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:05:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-14 03:05:54,933 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:05:54,933 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163377040] [2021-06-14 03:05:54,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163377040] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:05:54,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850074846] [2021-06-14 03:05:54,934 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:05:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:05:55,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-14 03:05:55,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:05:55,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-06-14 03:05:55,041 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:55,042 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,042 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-14 03:05:55,047 INFO L388 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 [2021-06-14 03:05:55,048 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:55,051 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,051 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-14 03:05:55,125 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-14 03:05:55,125 INFO L388 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 [2021-06-14 03:05:55,126 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,129 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:55,129 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,130 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-14 03:05:55,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:05:55,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:05:55,145 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,148 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:55,148 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:55,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,153 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-14 03:05:55,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-14 03:05:55,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:55,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:55,238 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-14 03:05:55,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-06-14 03:05:56,255 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-14 03:05:56,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-06-14 03:05:56,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:05:56,296 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:56,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:56,300 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:05:56,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:56,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-14 03:05:56,309 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-06-14 03:05:57,675 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-14 03:05:57,704 INFO L388 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 25 treesize of output 20 [2021-06-14 03:05:57,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:05:57,708 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:05:57,710 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-14 03:05:57,710 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-06-14 03:06:04,505 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-14 03:06:05,209 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-14 03:06:05,872 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-06-14 03:06:06,395 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-14 03:06:07,044 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-14 03:06:07,221 INFO L388 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 32 treesize of output 28 [2021-06-14 03:06:07,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:06:07,240 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:06:07,249 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-06-14 03:06:07,249 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-14 03:06:07,763 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 235 trivial. 8 not checked. [2021-06-14 03:06:07,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850074846] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:06:07,763 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:06:07,763 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-06-14 03:06:07,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696341869] [2021-06-14 03:06:07,764 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-14 03:06:07,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:06:07,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-14 03:06:07,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=487, Unknown=22, NotChecked=196, Total=812 [2021-06-14 03:06:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:06:07,764 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:06:07,765 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 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) [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2021-06-14 03:06:07,765 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:06:13,613 WARN L205 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2021-06-14 03:06:19,551 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-14 03:06:27,253 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2021-06-14 03:06:30,727 WARN L205 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2021-06-14 03:06:33,364 WARN L205 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2021-06-14 03:06:35,900 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2021-06-14 03:06:40,386 WARN L205 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2021-06-14 03:06:48,991 WARN L205 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-06-14 03:06:55,510 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2021-06-14 03:07:11,562 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-06-14 03:07:17,224 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2021-06-14 03:07:23,303 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-06-14 03:07:30,625 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2021-06-14 03:07:41,455 WARN L205 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2021-06-14 03:07:52,286 WARN L205 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2021-06-14 03:08:10,231 WARN L205 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2021-06-14 03:08:25,212 WARN L205 SmtUtils]: Spent 6.31 s on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2021-06-14 03:08:52,149 WARN L205 SmtUtils]: Spent 6.82 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-06-14 03:08:56,052 WARN L205 SmtUtils]: Spent 984.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-14 03:09:26,110 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-14 03:09:40,372 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 41 [2021-06-14 03:09:57,108 WARN L205 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2021-06-14 03:10:01,263 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2021-06-14 03:10:35,587 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 58 [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-14 03:10:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-14 03:10:53,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-14 03:10:53,626 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-14 03:10:53,627 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-14 03:10:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-14 03:10:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1191056264, now seen corresponding path program 8 times [2021-06-14 03:10:53,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-14 03:10:53,627 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127414647] [2021-06-14 03:10:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-14 03:10:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-14 03:10:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-14 03:10:54,664 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-14 03:10:54,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127414647] [2021-06-14 03:10:54,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127414647] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:10:54,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266615544] [2021-06-14 03:10:54,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:10:54,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-14 03:10:54,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-14 03:10:54,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-14 03:10:54,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-14 03:10:54,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-06-14 03:10:54,810 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,811 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:54,811 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,811 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-14 03:10:54,816 INFO L388 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 [2021-06-14 03:10:54,816 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,819 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:54,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,819 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-14 03:10:54,886 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-14 03:10:54,886 INFO L388 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 [2021-06-14 03:10:54,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:54,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,890 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-14 03:10:54,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-14 03:10:54,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:10:54,905 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,908 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:54,908 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:54,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:10:54,914 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-14 03:10:54,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-14 03:10:54,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:10:55,004 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:55,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-14 03:10:55,005 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-06-14 03:10:56,684 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-14 03:10:56,722 INFO L388 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 25 treesize of output 20 [2021-06-14 03:10:56,723 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:10:56,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:10:56,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-14 03:10:56,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2021-06-14 03:11:02,610 WARN L205 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-14 03:11:10,941 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-14 03:11:22,915 WARN L205 SmtUtils]: Spent 667.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-14 03:11:26,170 WARN L205 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-14 03:11:30,732 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-14 03:11:30,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2021-06-14 03:11:30,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2021-06-14 03:11:30,874 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-14 03:11:30,878 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:11:30,879 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-14 03:11:30,890 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:11:30,895 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-14 03:11:30,895 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:59, output treesize:40 [2021-06-14 03:11:36,788 WARN L205 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-14 03:11:36,812 INFO L388 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 32 treesize of output 27 [2021-06-14 03:11:36,813 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:11:36,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:11:36,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-06-14 03:11:36,830 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:45 [2021-06-14 03:11:45,866 WARN L205 SmtUtils]: Spent 898.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-14 03:11:45,988 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-14 03:11:46,007 INFO L388 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 37 treesize of output 32 [2021-06-14 03:11:46,008 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:11:46,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:11:46,024 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-06-14 03:11:46,024 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55, output treesize:42 [2021-06-14 03:12:39,642 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2021-06-14 03:12:40,484 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |c_t_funThread1of1ForFork0_#t~post43|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-14 03:12:41,192 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-06-14 03:12:41,801 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) |aux_div_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)))) is different from true [2021-06-14 03:12:42,503 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 2) |aux_div_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102))) is different from true [2021-06-14 03:12:42,656 INFO L388 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 32 treesize of output 28 [2021-06-14 03:12:42,657 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-14 03:12:42,669 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-14 03:12:42,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-06-14 03:12:42,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-14 03:12:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 235 trivial. 18 not checked. [2021-06-14 03:12:42,759 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266615544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-14 03:12:42,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-14 03:12:42,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 41 [2021-06-14 03:12:42,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839891909] [2021-06-14 03:12:42,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 41 states [2021-06-14 03:12:42,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-14 03:12:42,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-06-14 03:12:42,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1050, Unknown=82, NotChecked=292, Total=1640 [2021-06-14 03:12:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:12:42,761 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-14 03:12:42,761 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 41 states, 41 states have (on average 5.414634146341464) internal successors, (222), 41 states have internal predecessors, (222), 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) [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2021-06-14 03:12:42,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-14 03:12:42,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-14 03:12:42,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 79 states. [2021-06-14 03:12:42,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2021-06-14 03:12:42,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-14 03:13:58,806 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 39 [2021-06-14 03:14:07,130 WARN L205 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2021-06-14 03:14:16,034 WARN L205 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2021-06-14 03:14:24,405 WARN L205 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2021-06-14 03:14:38,072 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 44 [2021-06-14 03:15:22,739 WARN L205 SmtUtils]: Spent 7.27 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 Received shutdown request... [2021-06-14 03:16:02,181 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-14 03:16:02,181 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-14 03:16:02,186 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/3) [2021-06-14 03:16:02,187 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:16:02,201 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:16:02,201 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:16:02,201 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:16:02,201 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:16:02,201 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:16:02,201 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:16:02,201 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:16:02,202 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-14 03:16:02,204 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-14 03:16:02,204 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/3) [2021-06-14 03:16:02,204 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-14 03:16:02,208 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-14 03:16:02,208 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-14 03:16:02,208 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-14 03:16:02,208 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-14 03:16:02,208 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-14 03:16:02,208 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-14 03:16:02,208 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-14 03:16:02,208 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_fun======== [2021-06-14 03:16:02,209 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-14 03:16:02,210 INFO L301 ceAbstractionStarter]: Result for error location t_fun was TIMEOUT (3/3) [2021-06-14 03:16:02,210 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-14 03:16:02,211 WARN L196 ceAbstractionStarter]: Timeout [2021-06-14 03:16:02,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:16:02 BasicIcfg [2021-06-14 03:16:02,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-14 03:16:02,212 INFO L168 Benchmark]: Toolchain (without parser) took 882139.43 ms. Allocated memory was 177.2 MB in the beginning and 283.1 MB in the end (delta: 105.9 MB). Free memory was 138.7 MB in the beginning and 81.2 MB in the end (delta: 57.5 MB). Peak memory consumption was 164.1 MB. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 177.2 MB. Free memory is still 157.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 INFO L168 Benchmark]: CACSL2BoogieTranslator took 557.96 ms. Allocated memory is still 177.2 MB. Free memory was 138.4 MB in the beginning and 112.9 MB in the end (delta: 25.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.81 ms. Allocated memory is still 177.2 MB. Free memory was 112.9 MB in the beginning and 109.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 INFO L168 Benchmark]: Boogie Preprocessor took 28.66 ms. Allocated memory is still 177.2 MB. Free memory was 109.8 MB in the beginning and 107.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 INFO L168 Benchmark]: RCFGBuilder took 449.15 ms. Allocated memory is still 177.2 MB. Free memory was 107.7 MB in the beginning and 64.7 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 INFO L168 Benchmark]: TraceAbstraction took 881049.73 ms. Allocated memory was 177.2 MB in the beginning and 283.1 MB in the end (delta: 105.9 MB). Free memory was 64.7 MB in the beginning and 81.2 MB in the end (delta: -16.4 MB). Peak memory consumption was 89.5 MB. Max. memory is 8.0 GB. [2021-06-14 03:16:02,212 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.12 ms. Allocated memory is still 177.2 MB. Free memory is still 157.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 557.96 ms. Allocated memory is still 177.2 MB. Free memory was 138.4 MB in the beginning and 112.9 MB in the end (delta: 25.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 49.81 ms. Allocated memory is still 177.2 MB. Free memory was 112.9 MB in the beginning and 109.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 28.66 ms. Allocated memory is still 177.2 MB. Free memory was 109.8 MB in the beginning and 107.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 449.15 ms. Allocated memory is still 177.2 MB. Free memory was 107.7 MB in the beginning and 64.7 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 881049.73 ms. Allocated memory was 177.2 MB in the beginning and 283.1 MB in the end (delta: 105.9 MB). Free memory was 64.7 MB in the beginning and 81.2 MB in the end (delta: -16.4 MB). Peak memory consumption was 89.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8486, positive: 5546, positive conditional: 5546, positive unconditional: 0, negative: 2940, negative conditional: 2940, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 5548, positive: 5546, positive conditional: 5546, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 5548, positive: 5540, positive conditional: 0, positive unconditional: 5540, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, positive: 398, positive conditional: 0, positive unconditional: 398, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 402, positive: 398, positive conditional: 0, positive unconditional: 398, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5548, positive: 5142, positive conditional: 0, positive unconditional: 5142, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45, SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 53, negative conditional: 8, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 10, negative conditional: 6, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 43, negative conditional: 11, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 47, negative conditional: 2, negative unconditional: 45, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 402, Positive conditional cache size: 4, Positive unconditional cache size: 398, Negative cache size: 10, Negative conditional cache size: 6, Negative unconditional cache size: 4, Eliminated conditions: 45 ], Maximal queried relation: 11, Independence queries for same thread: 2938 - 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: DistributingIndependenceRelation.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] , DistributingIndependenceRelation.Statistics on underlying relations: [ 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] , 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: 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 ], Maximal queried relation: -1, Independence queries for same thread: 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: DistributingIndependenceRelation.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] , DistributingIndependenceRelation.Statistics on underlying relations: [ 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] , 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: 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 ], Maximal queried relation: -1, Independence queries for same thread: 0 - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 51 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing SleepSetNewStateReduction. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing SleepSetNewStateReduction. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 880937.4ms, OverallIterations: 12, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.0ms, PartialOrderReductionTime: 743400.5ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 318, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 218.2ms SsaConstructionTime, 894.9ms SatisfiabilityAnalysisTime, 133482.4ms InterpolantComputationTime, 2777 NumberOfCodeBlocks, 2695 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2754 ConstructedInterpolants, 190 QuantifiedInterpolants, 27071 SizeOfPredicates, 178 NumberOfNonLiveVariables, 2565 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 23 InterpolantComputations, 1 PerfectInterpolantSequences, 1626/2809 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, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 16.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.9ms, PartialOrderReductionTime: 0.1ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_fun with 1 thread instances CFG has 3 procedures, 249 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 4.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms 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