/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_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 23:23:31,659 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 23:23:31,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 23:23:31,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 23:23:31,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 23:23:31,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 23:23:31,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 23:23:31,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 23:23:31,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 23:23:31,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 23:23:31,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 23:23:31,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 23:23:31,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 23:23:31,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 23:23:31,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 23:23:31,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 23:23:31,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 23:23:31,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 23:23:31,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 23:23:31,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 23:23:31,736 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 23:23:31,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 23:23:31,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 23:23:31,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 23:23:31,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 23:23:31,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 23:23:31,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 23:23:31,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 23:23:31,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 23:23:31,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 23:23:31,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 23:23:31,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 23:23:31,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 23:23:31,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 23:23:31,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 23:23:31,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 23:23:31,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 23:23:31,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 23:23:31,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 23:23:31,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 23:23:31,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 23:23:31,757 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-16 23:23:31,791 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 23:23:31,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 23:23:31,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-16 23:23:31,792 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-16 23:23:31,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 23:23:31,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 23:23:31,795 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 23:23:31,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 23:23:31,795 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 23:23:31,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 23:23:31,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 23:23:31,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 23:23:31,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 23:23:31,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 23:23:31,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 23:23:31,797 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 23:23:31,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 23:23:31,797 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 23:23:31,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 23:23:31,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 23:23:31,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 23:23:31,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 23:23:31,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 23:23:31,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 23:23:31,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 23:23:31,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 23:23:31,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 23:23:31,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 23:23:31,808 INFO L138 SettingsManager]: * DFS Order used in POR=RANDOM [2021-06-16 23:23:31,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 23:23:31,808 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 23:23:31,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-16 23:23:31,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 23:23:31,809 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2021-06-16 23:23:31,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-16 23:23:31,809 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-16 23:23:32,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 23:23:32,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 23:23:32,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 23:23:32,187 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-16 23:23:32,187 INFO L275 PluginConnector]: CDTParser initialized [2021-06-16 23:23:32,188 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-06-16 23:23:32,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e2c70a1/6796a19c00a04c4fa07d7f940ed9fbb8/FLAG31b7bd877 [2021-06-16 23:23:32,664 INFO L306 CDTParser]: Found 1 translation units. [2021-06-16 23:23:32,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-06-16 23:23:32,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e2c70a1/6796a19c00a04c4fa07d7f940ed9fbb8/FLAG31b7bd877 [2021-06-16 23:23:33,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13e2c70a1/6796a19c00a04c4fa07d7f940ed9fbb8 [2021-06-16 23:23:33,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 23:23:33,022 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-16 23:23:33,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-16 23:23:33,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-16 23:23:33,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-16 23:23:33,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23257d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33, skipping insertion in model container [2021-06-16 23:23:33,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-16 23:23:33,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-16 23:23:33,537 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_71-funloop_racing.i[41060,41073] [2021-06-16 23:23:33,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 23:23:33,595 INFO L203 MainTranslator]: Completed pre-run [2021-06-16 23:23:33,663 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_71-funloop_racing.i[41060,41073] [2021-06-16 23:23:33,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 23:23:33,766 INFO L208 MainTranslator]: Completed translation [2021-06-16 23:23:33,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33 WrapperNode [2021-06-16 23:23:33,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-16 23:23:33,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 23:23:33,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 23:23:33,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 23:23:33,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 23:23:33,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 23:23:33,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 23:23:33,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 23:23:33,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,834 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (1/1) ... [2021-06-16 23:23:33,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 23:23:33,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 23:23:33,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 23:23:33,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 23:23:33,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (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-16 23:23:33,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-16 23:23:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-16 23:23:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-16 23:23:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-16 23:23:33,923 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-16 23:23:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-16 23:23:33,924 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-16 23:23:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-16 23:23:33,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 23:23:33,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 23:23:33,929 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-16 23:23:34,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 23:23:34,567 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-06-16 23:23:34,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 11:23:34 BoogieIcfgContainer [2021-06-16 23:23:34,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 23:23:34,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 23:23:34,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 23:23:34,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 23:23:34,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.06 11:23:33" (1/3) ... [2021-06-16 23:23:34,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239730c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 11:23:34, skipping insertion in model container [2021-06-16 23:23:34,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 11:23:33" (2/3) ... [2021-06-16 23:23:34,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239730c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 11:23:34, skipping insertion in model container [2021-06-16 23:23:34,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 11:23:34" (3/3) ... [2021-06-16 23:23:34,574 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2021-06-16 23:23:34,579 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 23:23:34,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 23:23:34,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-06-16 23:23:34,580 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 23:23:34,607 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,607 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,607 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,607 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,607 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,608 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,609 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,610 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,610 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-16 23:23:34,610 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-16 23:23:34,610 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,610 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-16 23:23:34,610 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-16 23:23:34,610 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,611 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,612 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,613 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,613 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,613 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,613 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,613 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-16 23:23:34,613 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-16 23:23:34,613 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,613 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 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-16 23:23:34,614 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-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,614 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,615 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,616 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,617 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,618 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,619 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,620 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,621 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,622 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,623 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,624 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,625 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,626 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,627 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,628 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,628 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,630 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,630 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,630 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,630 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,630 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,631 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 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-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,632 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 23:23:34,633 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-16 23:23:34,645 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-16 23:23:34,665 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-16 23:23:34,706 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 23:23:34,706 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 23:23:34,706 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 23:23:34,706 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 23:23:34,707 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 23:23:34,707 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 23:23:34,707 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 23:23:34,707 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== [2021-06-16 23:23:34,782 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:34,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:34,786 INFO L82 PathProgramCache]: Analyzing trace with hash 991506688, now seen corresponding path program 1 times [2021-06-16 23:23:34,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:34,794 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711878926] [2021-06-16 23:23:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:34,929 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-16 23:23:34,930 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:34,930 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711878926] [2021-06-16 23:23:34,931 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711878926] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 23:23:34,931 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 23:23:34,931 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 23:23:34,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310165511] [2021-06-16 23:23:34,936 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-16 23:23:34,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-16 23:23:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-16 23:23:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:34,949 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:34,951 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 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-16 23:23:34,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,007 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 23:23:35,008 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:35,009 INFO L82 PathProgramCache]: Analyzing trace with hash 68823105, now seen corresponding path program 1 times [2021-06-16 23:23:35,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:35,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401464777] [2021-06-16 23:23:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:35,112 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-16 23:23:35,113 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:35,113 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401464777] [2021-06-16 23:23:35,113 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401464777] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 23:23:35,113 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 23:23:35,113 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-16 23:23:35,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006507176] [2021-06-16 23:23:35,115 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 23:23:35,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:35,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 23:23:35,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 23:23:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,116 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:35,116 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-16 23:23:35,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:35,162 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 23:23:35,162 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:35,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:35,163 INFO L82 PathProgramCache]: Analyzing trace with hash 927147778, now seen corresponding path program 1 times [2021-06-16 23:23:35,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:35,164 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446148457] [2021-06-16 23:23:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:35,257 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-16 23:23:35,257 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:35,257 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446148457] [2021-06-16 23:23:35,258 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446148457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:35,258 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870585848] [2021-06-16 23:23:35,258 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-16 23:23:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:35,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-16 23:23:35,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:23:35,588 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-16 23:23:35,588 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870585848] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:35,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:23:35,589 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-16 23:23:35,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847941300] [2021-06-16 23:23:35,589 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 23:23:35,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 23:23:35,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-16 23:23:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,591 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:35,591 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-16 23:23:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:35,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:35,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:35,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:23:35,877 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1969240289, now seen corresponding path program 2 times [2021-06-16 23:23:35,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:35,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028358385] [2021-06-16 23:23:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:35,977 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-16 23:23:35,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:35,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028358385] [2021-06-16 23:23:35,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028358385] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:35,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584110144] [2021-06-16 23:23:35,978 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-16 23:23:36,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-16 23:23:36,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:23:36,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-16 23:23:36,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:23:36,298 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-16 23:23:36,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584110144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:36,299 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:23:36,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-16 23:23:36,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636054472] [2021-06-16 23:23:36,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-16 23:23:36,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-16 23:23:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-16 23:23:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:36,301 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:36,301 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-16 23:23:36,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:36,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:36,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:36,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:36,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:36,624 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:23:36,625 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:36,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash 5143138, now seen corresponding path program 3 times [2021-06-16 23:23:36,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:36,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833392544] [2021-06-16 23:23:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:36,737 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-16 23:23:36,737 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:36,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833392544] [2021-06-16 23:23:36,737 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833392544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:36,737 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287950881] [2021-06-16 23:23:36,738 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-16 23:23:36,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-16 23:23:36,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:23:36,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-16 23:23:36,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:23:36,882 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-16 23:23:36,883 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:36,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:36,888 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:36,888 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-16 23:23:36,905 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-16 23:23:36,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:36,910 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:36,911 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:36,911 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-16 23:23:36,979 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-16 23:23:36,979 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-16 23:23:36,982 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:36,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:36,986 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:36,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-16 23:23:37,028 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-16 23:23:37,034 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-16 23:23:37,035 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:37,040 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:37,041 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:37,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:37,054 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-16 23:23:37,054 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-16 23:23:37,117 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-16 23:23:37,122 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-16 23:23:37,123 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:37,127 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:37,128 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:37,134 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:37,137 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-16 23:23:37,137 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-16 23:23:37,200 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-16 23:23:37,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:37,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:37,205 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-16 23:23:37,205 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-16 23:23:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-06-16 23:23:37,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287950881] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:37,267 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:23:37,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2021-06-16 23:23:37,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13081003] [2021-06-16 23:23:37,268 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-16 23:23:37,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-16 23:23:37,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-16 23:23:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:37,270 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:37,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 6.277777777777778) internal successors, (113), 18 states have internal predecessors, (113), 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-16 23:23:37,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:37,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:37,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:37,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:37,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:23:38,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:23:38,217 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1829711248, now seen corresponding path program 1 times [2021-06-16 23:23:38,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:38,218 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581252748] [2021-06-16 23:23:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-06-16 23:23:38,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:38,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581252748] [2021-06-16 23:23:38,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581252748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:38,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185852857] [2021-06-16 23:23:38,377 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-16 23:23:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:38,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-16 23:23:38,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:23:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-06-16 23:23:38,727 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185852857] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:38,727 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:23:38,727 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-16 23:23:38,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892139617] [2021-06-16 23:23:38,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-16 23:23:38,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:38,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-16 23:23:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-16 23:23:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:38,731 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:38,731 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 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-16 23:23:38,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:38,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:38,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:38,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:38,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:23:38,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:23:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:23:39,088 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-06-16 23:23:39,088 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:39,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:39,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1333379439, now seen corresponding path program 2 times [2021-06-16 23:23:39,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:39,089 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649857353] [2021-06-16 23:23:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-06-16 23:23:39,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:39,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649857353] [2021-06-16 23:23:39,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649857353] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:39,234 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063643064] [2021-06-16 23:23:39,234 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-16 23:23:39,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-16 23:23:39,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:23:39,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-16 23:23:39,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:23:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-06-16 23:23:39,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063643064] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:39,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:23:39,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-16 23:23:39,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670778227] [2021-06-16 23:23:39,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-16 23:23:39,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-16 23:23:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-16 23:23:39,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:39,598 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:39,598 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 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-16 23:23:39,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:39,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:39,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:39,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:39,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:23:39,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:23:39,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:23:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:23:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:23:40,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:23:40,009 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:23:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:23:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 59156016, now seen corresponding path program 3 times [2021-06-16 23:23:40,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:23:40,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425563820] [2021-06-16 23:23:40,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:23:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:23:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-06-16 23:23:40,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:23:40,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425563820] [2021-06-16 23:23:40,169 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425563820] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:40,169 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043416496] [2021-06-16 23:23:40,169 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-16 23:23:40,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-16 23:23:40,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:23:40,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-16 23:23:40,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:23:40,297 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-16 23:23:40,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,301 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,301 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-16 23:23:40,326 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-16 23:23:40,327 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,332 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,332 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-16 23:23:40,423 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-16 23:23:40,424 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-16 23:23:40,427 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,432 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-16 23:23:40,468 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-16 23:23:40,474 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-16 23:23:40,475 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,479 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,480 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,485 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,487 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-16 23:23:40,487 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-16 23:23:40,543 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-16 23:23:40,551 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-16 23:23:40,553 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,557 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,558 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,564 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,566 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-16 23:23:40,566 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-16 23:23:40,722 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-16 23:23:40,723 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:40,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:40,731 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-16 23:23:40,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2021-06-16 23:23:41,413 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-16 23:23:41,504 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-16 23:23:41,505 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:41,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:41,516 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-16 23:23:41,517 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-06-16 23:23:41,869 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-16 23:23:42,672 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-16 23:23:43,310 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-16 23:23:43,849 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-16 23:23:44,461 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-16 23:23:44,749 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-16 23:23:44,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:23:44,764 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:23:44,778 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-16 23:23:44,778 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-16 23:23:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 86 trivial. 25 not checked. [2021-06-16 23:23:44,955 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043416496] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:23:44,955 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:23:44,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2021-06-16 23:23:44,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659763302] [2021-06-16 23:23:44,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-16 23:23:44,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:23:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-16 23:23:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=516, Unknown=6, NotChecked=250, Total=870 [2021-06-16 23:23:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:44,957 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:23:44,957 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 7.233333333333333) internal successors, (217), 30 states have internal predecessors, (217), 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-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:23:44,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:23:47,992 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-06-16 23:23:49,417 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-06-16 23:23:52,319 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:24:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:24:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:24:30,857 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:24:30,857 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:24:30,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:24:30,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1824932816, now seen corresponding path program 4 times [2021-06-16 23:24:30,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:24:30,858 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366831260] [2021-06-16 23:24:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:24:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:24:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-06-16 23:24:31,056 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:24:31,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366831260] [2021-06-16 23:24:31,056 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366831260] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:24:31,056 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059870465] [2021-06-16 23:24:31,057 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-16 23:24:31,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-16 23:24:31,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:24:31,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-16 23:24:31,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:24:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-06-16 23:24:31,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059870465] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:24:31,386 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:24:31,386 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-16 23:24:31,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493429144] [2021-06-16 23:24:31,389 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-16 23:24:31,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:24:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-16 23:24:31,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-16 23:24:31,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:31,390 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:24:31,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.526315789473684) internal successors, (124), 19 states have internal predecessors, (124), 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-16 23:24:31,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:31,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:24:31,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:24:31,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:24:31,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:31,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:24:31,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:24:31,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:24:31,391 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:24:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:24:31,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:31,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-16 23:24:31,896 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:24:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:24:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1006599183, now seen corresponding path program 5 times [2021-06-16 23:24:31,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:24:31,897 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889417451] [2021-06-16 23:24:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:24:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:24:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-06-16 23:24:32,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:24:32,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889417451] [2021-06-16 23:24:32,164 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889417451] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:24:32,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894396521] [2021-06-16 23:24:32,164 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-16 23:24:33,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2021-06-16 23:24:33,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:24:33,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-16 23:24:33,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:24:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-06-16 23:24:33,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894396521] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:24:33,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:24:33,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-16 23:24:33,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158726401] [2021-06-16 23:24:33,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-16 23:24:33,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:24:33,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-16 23:24:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-16 23:24:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:33,430 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:24:33,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 6.142857142857143) internal successors, (129), 21 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:33,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-16 23:24:34,020 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:24:34,021 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:24:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:24:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1333670000, now seen corresponding path program 6 times [2021-06-16 23:24:34,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:24:34,022 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532927250] [2021-06-16 23:24:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:24:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:24:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2021-06-16 23:24:34,315 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:24:34,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532927250] [2021-06-16 23:24:34,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532927250] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:24:34,316 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810118431] [2021-06-16 23:24:34,316 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-16 23:24:34,504 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-06-16 23:24:34,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:24:34,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-16 23:24:34,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:24:34,532 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-16 23:24:34,535 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,537 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,537 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,537 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-16 23:24:34,560 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-16 23:24:34,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,566 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-16 23:24:34,695 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-16 23:24:34,695 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-16 23:24:34,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,701 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-16 23:24:34,739 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-16 23:24:34,748 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-16 23:24:34,749 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,755 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,762 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-16 23:24:34,762 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-16 23:24:34,801 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-16 23:24:34,805 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-16 23:24:34,805 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,810 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,811 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:24:34,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:34,818 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-16 23:24:34,818 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-16 23:24:34,957 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:34,957 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,132 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_45| (Array Int (Array Int Int)))) (and (= |c_#memory_int| (store |v_#memory_int_45| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base (let ((.cse0 (select |v_#memory_int_45| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base))) (store .cse0 c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ (select .cse0 c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) 1))))) (= (select |v_#memory_int_45| |c_~#cache~0.base|) ((as const (Array Int Int)) 0)))) is different from true [2021-06-16 23:24:36,157 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,157 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,196 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,197 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,238 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,238 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,272 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,272 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,311 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,311 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,352 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,353 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,394 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,394 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:36,923 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-16 23:24:36,947 INFO L354 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 23:24:36,948 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 34 [2021-06-16 23:24:37,928 WARN L205 SmtUtils]: Spent 929.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-16 23:24:37,946 INFO L354 Elim1Store]: treesize reduction 28, result has 15.2 percent of original size [2021-06-16 23:24:37,947 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2021-06-16 23:24:37,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 7 [2021-06-16 23:24:37,952 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:37,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:37,954 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:24:37,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:37,955 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-16 23:24:37,955 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:6 [2021-06-16 23:24:38,114 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-16 23:24:38,115 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:24:38,117 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:24:38,118 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-16 23:24:38,118 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-16 23:24:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2021-06-16 23:24:38,214 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810118431] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:24:38,214 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:24:38,214 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2021-06-16 23:24:38,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776094565] [2021-06-16 23:24:38,215 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-16 23:24:38,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:24:38,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-16 23:24:38,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1036, Unknown=1, NotChecked=66, Total=1260 [2021-06-16 23:24:38,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:38,216 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:24:38,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 6.194444444444445) internal successors, (223), 36 states have internal predecessors, (223), 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-16 23:24:38,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:38,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:24:38,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-16 23:24:38,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:24:43,591 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 26 [2021-06-16 23:24:44,394 WARN L205 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2021-06-16 23:24:44,913 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-16 23:24:52,642 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-16 23:25:35,664 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 22 [2021-06-16 23:25:37,178 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 26 [2021-06-16 23:25:38,516 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 28 [2021-06-16 23:25:54,716 WARN L205 SmtUtils]: Spent 728.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-06-16 23:26:43,731 WARN L205 SmtUtils]: Spent 835.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-16 23:27:23,468 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-16 23:28:14,264 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:28:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:28:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-16 23:28:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:28:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-16 23:28:23,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-06-16 23:28:23,989 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:28:23,989 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:28:23,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:28:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash -329583040, now seen corresponding path program 7 times [2021-06-16 23:28:23,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:28:23,990 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556662837] [2021-06-16 23:28:23,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:28:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:28:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-16 23:28:24,537 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:28:24,537 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556662837] [2021-06-16 23:28:24,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556662837] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:28:24,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58914972] [2021-06-16 23:28:24,538 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-16 23:28:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:28:24,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 31 conjunts are in the unsatisfiable core [2021-06-16 23:28:24,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:28:24,727 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-16 23:28:24,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,730 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:24,731 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-16 23:28:24,739 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-16 23:28:24,740 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:24,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,745 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-16 23:28:24,845 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-16 23:28:24,845 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-16 23:28:24,847 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:24,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,852 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-16 23:28:24,868 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-16 23:28:24,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-16 23:28:24,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:24,880 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:28:24,886 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:24,887 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-16 23:28:24,887 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-16 23:28:25,002 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 20 treesize of output 15 [2021-06-16 23:28:25,003 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:25,011 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:25,012 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-16 23:28:25,012 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-06-16 23:28:25,890 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-16 23:28:25,941 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-16 23:28:25,947 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-16 23:28:25,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:25,953 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:25,953 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:28:25,963 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:25,966 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-16 23:28:25,966 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-06-16 23:28:27,294 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-16 23:28:27,312 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-16 23:28:27,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:27,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:27,321 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-16 23:28:27,321 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-06-16 23:28:27,881 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-16 23:28:28,678 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-16 23:28:29,440 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-16 23:28:30,212 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-16 23:28:31,099 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-16 23:28:31,298 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-16 23:28:31,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:28:31,317 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:28:31,328 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-16 23:28:31,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-16 23:28:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 240 trivial. 26 not checked. [2021-06-16 23:28:31,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58914972] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:28:31,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:28:31,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2021-06-16 23:28:31,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039501740] [2021-06-16 23:28:31,422 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-16 23:28:31,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:28:31,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-16 23:28:31,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=420, Unknown=8, NotChecked=230, Total=756 [2021-06-16 23:28:31,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:28:31,423 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:28:31,423 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 6.142857142857143) internal successors, (172), 28 states have internal predecessors, (172), 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-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:28:31,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:28:31,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2021-06-16 23:28:31,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:28:31,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-16 23:28:31,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2021-06-16 23:28:31,424 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:28:36,352 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-06-16 23:28:49,230 WARN L205 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-06-16 23:28:58,356 WARN L205 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2021-06-16 23:29:06,953 WARN L205 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2021-06-16 23:29:12,713 WARN L205 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-06-16 23:29:19,491 WARN L205 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-16 23:29:38,439 WARN L205 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-16 23:29:42,471 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-16 23:29:55,620 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-06-16 23:30:16,825 WARN L205 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-06-16 23:30:48,102 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2021-06-16 23:31:03,793 WARN L205 SmtUtils]: Spent 2.71 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-06-16 23:31:17,311 WARN L205 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-16 23:31:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-06-16 23:31:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:31:26,673 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:31:26,674 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 23:31:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 23:31:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1406009871, now seen corresponding path program 8 times [2021-06-16 23:31:26,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 23:31:26,674 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460775457] [2021-06-16 23:31:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 23:31:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 23:31:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 6 proven. 84 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-16 23:31:27,386 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 23:31:27,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460775457] [2021-06-16 23:31:27,386 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460775457] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:31:27,386 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728034711] [2021-06-16 23:31:27,386 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-16 23:31:27,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-16 23:31:27,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-16 23:31:27,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-16 23:31:27,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-16 23:31:27,522 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-16 23:31:27,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:27,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-16 23:31:27,533 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-16 23:31:27,534 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,538 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:27,538 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-16 23:31:27,629 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-16 23:31:27,629 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-16 23:31:27,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:27,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,635 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-16 23:31:27,649 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-16 23:31:27,654 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-16 23:31:27,655 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,658 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:27,659 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,664 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:27,665 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-16 23:31:27,665 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-16 23:31:27,808 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 20 treesize of output 15 [2021-06-16 23:31:27,809 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:31:27,817 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:27,818 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-16 23:31:27,818 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-06-16 23:31:29,123 WARN L205 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-16 23:31:29,182 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-16 23:31:29,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:31:29,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:31:29,193 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-16 23:31:29,193 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2021-06-16 23:31:34,226 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-16 23:31:42,748 WARN L205 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-16 23:31:57,310 WARN L205 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-16 23:32:01,392 WARN L205 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-16 23:32:01,641 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-16 23:32:01,648 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-16 23:32:01,649 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-16 23:32:01,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:32:01,655 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-16 23:32:01,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:32:01,676 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-16 23:32:01,676 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:30 [2021-06-16 23:32:02,507 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-16 23:32:03,347 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-16 23:32:04,090 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-16 23:32:04,716 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-16 23:32:05,432 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-16 23:32:05,631 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-16 23:32:05,632 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-16 23:32:05,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 23:32:05,663 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-16 23:32:05,663 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-16 23:32:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 240 trivial. 46 not checked. [2021-06-16 23:32:05,746 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728034711] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-16 23:32:05,746 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-16 23:32:05,746 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 36 [2021-06-16 23:32:05,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757780906] [2021-06-16 23:32:05,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 36 states [2021-06-16 23:32:05,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 23:32:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-06-16 23:32:05,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=753, Unknown=39, NotChecked=310, Total=1260 [2021-06-16 23:32:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:32:05,748 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-16 23:32:05,748 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 36 states, 36 states have (on average 6.111111111111111) internal successors, (220), 36 states have internal predecessors, (220), 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-16 23:32:05,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:32:05,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-16 23:32:05,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-06-16 23:32:05,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-06-16 23:32:05,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2021-06-16 23:32:05,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-16 23:32:25,369 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 33 [2021-06-16 23:34:59,472 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-06-16 23:35:05,939 WARN L205 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2021-06-16 23:35:12,717 WARN L205 SmtUtils]: Spent 2.75 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2021-06-16 23:35:17,513 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-06-16 23:35:21,126 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2021-06-16 23:35:27,162 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-06-16 23:35:31,976 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-16 23:35:41,649 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-16 23:35:49,893 WARN L205 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 49 [2021-06-16 23:35:56,168 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2021-06-16 23:36:03,859 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2021-06-16 23:36:15,616 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2021-06-16 23:36:26,236 WARN L205 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2021-06-16 23:36:30,585 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2021-06-16 23:36:39,738 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2021-06-16 23:36:50,768 WARN L205 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 94 DAG size of output: 53 [2021-06-16 23:36:57,099 WARN L205 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-06-16 23:37:06,038 WARN L205 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 86 DAG size of output: 54 [2021-06-16 23:37:11,833 WARN L205 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2021-06-16 23:37:17,670 WARN L205 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2021-06-16 23:37:24,658 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2021-06-16 23:37:29,867 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2021-06-16 23:37:35,011 WARN L205 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2021-06-16 23:37:40,091 WARN L205 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2021-06-16 23:37:46,614 WARN L205 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2021-06-16 23:37:55,760 WARN L205 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 102 DAG size of output: 68 Received shutdown request... [2021-06-16 23:38:06,357 WARN L222 SmtUtils]: Removed 2 from assertion stack [2021-06-16 23:38:06,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-16 23:38:06,558 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-16 23:38:06,564 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/3) [2021-06-16 23:38:06,565 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-16 23:38:06,569 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 23:38:06,569 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 23:38:06,569 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 23:38:06,569 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 23:38:06,569 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 23:38:06,569 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 23:38:06,569 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 23:38:06,570 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 23:38:06,573 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-16 23:38:06,575 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/3) [2021-06-16 23:38:06,575 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-16 23:38:06,584 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 23:38:06,584 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 23:38:06,584 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 23:38:06,584 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 23:38:06,584 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 23:38:06,584 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 23:38:06,584 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 23:38:06,584 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_fun======== [2021-06-16 23:38:06,587 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-16 23:38:06,588 INFO L301 ceAbstractionStarter]: Result for error location t_fun was TIMEOUT (3/3) [2021-06-16 23:38:06,588 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 23:38:06,590 WARN L196 ceAbstractionStarter]: Timeout [2021-06-16 23:38:06,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 11:38:06 BasicIcfg [2021-06-16 23:38:06,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 23:38:06,590 INFO L168 Benchmark]: Toolchain (without parser) took 873568.73 ms. Allocated memory was 204.5 MB in the beginning and 307.2 MB in the end (delta: 102.8 MB). Free memory was 167.9 MB in the beginning and 82.7 MB in the end (delta: 85.2 MB). Peak memory consumption was 189.0 MB. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 204.5 MB. Free memory is still 186.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.04 ms. Allocated memory is still 204.5 MB. Free memory was 167.7 MB in the beginning and 144.5 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.28 ms. Allocated memory is still 204.5 MB. Free memory was 144.5 MB in the beginning and 141.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 INFO L168 Benchmark]: Boogie Preprocessor took 50.19 ms. Allocated memory is still 204.5 MB. Free memory was 141.8 MB in the beginning and 139.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 INFO L168 Benchmark]: RCFGBuilder took 700.01 ms. Allocated memory is still 204.5 MB. Free memory was 139.7 MB in the beginning and 156.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 INFO L168 Benchmark]: TraceAbstraction took 872020.69 ms. Allocated memory was 204.5 MB in the beginning and 307.2 MB in the end (delta: 102.8 MB). Free memory was 156.2 MB in the beginning and 82.7 MB in the end (delta: 73.5 MB). Peak memory consumption was 176.3 MB. Max. memory is 8.0 GB. [2021-06-16 23:38:06,591 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.16 ms. Allocated memory is still 204.5 MB. Free memory is still 186.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 742.04 ms. Allocated memory is still 204.5 MB. Free memory was 167.7 MB in the beginning and 144.5 MB in the end (delta: 23.2 MB). Peak memory consumption was 23.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.28 ms. Allocated memory is still 204.5 MB. Free memory was 144.5 MB in the beginning and 141.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 50.19 ms. Allocated memory is still 204.5 MB. Free memory was 141.8 MB in the beginning and 139.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 700.01 ms. Allocated memory is still 204.5 MB. Free memory was 139.7 MB in the beginning and 156.7 MB in the end (delta: -17.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 872020.69 ms. Allocated memory was 204.5 MB in the beginning and 307.2 MB in the end (delta: 102.8 MB). Free memory was 156.2 MB in the beginning and 82.7 MB in the end (delta: 73.5 MB). Peak memory consumption was 176.3 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: 10524, positive: 6854, positive conditional: 6854, positive unconditional: 0, negative: 3670, negative conditional: 3670, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 6856, positive: 6854, positive conditional: 6854, 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: 6856, positive: 6844, positive conditional: 0, positive unconditional: 6844, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 428, positive: 423, positive conditional: 0, positive unconditional: 423, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 428, positive: 423, positive conditional: 0, positive unconditional: 423, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6856, positive: 6421, positive conditional: 0, positive unconditional: 6421, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 428, unknown conditional: 0, unknown unconditional: 428] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84, SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 101, negative conditional: 17, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 16, negative conditional: 11, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 54, negative conditional: 25, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 111, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 90, negative conditional: 6, negative unconditional: 84, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 429, Positive conditional cache size: 6, Positive unconditional cache size: 423, Negative cache size: 16, Negative conditional cache size: 11, Negative unconditional cache size: 5, Eliminated conditions: 84 ], Maximal queried relation: 12, Independence queries for same thread: 3668 - 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 PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 105 for 1ms.. - 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, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 871887.2ms, OverallIterations: 13, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.8ms, PartialOrderReductionTime: 808949.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 324, 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: 281.9ms SsaConstructionTime, 1709.5ms SatisfiabilityAnalysisTime, 57733.5ms InterpolantComputationTime, 3138 NumberOfCodeBlocks, 3005 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3114 ConstructedInterpolants, 133 QuantifiedInterpolants, 20509 SizeOfPredicates, 168 NumberOfNonLiveVariables, 2772 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 2064/3366 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, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 8.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3.0ms, 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, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 11.9ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.5ms, 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