/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-varabs.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 08:53:50,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 08:53:50,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 08:53:50,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 08:53:50,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 08:53:50,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 08:53:50,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 08:53:50,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 08:53:50,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 08:53:50,738 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 08:53:50,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 08:53:50,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 08:53:50,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 08:53:50,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 08:53:50,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 08:53:50,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 08:53:50,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 08:53:50,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 08:53:50,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 08:53:50,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 08:53:50,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 08:53:50,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 08:53:50,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 08:53:50,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 08:53:50,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 08:53:50,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 08:53:50,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 08:53:50,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 08:53:50,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 08:53:50,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 08:53:50,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 08:53:50,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 08:53:50,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 08:53:50,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 08:53:50,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 08:53:50,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 08:53:50,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 08:53:50,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 08:53:50,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 08:53:50,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 08:53:50,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 08:53:50,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-varabs.epf [2022-02-11 08:53:50,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 08:53:50,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 08:53:50,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 08:53:50,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 08:53:50,805 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 08:53:50,805 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 08:53:50,806 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 08:53:50,806 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 08:53:50,806 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 08:53:50,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 08:53:50,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 08:53:50,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 08:53:50,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 08:53:50,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 08:53:50,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 08:53:50,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 08:53:50,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 08:53:50,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 08:53:50,809 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 08:53:50,809 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-02-11 08:53:50,810 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 08:53:50,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 08:53:50,810 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 08:53:50,810 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-11 08:53:50,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-02-11 08:53:51,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 08:53:51,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 08:53:51,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 08:53:51,040 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-11 08:53:51,041 INFO L275 PluginConnector]: CDTParser initialized [2022-02-11 08:53:51,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-02-11 08:53:51,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ef306cd/fd0d64c94f984cc19fdd6974a886c77c/FLAG7b226a6e2 [2022-02-11 08:53:51,498 INFO L306 CDTParser]: Found 1 translation units. [2022-02-11 08:53:51,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-02-11 08:53:51,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ef306cd/fd0d64c94f984cc19fdd6974a886c77c/FLAG7b226a6e2 [2022-02-11 08:53:51,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76ef306cd/fd0d64c94f984cc19fdd6974a886c77c [2022-02-11 08:53:51,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 08:53:51,867 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-11 08:53:51,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-11 08:53:51,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-11 08:53:51,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-11 08:53:51,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 08:53:51" (1/1) ... [2022-02-11 08:53:51,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fb3eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:51, skipping insertion in model container [2022-02-11 08:53:51,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 08:53:51" (1/1) ... [2022-02-11 08:53:51,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-11 08:53:51,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-11 08:53:52,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-02-11 08:53:52,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 08:53:52,387 INFO L203 MainTranslator]: Completed pre-run [2022-02-11 08:53:52,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-02-11 08:53:52,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 08:53:52,491 INFO L208 MainTranslator]: Completed translation [2022-02-11 08:53:52,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52 WrapperNode [2022-02-11 08:53:52,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-11 08:53:52,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 08:53:52,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 08:53:52,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 08:53:52,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,536 INFO L137 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2022-02-11 08:53:52,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 08:53:52,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 08:53:52,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 08:53:52,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 08:53:52,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,570 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,594 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 08:53:52,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 08:53:52,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 08:53:52,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 08:53:52,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (1/1) ... [2022-02-11 08:53:52,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 08:53:52,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:53:52,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-11 08:53:52,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-11 08:53:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-11 08:53:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-11 08:53:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-11 08:53:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-11 08:53:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-11 08:53:52,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-11 08:53:52,686 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-11 08:53:52,687 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-11 08:53:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-11 08:53:52,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 08:53:52,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 08:53:52,689 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 08:53:52,821 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 08:53:52,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 08:53:53,103 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 08:53:53,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 08:53:53,111 INFO L299 CfgBuilder]: Removed 35 assume(true) statements. [2022-02-11 08:53:53,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 08:53:53 BoogieIcfgContainer [2022-02-11 08:53:53,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 08:53:53,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 08:53:53,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 08:53:53,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 08:53:53,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.02 08:53:51" (1/3) ... [2022-02-11 08:53:53,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da23bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 08:53:53, skipping insertion in model container [2022-02-11 08:53:53,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 08:53:52" (2/3) ... [2022-02-11 08:53:53,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da23bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 08:53:53, skipping insertion in model container [2022-02-11 08:53:53,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 08:53:53" (3/3) ... [2022-02-11 08:53:53,128 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2022-02-11 08:53:53,133 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 08:53:53,133 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 08:53:53,133 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-11 08:53:53,133 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 08:53:53,181 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,181 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,181 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,181 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,182 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,182 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,182 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,182 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,182 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,182 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,183 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,183 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,183 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,183 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,183 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,184 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,184 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,184 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,184 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,184 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,185 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,185 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,185 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,185 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,185 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,185 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,186 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,187 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,188 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,189 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,190 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,190 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,190 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,190 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,190 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,190 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,191 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,194 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,195 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,195 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,195 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,196 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,196 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,196 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,196 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,196 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,196 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,197 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,197 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,197 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,197 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,197 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,197 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,198 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,198 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,198 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,198 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,198 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,199 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,199 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,199 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,199 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,199 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,199 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,200 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,200 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,200 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,200 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,200 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,200 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,201 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,202 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,202 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,202 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,202 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,202 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,203 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,204 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,204 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,204 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,204 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,205 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,205 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,205 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,205 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,205 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,205 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,206 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,207 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,207 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,207 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,208 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,208 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,208 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,208 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,208 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,208 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,209 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,210 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,211 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,211 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,217 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,218 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,219 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,219 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,219 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,219 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,219 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,219 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,220 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,221 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:53:53,229 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-11 08:53:53,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 08:53:53,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:53:53,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 08:53:53,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-11 08:53:53,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-02-11 08:53:53,324 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 08:53:53,324 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 08:53:54,566 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:53:54,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:53:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash -864512959, now seen corresponding path program 1 times [2022-02-11 08:53:54,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:53:54,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89359636] [2022-02-11 08:53:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:53:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:53:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-11 08:53:54,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:53:54,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89359636] [2022-02-11 08:53:54,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89359636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:53:54,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 08:53:54,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 08:53:54,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696972649] [2022-02-11 08:53:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:53:54,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 08:53:54,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:53:54,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 08:53:54,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 08:53:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:54,871 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:53:54,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 60.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:53:54,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:54,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:54,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable0 [2022-02-11 08:53:54,904 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:53:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:53:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1940418564, now seen corresponding path program 1 times [2022-02-11 08:53:54,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:53:54,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988456060] [2022-02-11 08:53:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:53:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:53:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-11 08:53:55,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:53:55,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988456060] [2022-02-11 08:53:55,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988456060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:53:55,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 08:53:55,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 08:53:55,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838547536] [2022-02-11 08:53:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:53:55,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 08:53:55,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:53:55,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 08:53:55,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 08:53:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:55,009 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:53:55,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:53:55,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:55,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:55,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,ResultService [2022-02-11 08:53:55,643 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:53:55,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:53:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1816758908, now seen corresponding path program 1 times [2022-02-11 08:53:55,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:53:55,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393319440] [2022-02-11 08:53:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:53:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:53:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-02-11 08:53:55,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:53:55,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393319440] [2022-02-11 08:53:55,765 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393319440] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:53:55,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201871579] [2022-02-11 08:53:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:55,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:53:55,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:53:55,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:53:55,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-11 08:53:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:53:55,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-11 08:53:55,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:53:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-11 08:53:56,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-11 08:53:56,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201871579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:53:56,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-11 08:53:56,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-11 08:53:56,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278645088] [2022-02-11 08:53:56,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:53:56,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 08:53:56,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:53:56,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 08:53:56,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-11 08:53:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:56,205 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:53:56,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:53:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:56,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:57,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-11 08:53:57,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2,ResultService [2022-02-11 08:53:57,880 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:53:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:53:57,881 INFO L85 PathProgramCache]: Analyzing trace with hash 531762565, now seen corresponding path program 1 times [2022-02-11 08:53:57,881 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:53:57,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599364133] [2022-02-11 08:53:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:53:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:53:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-02-11 08:53:57,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:53:57,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599364133] [2022-02-11 08:53:57,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599364133] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:53:57,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822074537] [2022-02-11 08:53:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:53:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:53:57,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:53:57,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:53:58,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-11 08:53:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:53:58,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-11 08:53:58,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:53:58,564 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-02-11 08:53:58,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:53:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-02-11 08:53:59,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822074537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:53:59,054 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:53:59,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-11 08:53:59,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981887143] [2022-02-11 08:53:59,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:53:59,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-11 08:53:59,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:53:59,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-11 08:53:59,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-11 08:53:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:59,058 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:53:59,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 10 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:53:59,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:59,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:59,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:59,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:53:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:53:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:53:59,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-11 08:54:00,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,ResultService,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:54:00,015 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:54:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:54:00,015 INFO L85 PathProgramCache]: Analyzing trace with hash -286745211, now seen corresponding path program 2 times [2022-02-11 08:54:00,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:54:00,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586957274] [2022-02-11 08:54:00,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:54:00,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:54:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 71 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-02-11 08:54:00,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:54:00,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586957274] [2022-02-11 08:54:00,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586957274] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:54:00,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145162579] [2022-02-11 08:54:00,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 08:54:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:54:00,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:54:00,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:54:00,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-11 08:54:00,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 08:54:00,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 08:54:00,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-11 08:54:00,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:54:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-02-11 08:54:00,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:54:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-02-11 08:54:01,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145162579] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:54:01,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:54:01,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-02-11 08:54:01,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506402212] [2022-02-11 08:54:01,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:54:01,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-11 08:54:01,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:54:01,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-11 08:54:01,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-02-11 08:54:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:01,217 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:54:01,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.526315789473685) internal successors, (257), 19 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:54:01,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:01,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:01,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:01,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:01,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:02,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:54:02,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-11 08:54:02,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,ResultService,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:54:02,213 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:54:02,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:54:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1743577298, now seen corresponding path program 1 times [2022-02-11 08:54:02,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:54:02,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16239799] [2022-02-11 08:54:02,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:54:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:54:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 08:54:02,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:54:02,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16239799] [2022-02-11 08:54:02,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16239799] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:54:02,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433766403] [2022-02-11 08:54:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:54:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:54:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:54:02,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:54:02,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-11 08:54:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:02,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-11 08:54:02,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:54:02,615 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 08:54:02,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:54:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 08:54:02,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433766403] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:54:02,857 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:54:02,857 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-02-11 08:54:02,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062863257] [2022-02-11 08:54:02,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:54:02,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-11 08:54:02,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:54:02,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-11 08:54:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-11 08:54:02,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:02,860 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:54:02,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.608695652173913) internal successors, (106), 23 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:54:02,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:02,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:02,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:02,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:02,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:54:02,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:54:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:54:03,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-11 08:54:03,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:54:03,363 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:54:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:54:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1975862446, now seen corresponding path program 2 times [2022-02-11 08:54:03,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:54:03,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976324283] [2022-02-11 08:54:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:54:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:54:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:03,724 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 08:54:03,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:54:03,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976324283] [2022-02-11 08:54:03,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976324283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 08:54:03,724 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 08:54:03,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-11 08:54:03,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969670552] [2022-02-11 08:54:03,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 08:54:03,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-11 08:54:03,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:54:03,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-11 08:54:03,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-02-11 08:54:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:03,727 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:54:03,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:54:03,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:54:04,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 08:54:04,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,ResultService [2022-02-11 08:54:04,513 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:54:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:54:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -616054497, now seen corresponding path program 1 times [2022-02-11 08:54:04,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:54:04,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359282684] [2022-02-11 08:54:04,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:54:04,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:54:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 08:54:05,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:54:05,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359282684] [2022-02-11 08:54:05,502 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359282684] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:54:05,502 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884704967] [2022-02-11 08:54:05,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:54:05,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:54:05,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:54:05,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:54:05,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-11 08:54:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:54:05,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-11 08:54:05,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:54:05,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-02-11 08:54:06,179 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 08:54:06,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 08:54:06,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-11 08:54:06,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-02-11 08:54:06,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-02-11 08:54:06,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-02-11 08:54:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-02-11 08:54:06,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 08:54:11,086 WARN L322 ript$VariableManager]: TermVariable |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 08:54:11,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) is different from false [2022-02-11 08:54:13,443 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) is different from false [2022-02-11 08:54:15,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) is different from false [2022-02-11 08:54:17,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) is different from false [2022-02-11 08:54:19,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) is different from false [2022-02-11 08:54:19,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_803 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_803) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-02-11 08:54:20,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-02-11 08:54:20,145 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-11 08:54:20,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-11 08:54:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-02-11 08:54:20,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884704967] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 08:54:20,163 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 08:54:20,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 46 [2022-02-11 08:54:20,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199667224] [2022-02-11 08:54:20,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 08:54:20,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-02-11 08:54:20,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 08:54:20,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-02-11 08:54:20,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1401, Unknown=8, NotChecked=486, Total=2070 [2022-02-11 08:54:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:20,167 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 08:54:20,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 5.260869565217392) internal successors, (242), 46 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 08:54:20,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:20,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:20,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:54:20,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:54:20,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:54:20,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:54:20,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-02-11 08:54:20,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:54:30,337 WARN L228 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:54:46,390 WARN L228 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:00,429 WARN L228 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:08,930 WARN L228 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 48 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:15,501 WARN L228 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:16,388 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 08:55:16,779 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 08:55:17,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (let ((.cse3 (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (or (and .cse0 (= .cse1 .cse3)) (let ((.cse4 (@diff .cse3 .cse1))) (and (= .cse1 (store .cse3 .cse4 0)) .cse0 (<= .cse4 0))))) (= |c_~#cache~0.base| 4))) is different from false [2022-02-11 08:55:23,207 WARN L228 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 27 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:23,566 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-02-11 08:55:23,888 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4)) is different from false [2022-02-11 08:55:24,253 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 0)) (= |c_~#cache~0.base| 4)) is different from false [2022-02-11 08:55:35,128 WARN L228 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-11 08:55:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-11 08:55:35,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-11 08:55:35,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,ResultService,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:55:35,494 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-11 08:55:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 08:55:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1773165552, now seen corresponding path program 1 times [2022-02-11 08:55:35,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 08:55:35,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993162352] [2022-02-11 08:55:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:55:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 08:55:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:57:16,492 WARN L228 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:57:36,278 WARN L228 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:57:51,815 WARN L228 SmtUtils]: Spent 7.90s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:58:16,644 WARN L228 SmtUtils]: Spent 7.33s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-11 08:58:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 13 proven. 189 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 08:58:23,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 08:58:23,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993162352] [2022-02-11 08:58:23,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993162352] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 08:58:23,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275826509] [2022-02-11 08:58:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 08:58:23,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 08:58:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 08:58:23,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 08:58:23,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-11 08:58:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 08:58:23,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 59 conjunts are in the unsatisfiable core [2022-02-11 08:58:23,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 08:58:24,673 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-02-11 08:58:25,521 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-11 08:58:25,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-11 08:58:25,958 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-02-11 08:58:27,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-02-11 08:58:28,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-02-11 08:58:50,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-11 08:59:01,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-11 09:01:02,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-02-11 09:01:20,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-11 09:03:26,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2022-02-11 09:03:34,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-02-11 09:03:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 13 proven. 87 refuted. 102 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-11 09:03:35,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 09:03:36,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_996 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-02-11 09:03:36,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|)))) is different from false [2022-02-11 09:03:36,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2022-02-11 09:03:36,153 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_54| Int)) (or (forall ((v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_54|)))) is different from false [2022-02-11 09:03:36,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2022-02-11 09:03:36,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0))) is different from false [2022-02-11 09:03:36,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-02-11 09:03:37,042 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67| (+ (* |v_t_funThread1of1ForFork0_~i~0#1_54| 28) |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_54| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-02-11 09:03:37,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse0 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 3)) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse0 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse1 .cse0) (<= (+ .cse0 28) .cse1) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28)))) is different from false [2022-02-11 09:03:37,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse0 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ 3 |c_t_funThread1of1ForFork0_~i~0#1|)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse0 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse1 .cse0) (<= (+ .cse0 28) .cse1) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28)))) is different from false [2022-02-11 09:03:40,577 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse0 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 4)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse0 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse1 .cse0) (<= (+ .cse0 28) .cse1) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28)))) is different from false [2022-02-11 09:03:40,690 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse0 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse0 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse1 .cse0) (<= (+ .cse0 28) .cse1) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28)))) is different from false [2022-02-11 09:03:41,731 WARN L838 $PredicateComparison]: unable to prove that (forall ((|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_991 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse1 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse2 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_991)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse1 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse2 .cse1) (<= (+ .cse1 28) .cse2) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28)))) is different from false [2022-02-11 09:03:44,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_991 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse0 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse1 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse0 .cse1) (<= (+ .cse1 28) .cse0) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_991)))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse1 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))))) is different from false [2022-02-11 09:03:44,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_994 Int) (v_ArrVal_996 (Array Int Int)) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| Int) (v_ArrVal_991 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| Int) (|aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int) (|aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| Int)) (let ((.cse0 (* 28 |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|)) (.cse1 (+ (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| 28) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|))) (or (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_991) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_994)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996) |c_~#cache~0.base|) (+ (- 1) .cse0 (* (- 1) |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) |c_~#cache~0.offset|)) 0) (< |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117| (+ |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 3)) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69_113| 28) (< .cse1 .cse0) (<= (+ .cse0 28) .cse1) (> 0 |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183|) (< |aux_div_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| (+ |c_t_funThread1of1ForFork0_~i~0#1| 4)) (>= |aux_mod_aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_67_117_183| 28)))) is different from false Received shutdown request... [2022-02-11 09:07:39,860 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:07:39,862 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-02-11 09:07:39,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-11 09:07:39,881 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:07:39,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-11 09:07:39,907 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:07:40,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 09:07:40,066 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 250 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 0ms.. [2022-02-11 09:07:40,070 INFO L733 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-02-11 09:07:40,070 INFO L313 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2022-02-11 09:07:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 09:07:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 09:07:40,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 09:07:40,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2022-02-11 09:07:40,073 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 09:07:40,078 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 09:07:40,079 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 09:07:40,079 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-11 09:07:40,079 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. [2022-02-11 09:07:40,079 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-11 09:07:40,079 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-11 09:07:40,079 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 3 remaining) [2022-02-11 09:07:40,080 INFO L733 BasicCegarLoop]: Path program histogram: [] [2022-02-11 09:07:40,080 INFO L313 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2022-02-11 09:07:40,081 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-11 09:07:40,081 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 09:07:40,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 09:07:40 BasicIcfg [2022-02-11 09:07:40,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 09:07:40,085 INFO L158 Benchmark]: Toolchain (without parser) took 828217.83ms. Allocated memory was 184.5MB in the beginning and 548.4MB in the end (delta: 363.9MB). Free memory was 125.5MB in the beginning and 448.0MB in the end (delta: -322.6MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. [2022-02-11 09:07:40,085 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 09:07:40,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 620.64ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 125.3MB in the beginning and 189.3MB in the end (delta: -64.0MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2022-02-11 09:07:40,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.08ms. Allocated memory is still 239.1MB. Free memory was 189.3MB in the beginning and 186.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-11 09:07:40,086 INFO L158 Benchmark]: Boogie Preprocessor took 59.69ms. Allocated memory is still 239.1MB. Free memory was 186.2MB in the beginning and 184.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 09:07:40,086 INFO L158 Benchmark]: RCFGBuilder took 522.51ms. Allocated memory is still 239.1MB. Free memory was 184.1MB in the beginning and 164.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-02-11 09:07:40,087 INFO L158 Benchmark]: TraceAbstraction took 826963.61ms. Allocated memory was 239.1MB in the beginning and 548.4MB in the end (delta: 309.3MB). Free memory was 164.2MB in the beginning and 448.0MB in the end (delta: -283.8MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. [2022-02-11 09:07:40,088 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 184.5MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 620.64ms. Allocated memory was 184.5MB in the beginning and 239.1MB in the end (delta: 54.5MB). Free memory was 125.3MB in the beginning and 189.3MB in the end (delta: -64.0MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.08ms. Allocated memory is still 239.1MB. Free memory was 189.3MB in the beginning and 186.2MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.69ms. Allocated memory is still 239.1MB. Free memory was 186.2MB in the beginning and 184.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 522.51ms. Allocated memory is still 239.1MB. Free memory was 184.1MB in the beginning and 164.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 826963.61ms. Allocated memory was 239.1MB in the beginning and 548.4MB in the end (delta: 309.3MB). Free memory was 164.2MB in the beginning and 448.0MB in the end (delta: -283.8MB). Peak memory consumption was 26.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9711, positive: 9602, positive conditional: 235, positive unconditional: 9367, negative: 109, negative conditional: 94, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92334, positive: 92211, positive conditional: 1705, positive unconditional: 90506, negative: 123, negative conditional: 13, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92334, positive: 92211, positive conditional: 1705, positive unconditional: 90506, negative: 123, negative conditional: 13, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92339, positive: 92211, positive conditional: 745, positive unconditional: 91466, negative: 128, negative conditional: 5, negative unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92339, positive: 92211, positive conditional: 134, positive unconditional: 92077, negative: 128, negative conditional: 2, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92339, positive: 92211, positive conditional: 134, positive unconditional: 92077, negative: 128, negative conditional: 2, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25667, positive: 25619, positive conditional: 0, positive unconditional: 25619, negative: 48, negative conditional: 2, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25667, positive: 25052, positive conditional: 0, positive unconditional: 25052, negative: 615, negative conditional: 0, negative unconditional: 615, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 615, positive: 567, positive conditional: 0, positive unconditional: 567, negative: 14, negative conditional: 2, negative unconditional: 12, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1786, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 16, negative conditional: 3, negative unconditional: 14, unknown: 1050, unknown conditional: 0, unknown unconditional: 1050] ], Cache Queries: [ total: 92339, positive: 66592, positive conditional: 134, positive unconditional: 66458, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 25667, unknown conditional: 2, unknown unconditional: 25665] , Statistics on independence cache: Total cache size (in pairs): 25667, Positive cache size: 25619, Positive conditional cache size: 0, Positive unconditional cache size: 25619, Negative cache size: 48, Negative conditional cache size: 2, Negative unconditional cache size: 46, Eliminated conditions: 614, Maximal queried relation: 3, Independence queries for same thread: 93 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 1.5s, Number of persistent set computation: 103, Number of trivial persistent sets: 55, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9382, positive: 9367, positive conditional: 0, positive unconditional: 9367, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9711, positive: 9602, positive conditional: 235, positive unconditional: 9367, negative: 109, negative conditional: 94, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92334, positive: 92211, positive conditional: 1705, positive unconditional: 90506, negative: 123, negative conditional: 13, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92334, positive: 92211, positive conditional: 1705, positive unconditional: 90506, negative: 123, negative conditional: 13, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92339, positive: 92211, positive conditional: 745, positive unconditional: 91466, negative: 128, negative conditional: 5, negative unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92339, positive: 92211, positive conditional: 134, positive unconditional: 92077, negative: 128, negative conditional: 2, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92339, positive: 92211, positive conditional: 134, positive unconditional: 92077, negative: 128, negative conditional: 2, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25667, positive: 25619, positive conditional: 0, positive unconditional: 25619, negative: 48, negative conditional: 2, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25667, positive: 25052, positive conditional: 0, positive unconditional: 25052, negative: 615, negative conditional: 0, negative unconditional: 615, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 615, positive: 567, positive conditional: 0, positive unconditional: 567, negative: 14, negative conditional: 2, negative unconditional: 12, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1786, positive: 720, positive conditional: 0, positive unconditional: 720, negative: 16, negative conditional: 3, negative unconditional: 14, unknown: 1050, unknown conditional: 0, unknown unconditional: 1050] ], Cache Queries: [ total: 92339, positive: 66592, positive conditional: 134, positive unconditional: 66458, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 25667, unknown conditional: 2, unknown unconditional: 25665] , Statistics on independence cache: Total cache size (in pairs): 25667, Positive cache size: 25619, Positive conditional cache size: 0, Positive unconditional cache size: 25619, Negative cache size: 48, Negative conditional cache size: 2, Negative unconditional cache size: 46, Eliminated conditions: 614, Maximal queried relation: 3, Independence queries for same thread: 93 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 250 with TraceHistMax 10,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 0ms.. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was constructing initial abstraction,while executing PartialOrderCegarLoop. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 269 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 826.8s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 81.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 2324 NumberOfCodeBlocks, 2324 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3084 ConstructedInterpolants, 116 QuantifiedInterpolants, 12823 SizeOfPredicates, 41 NumberOfNonLiveVariables, 2224 ConjunctsInSsa, 68 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 2102/2500 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, 269 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown