/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-23 20:29:28,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-23 20:29:28,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-23 20:29:28,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-23 20:29:28,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-23 20:29:28,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-23 20:29:28,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-23 20:29:28,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-23 20:29:28,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-23 20:29:28,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-23 20:29:28,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-23 20:29:28,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-23 20:29:28,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-23 20:29:28,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-23 20:29:28,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-23 20:29:28,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-23 20:29:28,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-23 20:29:28,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-23 20:29:28,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-23 20:29:28,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-23 20:29:28,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-23 20:29:28,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-23 20:29:28,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-23 20:29:28,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-23 20:29:28,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-23 20:29:28,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-23 20:29:28,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-23 20:29:28,737 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-23 20:29:28,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-23 20:29:28,738 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-23 20:29:28,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-23 20:29:28,739 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-23 20:29:28,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-23 20:29:28,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-23 20:29:28,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-23 20:29:28,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-23 20:29:28,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-23 20:29:28,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-23 20:29:28,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-23 20:29:28,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-23 20:29:28,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-23 20:29:28,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-02-23 20:29:28,769 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-23 20:29:28,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-23 20:29:28,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-23 20:29:28,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-23 20:29:28,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-23 20:29:28,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-23 20:29:28,771 INFO L138 SettingsManager]: * Use SBE=true [2022-02-23 20:29:28,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-23 20:29:28,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-23 20:29:28,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-23 20:29:28,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-23 20:29:28,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-23 20:29:28,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 20:29:28,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-02-23 20:29:28,774 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-23 20:29:28,775 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-23 20:29:28,775 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-23 20:29:28,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-23 20:29:28,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-23 20:29:28,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-23 20:29:28,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-23 20:29:28,981 INFO L275 PluginConnector]: CDTParser initialized [2022-02-23 20:29:28,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2022-02-23 20:29:29,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5c92374/42854ccaad8242748192fce4d7355179/FLAG0744bd444 [2022-02-23 20:29:29,352 INFO L306 CDTParser]: Found 1 translation units. [2022-02-23 20:29:29,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2022-02-23 20:29:29,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5c92374/42854ccaad8242748192fce4d7355179/FLAG0744bd444 [2022-02-23 20:29:29,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f5c92374/42854ccaad8242748192fce4d7355179 [2022-02-23 20:29:29,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-23 20:29:29,790 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-23 20:29:29,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-23 20:29:29,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-23 20:29:29,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-23 20:29:29,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:29,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ed9dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29, skipping insertion in model container [2022-02-23 20:29:29,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:29,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-23 20:29:29,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-23 20:29:29,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-02-23 20:29:29,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 20:29:29,970 INFO L203 MainTranslator]: Completed pre-run [2022-02-23 20:29:29,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-02-23 20:29:29,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-23 20:29:29,995 INFO L208 MainTranslator]: Completed translation [2022-02-23 20:29:29,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29 WrapperNode [2022-02-23 20:29:29,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-23 20:29:29,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-23 20:29:29,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-23 20:29:29,996 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-23 20:29:30,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-23 20:29:30,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-23 20:29:30,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-23 20:29:30,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-23 20:29:30,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (1/1) ... [2022-02-23 20:29:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-23 20:29:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:30,049 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-23 20:29:30,062 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-23 20:29:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-23 20:29:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-23 20:29:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-23 20:29:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-23 20:29:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2022-02-23 20:29:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-23 20:29:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-23 20:29:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-23 20:29:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-23 20:29:30,158 INFO L234 CfgBuilder]: Building ICFG [2022-02-23 20:29:30,159 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-23 20:29:30,288 INFO L275 CfgBuilder]: Performing block encoding [2022-02-23 20:29:30,308 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-23 20:29:30,309 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-23 20:29:30,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 08:29:30 BoogieIcfgContainer [2022-02-23 20:29:30,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-23 20:29:30,311 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-23 20:29:30,311 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-23 20:29:30,312 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-23 20:29:30,315 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 08:29:30" (1/1) ... [2022-02-23 20:29:30,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 08:29:30 BasicIcfg [2022-02-23 20:29:30,342 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-23 20:29:30,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-23 20:29:30,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-23 20:29:30,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-23 20:29:30,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 08:29:29" (1/4) ... [2022-02-23 20:29:30,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d200fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 08:29:30, skipping insertion in model container [2022-02-23 20:29:30,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 08:29:29" (2/4) ... [2022-02-23 20:29:30,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d200fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 08:29:30, skipping insertion in model container [2022-02-23 20:29:30,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 08:29:30" (3/4) ... [2022-02-23 20:29:30,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d200fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 08:29:30, skipping insertion in model container [2022-02-23 20:29:30,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.02 08:29:30" (4/4) ... [2022-02-23 20:29:30,355 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.iqvasr [2022-02-23 20:29:30,358 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-23 20:29:30,359 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-23 20:29:30,394 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-23 20:29:30,399 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=FINITE_AUTOMATA, 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-23 20:29:30,399 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-23 20:29:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-23 20:29:30,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-23 20:29:30,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:30,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:30,415 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:30,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:30,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1326105583, now seen corresponding path program 1 times [2022-02-23 20:29:30,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:30,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028200906] [2022-02-23 20:29:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:30,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-23 20:29:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 20:29:30,592 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:30,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028200906] [2022-02-23 20:29:30,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028200906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 20:29:30,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 20:29:30,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-23 20:29:30,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255822713] [2022-02-23 20:29:30,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 20:29:30,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-23 20:29:30,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-23 20:29:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-23 20:29:30,619 INFO L87 Difference]: Start difference. First operand has 34 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 20:29:30,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:30,732 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-02-23 20:29:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-23 20:29:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-23 20:29:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:30,741 INFO L225 Difference]: With dead ends: 77 [2022-02-23 20:29:30,741 INFO L226 Difference]: Without dead ends: 43 [2022-02-23 20:29:30,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-23 20:29:30,748 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:30,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 30 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 20:29:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-23 20:29:30,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2022-02-23 20:29:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-23 20:29:30,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2022-02-23 20:29:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:30,803 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-23 20:29:30,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 20:29:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-23 20:29:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-23 20:29:30,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:30,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:30,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-23 20:29:30,805 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1290489969, now seen corresponding path program 1 times [2022-02-23 20:29:30,806 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:30,806 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782387914] [2022-02-23 20:29:30,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-23 20:29:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 20:29:30,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:30,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782387914] [2022-02-23 20:29:30,900 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782387914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 20:29:30,900 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 20:29:30,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-23 20:29:30,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948143006] [2022-02-23 20:29:30,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 20:29:30,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-23 20:29:30,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:30,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-23 20:29:30,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-23 20:29:30,902 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 20:29:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:31,046 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-02-23 20:29:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-23 20:29:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-23 20:29:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:31,050 INFO L225 Difference]: With dead ends: 59 [2022-02-23 20:29:31,051 INFO L226 Difference]: Without dead ends: 38 [2022-02-23 20:29:31,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-23 20:29:31,062 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:31,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 25 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 20:29:31,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-23 20:29:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-02-23 20:29:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:31,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-23 20:29:31,072 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2022-02-23 20:29:31,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:31,073 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-23 20:29:31,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 20:29:31,073 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-23 20:29:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-23 20:29:31,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:31,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:31,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-23 20:29:31,074 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash 43929779, now seen corresponding path program 1 times [2022-02-23 20:29:31,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:31,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737394727] [2022-02-23 20:29:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-23 20:29:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 20:29:31,194 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:31,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737394727] [2022-02-23 20:29:31,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737394727] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:31,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435157651] [2022-02-23 20:29:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:31,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:31,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 20:29:31,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-23 20:29:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-23 20:29:31,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 20:29:31,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-23 20:29:31,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435157651] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:29:31,438 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:29:31,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 8 [2022-02-23 20:29:31,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088165906] [2022-02-23 20:29:31,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:31,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-23 20:29:31,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-23 20:29:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-23 20:29:31,446 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 20:29:31,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:31,629 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-02-23 20:29:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-23 20:29:31,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 20 [2022-02-23 20:29:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:31,632 INFO L225 Difference]: With dead ends: 68 [2022-02-23 20:29:31,632 INFO L226 Difference]: Without dead ends: 47 [2022-02-23 20:29:31,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-02-23 20:29:31,640 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 57 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:31,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 27 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 20:29:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-23 20:29:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-02-23 20:29:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:31,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-02-23 20:29:31,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 20 [2022-02-23 20:29:31,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:31,658 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-02-23 20:29:31,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 20:29:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-23 20:29:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-23 20:29:31,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:31,659 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:31,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-23 20:29:31,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:31,875 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:31,875 INFO L85 PathProgramCache]: Analyzing trace with hash -969564551, now seen corresponding path program 2 times [2022-02-23 20:29:31,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:31,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337227216] [2022-02-23 20:29:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-23 20:29:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 20:29:31,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:31,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337227216] [2022-02-23 20:29:31,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337227216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 20:29:31,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-23 20:29:31,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-23 20:29:31,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376656688] [2022-02-23 20:29:31,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 20:29:31,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-23 20:29:31,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-23 20:29:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-23 20:29:31,953 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 20:29:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:32,098 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-02-23 20:29:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-23 20:29:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-02-23 20:29:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:32,100 INFO L225 Difference]: With dead ends: 55 [2022-02-23 20:29:32,100 INFO L226 Difference]: Without dead ends: 42 [2022-02-23 20:29:32,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-02-23 20:29:32,101 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 76 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:32,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 27 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 20:29:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-23 20:29:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-02-23 20:29:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-02-23 20:29:32,129 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2022-02-23 20:29:32,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:32,129 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-02-23 20:29:32,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-23 20:29:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-23 20:29:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-23 20:29:32,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:32,130 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:32,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-23 20:29:32,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1845213134, now seen corresponding path program 1 times [2022-02-23 20:29:32,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:32,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480227902] [2022-02-23 20:29:32,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:32,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-23 20:29:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-23 20:29:32,253 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:32,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480227902] [2022-02-23 20:29:32,253 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480227902] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:32,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022938221] [2022-02-23 20:29:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:32,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:32,256 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-23 20:29:32,266 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-23 20:29:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:32,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-23 20:29:32,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 20:29:32,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-23 20:29:32,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022938221] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:29:32,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:29:32,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-23 20:29:32,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91791828] [2022-02-23 20:29:32,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:32,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-23 20:29:32,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:32,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-23 20:29:32,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-23 20:29:32,498 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 20:29:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:32,866 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-02-23 20:29:32,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-23 20:29:32,867 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2022-02-23 20:29:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:32,868 INFO L225 Difference]: With dead ends: 85 [2022-02-23 20:29:32,868 INFO L226 Difference]: Without dead ends: 63 [2022-02-23 20:29:32,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2022-02-23 20:29:32,869 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 106 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:32,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 34 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 20:29:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-23 20:29:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2022-02-23 20:29:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-23 20:29:32,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2022-02-23 20:29:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:32,877 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-23 20:29:32,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 20:29:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-23 20:29:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-23 20:29:32,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:32,878 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:32,900 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-23 20:29:33,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:33,096 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1453502491, now seen corresponding path program 1 times [2022-02-23 20:29:33,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:33,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725842852] [2022-02-23 20:29:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:33,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-23 20:29:33,199 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:33,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725842852] [2022-02-23 20:29:33,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725842852] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:33,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965655701] [2022-02-23 20:29:33,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:33,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:33,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:33,204 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-23 20:29:33,217 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-23 20:29:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:33,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 20:29:33,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-23 20:29:33,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-23 20:29:33,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965655701] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:29:33,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:29:33,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2022-02-23 20:29:33,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671529164] [2022-02-23 20:29:33,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:33,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-23 20:29:33,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:33,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-23 20:29:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-02-23 20:29:33,528 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 20:29:33,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:33,985 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-02-23 20:29:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-23 20:29:33,986 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2022-02-23 20:29:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:33,987 INFO L225 Difference]: With dead ends: 83 [2022-02-23 20:29:33,987 INFO L226 Difference]: Without dead ends: 64 [2022-02-23 20:29:33,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2022-02-23 20:29:33,988 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:33,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 28 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 20:29:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-23 20:29:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2022-02-23 20:29:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:33,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-02-23 20:29:33,997 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 35 [2022-02-23 20:29:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:33,997 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-02-23 20:29:33,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 13 states have internal predecessors, (44), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 20:29:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-02-23 20:29:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-23 20:29:33,998 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:33,998 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:34,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-23 20:29:34,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:34,220 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -444702843, now seen corresponding path program 2 times [2022-02-23 20:29:34,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:34,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631111081] [2022-02-23 20:29:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:34,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-23 20:29:34,358 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:34,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631111081] [2022-02-23 20:29:34,358 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631111081] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:34,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891281046] [2022-02-23 20:29:34,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 20:29:34,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:34,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:34,360 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-23 20:29:34,361 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-23 20:29:34,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 20:29:34,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:34,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 20:29:34,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-23 20:29:34,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 4 proven. 37 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-23 20:29:34,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891281046] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:29:34,883 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:29:34,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 21 [2022-02-23 20:29:34,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715674647] [2022-02-23 20:29:34,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:34,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-23 20:29:34,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:34,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-23 20:29:34,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-02-23 20:29:34,886 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 20:29:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:35,347 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-02-23 20:29:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-23 20:29:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-02-23 20:29:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:35,348 INFO L225 Difference]: With dead ends: 88 [2022-02-23 20:29:35,348 INFO L226 Difference]: Without dead ends: 69 [2022-02-23 20:29:35,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2022-02-23 20:29:35,350 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:35,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 30 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-23 20:29:35,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-23 20:29:35,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2022-02-23 20:29:35,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-02-23 20:29:35,361 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 54 [2022-02-23 20:29:35,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:35,361 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-02-23 20:29:35,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 18 states have internal predecessors, (68), 3 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-23 20:29:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-02-23 20:29:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-23 20:29:35,368 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:35,368 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:35,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-23 20:29:35,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:35,568 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:35,569 INFO L85 PathProgramCache]: Analyzing trace with hash -292182650, now seen corresponding path program 3 times [2022-02-23 20:29:35,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:35,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422368530] [2022-02-23 20:29:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:35,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-23 20:29:35,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:35,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422368530] [2022-02-23 20:29:35,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422368530] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:35,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176596863] [2022-02-23 20:29:35,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 20:29:35,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:35,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:35,679 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-23 20:29:35,680 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-23 20:29:35,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-23 20:29:35,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:35,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-23 20:29:35,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-23 20:29:35,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-23 20:29:36,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176596863] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:29:36,205 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:29:36,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 16 [2022-02-23 20:29:36,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419327158] [2022-02-23 20:29:36,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:36,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-23 20:29:36,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:36,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-23 20:29:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-23 20:29:36,207 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 20:29:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:36,470 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2022-02-23 20:29:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-23 20:29:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2022-02-23 20:29:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:36,472 INFO L225 Difference]: With dead ends: 93 [2022-02-23 20:29:36,472 INFO L226 Difference]: Without dead ends: 80 [2022-02-23 20:29:36,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=470, Unknown=0, NotChecked=0, Total=650 [2022-02-23 20:29:36,473 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:36,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 30 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-23 20:29:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-23 20:29:36,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-02-23 20:29:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2022-02-23 20:29:36,497 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 57 [2022-02-23 20:29:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:36,498 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2022-02-23 20:29:36,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 13 states have internal predecessors, (68), 4 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-23 20:29:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2022-02-23 20:29:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-23 20:29:36,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:36,499 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:36,523 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-23 20:29:36,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:36,712 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -582619515, now seen corresponding path program 4 times [2022-02-23 20:29:36,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:36,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558508027] [2022-02-23 20:29:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-02-23 20:29:36,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:36,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558508027] [2022-02-23 20:29:36,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558508027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:36,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749894606] [2022-02-23 20:29:36,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 20:29:36,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:36,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:36,817 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-23 20:29:36,841 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-23 20:29:36,894 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 20:29:36,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:36,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-23 20:29:36,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-23 20:29:37,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-23 20:29:37,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749894606] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:29:37,205 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:29:37,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2022-02-23 20:29:37,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919280998] [2022-02-23 20:29:37,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:37,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-23 20:29:37,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:37,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-23 20:29:37,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-02-23 20:29:37,207 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-23 20:29:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:38,620 INFO L93 Difference]: Finished difference Result 203 states and 274 transitions. [2022-02-23 20:29:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-02-23 20:29:38,621 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 69 [2022-02-23 20:29:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:38,622 INFO L225 Difference]: With dead ends: 203 [2022-02-23 20:29:38,622 INFO L226 Difference]: Without dead ends: 175 [2022-02-23 20:29:38,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=971, Invalid=3061, Unknown=0, NotChecked=0, Total=4032 [2022-02-23 20:29:38,625 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 279 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:38,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 41 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-23 20:29:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-23 20:29:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 116. [2022-02-23 20:29:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 108 states have internal predecessors, (138), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2022-02-23 20:29:38,645 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 69 [2022-02-23 20:29:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:38,645 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2022-02-23 20:29:38,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.095238095238095) internal successors, (86), 19 states have internal predecessors, (86), 3 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-23 20:29:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-02-23 20:29:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-23 20:29:38,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:38,647 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:38,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-23 20:29:38,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:38,871 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -551286544, now seen corresponding path program 5 times [2022-02-23 20:29:38,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:38,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909297439] [2022-02-23 20:29:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-02-23 20:29:39,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:39,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909297439] [2022-02-23 20:29:39,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909297439] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:39,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715119453] [2022-02-23 20:29:39,305 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-23 20:29:39,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:39,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:39,306 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-23 20:29:39,338 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-23 20:29:39,489 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-02-23 20:29:39,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:39,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-23 20:29:39,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:39,545 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-23 20:29:39,546 INFO L390 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-23 20:29:39,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-23 20:29:40,246 INFO L390 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 14 treesize of output 16 [2022-02-23 20:29:40,308 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-02-23 20:29:40,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-02-23 20:29:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-02-23 20:29:40,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:40,497 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_320) |c_main_~#array~1.base|) |c_main_~#array~1.offset|) 0)) is different from false [2022-02-23 20:29:40,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715119453] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:40,498 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 20:29:40,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 30 [2022-02-23 20:29:40,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995453346] [2022-02-23 20:29:40,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:40,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-02-23 20:29:40,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-02-23 20:29:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=961, Unknown=9, NotChecked=62, Total=1122 [2022-02-23 20:29:40,500 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 5 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:41,484 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-02-23 20:29:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-23 20:29:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 5 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 78 [2022-02-23 20:29:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:41,485 INFO L225 Difference]: With dead ends: 126 [2022-02-23 20:29:41,485 INFO L226 Difference]: Without dead ends: 124 [2022-02-23 20:29:41,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=2387, Unknown=14, NotChecked=100, Total=2756 [2022-02-23 20:29:41,487 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:41,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 213 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 759 Invalid, 0 Unknown, 52 Unchecked, 0.3s Time] [2022-02-23 20:29:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-23 20:29:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2022-02-23 20:29:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.2678571428571428) internal successors, (142), 113 states have internal predecessors, (142), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-23 20:29:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2022-02-23 20:29:41,506 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 78 [2022-02-23 20:29:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:41,506 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2022-02-23 20:29:41,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 24 states have internal predecessors, (68), 5 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-23 20:29:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2022-02-23 20:29:41,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-23 20:29:41,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:41,508 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:41,533 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-23 20:29:41,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:41,731 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash 215004892, now seen corresponding path program 1 times [2022-02-23 20:29:41,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:41,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346188410] [2022-02-23 20:29:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:41,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-23 20:29:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 2 proven. 138 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-02-23 20:29:42,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:42,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346188410] [2022-02-23 20:29:42,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346188410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:42,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568793603] [2022-02-23 20:29:42,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:42,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:42,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:42,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 20:29:42,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-23 20:29:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:42,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-23 20:29:42,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:42,483 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-23 20:29:42,484 INFO L390 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-23 20:29:42,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-23 20:29:42,693 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-23 20:29:42,694 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-23 20:29:43,155 INFO L390 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 16 treesize of output 18 [2022-02-23 20:29:43,398 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-02-23 20:29:43,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-02-23 20:29:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-02-23 20:29:43,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:43,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_405) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 4)) 1)) is different from false [2022-02-23 20:29:43,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568793603] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:43,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 20:29:43,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 36 [2022-02-23 20:29:43,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791315011] [2022-02-23 20:29:43,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:43,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-23 20:29:43,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:43,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-23 20:29:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1421, Unknown=11, NotChecked=76, Total=1640 [2022-02-23 20:29:43,612 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 31 states have internal predecessors, (82), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-23 20:29:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:44,853 INFO L93 Difference]: Finished difference Result 134 states and 163 transitions. [2022-02-23 20:29:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-23 20:29:44,853 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 31 states have internal predecessors, (82), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 86 [2022-02-23 20:29:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:44,854 INFO L225 Difference]: With dead ends: 134 [2022-02-23 20:29:44,854 INFO L226 Difference]: Without dead ends: 132 [2022-02-23 20:29:44,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 83 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=379, Invalid=3515, Unknown=16, NotChecked=122, Total=4032 [2022-02-23 20:29:44,856 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 98 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:44,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 216 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 738 Invalid, 0 Unknown, 149 Unchecked, 0.4s Time] [2022-02-23 20:29:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-23 20:29:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2022-02-23 20:29:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 118 states have (on average 1.2542372881355932) internal successors, (148), 119 states have internal predecessors, (148), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-23 20:29:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 159 transitions. [2022-02-23 20:29:44,873 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 159 transitions. Word has length 86 [2022-02-23 20:29:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:44,873 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 159 transitions. [2022-02-23 20:29:44,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 31 states have internal predecessors, (82), 8 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-23 20:29:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 159 transitions. [2022-02-23 20:29:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-02-23 20:29:44,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:44,874 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:44,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-23 20:29:45,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-23 20:29:45,096 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1130972984, now seen corresponding path program 2 times [2022-02-23 20:29:45,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:45,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324573774] [2022-02-23 20:29:45,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:45,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:45,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:45,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-23 20:29:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-23 20:29:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-02-23 20:29:45,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:45,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324573774] [2022-02-23 20:29:45,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324573774] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:45,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18054409] [2022-02-23 20:29:45,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-23 20:29:45,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:45,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:45,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 20:29:45,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-23 20:29:45,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-23 20:29:45,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:45,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-23 20:29:45,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:45,863 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-23 20:29:45,864 INFO L390 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-23 20:29:45,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-23 20:29:46,027 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-23 20:29:46,028 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-23 20:29:46,082 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-23 20:29:46,082 INFO L390 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 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-23 20:29:46,538 INFO L390 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 16 treesize of output 18 [2022-02-23 20:29:46,886 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-02-23 20:29:46,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-02-23 20:29:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 1 proven. 143 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-02-23 20:29:46,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:47,128 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_492 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_492) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 8)))) is different from false [2022-02-23 20:29:47,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18054409] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:47,129 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 20:29:47,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2022-02-23 20:29:47,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362947486] [2022-02-23 20:29:47,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:47,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-23 20:29:47,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-23 20:29:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1648, Unknown=11, NotChecked=82, Total=1892 [2022-02-23 20:29:47,131 INFO L87 Difference]: Start difference. First operand 130 states and 159 transitions. Second operand has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 33 states have internal predecessors, (88), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-23 20:29:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:48,417 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2022-02-23 20:29:48,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-23 20:29:48,418 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 33 states have internal predecessors, (88), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 94 [2022-02-23 20:29:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:48,419 INFO L225 Difference]: With dead ends: 142 [2022-02-23 20:29:48,419 INFO L226 Difference]: Without dead ends: 140 [2022-02-23 20:29:48,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=431, Invalid=4113, Unknown=16, NotChecked=132, Total=4692 [2022-02-23 20:29:48,420 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 133 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:48,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 264 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 869 Invalid, 0 Unknown, 130 Unchecked, 0.4s Time] [2022-02-23 20:29:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-23 20:29:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-02-23 20:29:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.2419354838709677) internal successors, (154), 125 states have internal predecessors, (154), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-23 20:29:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2022-02-23 20:29:48,435 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 94 [2022-02-23 20:29:48,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:48,435 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2022-02-23 20:29:48,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 33 states have internal predecessors, (88), 10 states have call successors, (12), 9 states have call predecessors, (12), 6 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2022-02-23 20:29:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2022-02-23 20:29:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-02-23 20:29:48,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:48,437 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:48,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-23 20:29:48,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:48,653 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash 971116212, now seen corresponding path program 3 times [2022-02-23 20:29:48,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:48,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409685635] [2022-02-23 20:29:48,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:49,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-23 20:29:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-23 20:29:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-02-23 20:29:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 6 proven. 150 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-02-23 20:29:49,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:49,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409685635] [2022-02-23 20:29:49,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409685635] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:49,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420245210] [2022-02-23 20:29:49,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-23 20:29:49,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:49,244 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 20:29:49,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-23 20:29:49,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-02-23 20:29:49,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:49,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-23 20:29:49,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:49,528 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-23 20:29:49,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-23 20:29:49,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-23 20:29:49,677 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-02-23 20:29:49,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-02-23 20:29:49,728 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-02-23 20:29:49,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-02-23 20:29:49,849 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-02-23 20:29:49,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2022-02-23 20:29:50,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-23 20:29:50,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-23 20:29:50,951 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-02-23 20:29:50,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-02-23 20:29:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-02-23 20:29:51,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:29:51,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_581 (Array Int Int))) (= 3 (select (select (store |c_#memory_int| |c_~#array~0.base| v_ArrVal_581) |c_main_~#array~1.base|) (+ |c_main_~#array~1.offset| 12)))) is different from false [2022-02-23 20:29:51,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420245210] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:51,249 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-23 20:29:51,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2022-02-23 20:29:51,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032022358] [2022-02-23 20:29:51,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-23 20:29:51,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-23 20:29:51,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:29:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-23 20:29:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1884, Unknown=12, NotChecked=88, Total=2162 [2022-02-23 20:29:51,250 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 35 states have internal predecessors, (93), 12 states have call successors, (14), 9 states have call predecessors, (14), 6 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-23 20:29:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:29:52,782 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2022-02-23 20:29:52,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-23 20:29:52,783 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 35 states have internal predecessors, (93), 12 states have call successors, (14), 9 states have call predecessors, (14), 6 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 102 [2022-02-23 20:29:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:29:52,784 INFO L225 Difference]: With dead ends: 151 [2022-02-23 20:29:52,784 INFO L226 Difference]: Without dead ends: 149 [2022-02-23 20:29:52,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=511, Invalid=4588, Unknown=17, NotChecked=140, Total=5256 [2022-02-23 20:29:52,786 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-23 20:29:52,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 253 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 763 Invalid, 0 Unknown, 146 Unchecked, 0.4s Time] [2022-02-23 20:29:52,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-23 20:29:52,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2022-02-23 20:29:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.2307692307692308) internal successors, (160), 131 states have internal predecessors, (160), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-23 20:29:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2022-02-23 20:29:52,804 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 102 [2022-02-23 20:29:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:29:52,804 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2022-02-23 20:29:52,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.3846153846153846) internal successors, (93), 35 states have internal predecessors, (93), 12 states have call successors, (14), 9 states have call predecessors, (14), 6 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2022-02-23 20:29:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2022-02-23 20:29:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-23 20:29:52,805 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:29:52,805 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:29:52,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-23 20:29:53,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-23 20:29:53,007 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:29:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:29:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1541490528, now seen corresponding path program 4 times [2022-02-23 20:29:53,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:29:53,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214703504] [2022-02-23 20:29:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:29:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:29:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:29:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:29:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-23 20:29:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-23 20:29:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-02-23 20:29:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-23 20:29:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:29:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 8 proven. 168 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-02-23 20:29:53,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:29:53,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214703504] [2022-02-23 20:29:53,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214703504] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:29:53,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192898435] [2022-02-23 20:29:53,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-23 20:29:53,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:29:53,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:29:53,776 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 20:29:53,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-23 20:29:53,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-23 20:29:53,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:29:53,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 108 conjunts are in the unsatisfiable core [2022-02-23 20:29:53,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:29:53,915 INFO L390 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 15 treesize of output 11 [2022-02-23 20:29:53,960 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-02-23 20:29:53,963 INFO L390 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 1 case distinctions, treesize of input 30 treesize of output 29 [2022-02-23 20:29:53,994 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-02-23 20:29:53,994 INFO L390 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 1 case distinctions, treesize of input 30 treesize of output 29 [2022-02-23 20:29:54,028 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-02-23 20:29:54,028 INFO L390 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 1 case distinctions, treesize of input 30 treesize of output 29 [2022-02-23 20:29:54,062 INFO L356 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-02-23 20:29:54,062 INFO L390 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 1 case distinctions, treesize of input 30 treesize of output 29 [2022-02-23 20:29:56,033 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-02-23 20:29:56,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 12 [2022-02-23 20:29:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 5 proven. 271 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-02-23 20:29:56,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-23 20:30:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 13 proven. 52 refuted. 102 times theorem prover too weak. 152 trivial. 0 not checked. [2022-02-23 20:30:01,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192898435] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-23 20:30:01,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-23 20:30:01,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 21] total 65 [2022-02-23 20:30:01,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822915749] [2022-02-23 20:30:01,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-23 20:30:01,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-02-23 20:30:01,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:30:01,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-02-23 20:30:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=3707, Unknown=3, NotChecked=0, Total=4160 [2022-02-23 20:30:01,575 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand has 65 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 61 states have internal predecessors, (169), 19 states have call successors, (22), 8 states have call predecessors, (22), 6 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2022-02-23 20:30:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:30:17,112 INFO L93 Difference]: Finished difference Result 459 states and 600 transitions. [2022-02-23 20:30:17,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-23 20:30:17,113 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 61 states have internal predecessors, (169), 19 states have call successors, (22), 8 states have call predecessors, (22), 6 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) Word has length 110 [2022-02-23 20:30:17,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:30:17,115 INFO L225 Difference]: With dead ends: 459 [2022-02-23 20:30:17,116 INFO L226 Difference]: Without dead ends: 457 [2022-02-23 20:30:17,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 184 SyntacticMatches, 28 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 4948 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=1329, Invalid=11317, Unknown=10, NotChecked=0, Total=12656 [2022-02-23 20:30:17,119 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 201 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-23 20:30:17,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 193 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2161 Invalid, 0 Unknown, 730 Unchecked, 0.9s Time] [2022-02-23 20:30:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-02-23 20:30:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 154. [2022-02-23 20:30:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 136 states have (on average 1.2205882352941178) internal successors, (166), 137 states have internal predecessors, (166), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-23 20:30:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2022-02-23 20:30:17,144 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 110 [2022-02-23 20:30:17,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:30:17,145 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2022-02-23 20:30:17,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 63 states have (on average 2.6825396825396823) internal successors, (169), 61 states have internal predecessors, (169), 19 states have call successors, (22), 8 states have call predecessors, (22), 6 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2022-02-23 20:30:17,145 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2022-02-23 20:30:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-23 20:30:17,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-23 20:30:17,146 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-23 20:30:17,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-23 20:30:17,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-23 20:30:17,348 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-23 20:30:17,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-23 20:30:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash -289884532, now seen corresponding path program 5 times [2022-02-23 20:30:17,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-23 20:30:17,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665311110] [2022-02-23 20:30:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-23 20:30:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-23 20:30:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-23 20:30:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-23 20:30:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-23 20:30:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-02-23 20:30:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-02-23 20:30:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-23 20:30:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-23 20:30:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-23 20:30:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 43 proven. 17 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-02-23 20:30:17,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-23 20:30:17,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665311110] [2022-02-23 20:30:17,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665311110] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-23 20:30:17,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511008878] [2022-02-23 20:30:17,454 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-23 20:30:17,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-23 20:30:17,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-23 20:30:17,456 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-23 20:30:17,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-23 20:30:17,681 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-02-23 20:30:17,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-23 20:30:17,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-23 20:30:17,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-23 20:30:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-02-23 20:30:17,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-23 20:30:17,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511008878] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-23 20:30:17,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-23 20:30:17,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 11 [2022-02-23 20:30:17,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372612303] [2022-02-23 20:30:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-23 20:30:17,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-23 20:30:17,848 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-23 20:30:17,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-23 20:30:17,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-23 20:30:17,849 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-23 20:30:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-23 20:30:17,904 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2022-02-23 20:30:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-23 20:30:17,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 118 [2022-02-23 20:30:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-23 20:30:17,905 INFO L225 Difference]: With dead ends: 157 [2022-02-23 20:30:17,905 INFO L226 Difference]: Without dead ends: 0 [2022-02-23 20:30:17,905 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-23 20:30:17,906 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-23 20:30:17,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 180 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-23 20:30:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-23 20:30:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-23 20:30:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-23 20:30:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-23 20:30:17,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2022-02-23 20:30:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-23 20:30:17,912 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-23 20:30:17,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-23 20:30:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-23 20:30:17,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-23 20:30:17,915 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-23 20:30:17,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-23 20:30:18,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-23 20:30:18,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-23 20:30:31,125 WARN L232 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 291 DAG size of output: 281 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-23 20:32:25,174 WARN L232 SmtUtils]: Spent 1.89m on a formula simplification. DAG size of input: 272 DAG size of output: 39 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-02-23 20:32:25,748 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~n~0 |old(~n~0)|) (= |~#array~0.offset| |old(~#array~0.offset)|) (= |old(~#array~0.base)| |~#array~0.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-23 20:32:25,749 INFO L854 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 |~#array~0.offset|) (= 3 |~#array~0.base|) (= (select |#valid| 3) 1) (<= 5 ~n~0) (= (select |#valid| 2) 1) (<= |~#array~0.offset| 0) (< 0 |#StackHeapBarrier|)) [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L854 garLoopResultBuilder]: At program point SelectionSortENTRY(lines 26 38) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select |#valid| 2) 1)) (not (<= 0 |~#array~0.offset|))) [2022-02-23 20:32:25,749 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 37) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= SelectionSort_~lh~0 0)) (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) (and (<= SelectionSort_~lh~0 SelectionSort_~i~0) (exists ((v_ArrVal_570 (Array Int Int))) (= (store |old(#memory_int)| |~#array~0.base| v_ArrVal_570) |#memory_int|))) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select |#valid| 2) 1)) (not (<= 0 |~#array~0.offset|))) [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point L30-4(lines 26 38) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 33) the Hoare annotation is: (or (and (<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0) (< SelectionSort_~lh~0 ~n~0) (exists ((v_ArrVal_570 (Array Int Int))) (= (store |old(#memory_int)| |~#array~0.base| v_ArrVal_570) |#memory_int|))) (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (= (select |#valid| 2) 1)) (not (<= 0 |~#array~0.offset|))) [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point SelectionSortEXIT(lines 26 38) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point L32-4(lines 32 33) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-02-23 20:32:25,749 INFO L858 garLoopResultBuilder]: For program point L30-2(lines 30 37) no Hoare annotation was computed. [2022-02-23 20:32:25,750 INFO L858 garLoopResultBuilder]: For program point L32-2(lines 32 33) no Hoare annotation was computed. [2022-02-23 20:32:25,750 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 40 52) the Hoare annotation is: (or (not (= (select |old(#valid)| 2) 1)) (and (= |#memory_int| |old(#memory_int)|) (= (select |#valid| 3) 1) (= (select |#valid| 2) 1)) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (<= 0 |~#array~0.offset|))) [2022-02-23 20:32:25,750 INFO L854 garLoopResultBuilder]: At program point L44-3(lines 44 45) the Hoare annotation is: (let ((.cse15 (+ 16 |~#array~0.offset|)) (.cse13 (+ |~#array~0.offset| 4)) (.cse10 (* main_~i~1 4)) (.cse9 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse11 (= 2 (select .cse9 (+ 8 |main_~#array~1.offset|)))) (.cse12 (= (select .cse9 (+ 4 |main_~#array~1.offset|)) 1)) (.cse6 (= (select .cse9 12) 3)) (.cse14 (= (select .cse9 (+ .cse10 8)) (+ main_~i~1 2))) (.cse8 (= |main_~#array~1.offset| 0)) (.cse0 (= (select .cse9 .cse15) .cse13)) (.cse1 (= (select |#valid| 3) 1)) (.cse2 (< 1 |main_~#array~1.base|)) (.cse3 (not (= |main_~#array~1.base| 3))) (.cse7 (+ .cse10 |main_~#array~1.offset|)) (.cse4 (= (select |#valid| 2) 1)) (.cse5 (not (= |main_~#array~1.base| 2)))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 .cse2 .cse3 (= main_~i~1 2) .cse4 .cse5 .cse6 (= (+ |~#array~0.offset| 8) .cse7)) (and .cse8 (= (select .cse9 |main_~#array~1.offset|) 0) (exists ((v_main_~i~1_86 Int)) (and (<= 0 v_main_~i~1_86) (= (select (select |#memory_int| |main_~#array~1.base|) (+ 16 (* v_main_~i~1_86 4) |main_~#array~1.offset|)) (+ v_main_~i~1_86 4)) (<= v_main_~i~1_86 (+ main_~i~1 1)))) (= (select .cse9 (+ 16 .cse10 |main_~#array~1.offset|)) (+ main_~i~1 4)) .cse1 .cse2 .cse3 (<= main_~i~1 0) .cse4 .cse11 .cse5 .cse12 .cse6) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (and (= .cse13 .cse7) .cse0 .cse1 .cse2 .cse3 (= main_~i~1 1) .cse4 .cse11 .cse5 .cse14) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse12 .cse6 (= main_~i~1 0) .cse14) (and .cse8 (= |#memory_int| |old(#memory_int)|) .cse1 .cse2 .cse3 (<= .cse15 .cse10) .cse4 .cse5 (<= main_~i~1 4)) (and (= main_~i~1 3) .cse0 .cse1 .cse2 .cse3 (= 12 .cse7) .cse4 .cse5) (not (<= 0 |~#array~0.offset|))))) [2022-02-23 20:32:25,750 INFO L854 garLoopResultBuilder]: At program point L44-4(lines 44 45) the Hoare annotation is: (or (not (= (select |old(#valid)| 2) 1)) (let ((.cse0 (select |#memory_int| |main_~#array~1.base|))) (and (= |main_~#array~1.offset| 0) (= (select .cse0 |main_~#array~1.offset|) 0) (= (select .cse0 (+ 16 |~#array~0.offset|)) (+ |~#array~0.offset| 4)) (= (select |#valid| 3) 1) (< 1 |main_~#array~1.base|) (not (= |main_~#array~1.base| 3)) (<= main_~i~1 0) (= (select |#valid| 2) 1) (= 2 (select .cse0 (+ 8 |main_~#array~1.offset|))) (not (= |main_~#array~1.base| 2)) (= (select .cse0 (+ 4 |main_~#array~1.offset|)) 1) (= (select .cse0 12) 3))) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (not (<= 0 |~#array~0.offset|))) [2022-02-23 20:32:25,750 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2022-02-23 20:32:25,750 INFO L858 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-02-23 20:32:25,750 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: (let ((.cse10 (* main_~i~1 4)) (.cse9 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse2 (= (select .cse9 8) 2)) (.cse1 (= (select .cse9 |main_~#array~1.offset|) 0)) (.cse0 (= |main_~#array~1.offset| 0)) (.cse3 (< 1 |main_~#array~1.base|)) (.cse4 (not (= |main_~#array~1.base| 3))) (.cse11 (= 2 (select .cse9 (+ 8 |main_~#array~1.offset|)))) (.cse5 (not (= |main_~#array~1.base| 2))) (.cse6 (= main_~i~1 (select .cse9 (+ .cse10 |main_~#array~1.offset|)))) (.cse7 (= (select .cse9 (+ 4 |main_~#array~1.offset|)) 1)) (.cse8 (= (select .cse9 12) 3))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 .cse2 (= main_~i~1 4) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 (<= 5 main_~i~1) .cse4 .cse5 .cse7 .cse8) (and .cse0 (= (select .cse9 (+ .cse10 4)) (+ main_~i~1 1)) .cse1 .cse2 (= main_~i~1 3) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse3 .cse4 (= main_~i~1 2) .cse5 .cse6 .cse7 .cse8 (= (select .cse9 (+ .cse10 8)) (+ main_~i~1 2))) (and .cse0 .cse1 .cse3 (= (select .cse9 (+ .cse10 12)) (+ main_~i~1 3)) .cse4 (= main_~i~1 1) .cse11 .cse5 .cse7 .cse8) (not (< 0 |#StackHeapBarrier|)) (not (= (select |old(#valid)| 3) 1)) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse0 .cse3 (= (select .cse9 16) 4) .cse4 .cse11 .cse5 .cse6 .cse7 .cse8 (= main_~i~1 0)) (not (<= 0 |~#array~0.offset|))))) [2022-02-23 20:32:25,750 INFO L858 garLoopResultBuilder]: For program point L49-4(lines 49 50) no Hoare annotation was computed. [2022-02-23 20:32:25,750 INFO L854 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse11 (* main_~i~1 4)) (.cse2 (select |#memory_int| |main_~#array~1.base|))) (let ((.cse5 (= 2 (select .cse2 (+ 8 |main_~#array~1.offset|)))) (.cse12 (= (select .cse2 8) 2)) (.cse0 (= |main_~#array~1.offset| 0)) (.cse10 (= (select .cse2 |main_~#array~1.offset|) 0)) (.cse1 (< 1 |main_~#array~1.base|)) (.cse3 (= main_~i~1 |main_#t~mem9|)) (.cse4 (not (= |main_~#array~1.base| 3))) (.cse6 (not (= |main_~#array~1.base| 2))) (.cse7 (= main_~i~1 (select .cse2 (+ .cse11 |main_~#array~1.offset|)))) (.cse8 (= (select .cse2 (+ 4 |main_~#array~1.offset|)) 1)) (.cse9 (= (select .cse2 12) 3))) (or (not (= (select |old(#valid)| 2) 1)) (and .cse0 .cse1 (= (select .cse2 16) 4) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= main_~i~1 0)) (not (< 0 |#StackHeapBarrier|)) (and .cse0 .cse10 .cse1 .cse3 (= (select .cse2 (+ .cse11 12)) (+ main_~i~1 3)) .cse4 (= main_~i~1 1) .cse5 .cse6 .cse8 .cse9) (not (= (select |old(#valid)| 3) 1)) (and .cse0 .cse10 (< |main_#t~mem9| 5) .cse12 (= main_~i~1 4) .cse1 .cse4 (<= 4 |main_#t~mem9|) .cse6 .cse7 .cse8 .cse9) (and .cse0 (= (select .cse2 (+ .cse11 4)) (+ main_~i~1 1)) .cse10 .cse12 (= main_~i~1 3) .cse1 .cse3 .cse4 .cse6 .cse7 .cse8) (not (<= 5 ~n~0)) (not (= 3 |~#array~0.base|)) (not (<= |~#array~0.offset| 0)) (and .cse0 .cse10 .cse1 .cse3 .cse4 (= main_~i~1 2) .cse6 .cse7 .cse8 .cse9 (= (select .cse2 (+ .cse11 8)) (+ main_~i~1 2))) (not (<= 0 |~#array~0.offset|))))) [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point mainFINAL(lines 40 52) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point mainEXIT(lines 40 52) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-02-23 20:32:25,751 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-02-23 20:32:25,753 INFO L732 BasicCegarLoop]: Path program histogram: [5, 5, 2, 1, 1, 1] [2022-02-23 20:32:25,754 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-23 20:32:25,760 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-02-23 20:32:25,766 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-02-23 20:32:25,768 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,769 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,772 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,773 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-02-23 20:32:25,775 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-02-23 20:32:25,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.02 08:32:25 BasicIcfg [2022-02-23 20:32:25,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-23 20:32:25,781 INFO L158 Benchmark]: Toolchain (without parser) took 175990.88ms. Allocated memory was 185.6MB in the beginning and 388.0MB in the end (delta: 202.4MB). Free memory was 161.5MB in the beginning and 167.9MB in the end (delta: -6.4MB). Peak memory consumption was 241.0MB. Max. memory is 8.0GB. [2022-02-23 20:32:25,781 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 185.6MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-23 20:32:25,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.22ms. Allocated memory is still 185.6MB. Free memory was 161.3MB in the beginning and 157.4MB in the end (delta: 3.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2022-02-23 20:32:25,781 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 185.6MB. Free memory was 157.4MB in the beginning and 155.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 20:32:25,781 INFO L158 Benchmark]: RCFGBuilder took 287.02ms. Allocated memory is still 185.6MB. Free memory was 155.7MB in the beginning and 144.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-23 20:32:25,781 INFO L158 Benchmark]: IcfgTransformer took 31.09ms. Allocated memory is still 185.6MB. Free memory was 144.4MB in the beginning and 143.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-23 20:32:25,782 INFO L158 Benchmark]: TraceAbstraction took 175436.80ms. Allocated memory was 185.6MB in the beginning and 388.0MB in the end (delta: 202.4MB). Free memory was 142.5MB in the beginning and 167.9MB in the end (delta: -25.4MB). Peak memory consumption was 222.6MB. Max. memory is 8.0GB. [2022-02-23 20:32:25,783 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.14ms. Allocated memory is still 185.6MB. Free memory is still 146.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.22ms. Allocated memory is still 185.6MB. Free memory was 161.3MB in the beginning and 157.4MB in the end (delta: 3.9MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 185.6MB. Free memory was 157.4MB in the beginning and 155.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 287.02ms. Allocated memory is still 185.6MB. Free memory was 155.7MB in the beginning and 144.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 31.09ms. Allocated memory is still 185.6MB. Free memory was 144.4MB in the beginning and 143.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 175436.80ms. Allocated memory was 185.6MB in the beginning and 388.0MB in the end (delta: 202.4MB). Free memory was 142.5MB in the beginning and 167.9MB in the end (delta: -25.4MB). Peak memory consumption was 222.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 175.4s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 127.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1743 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1734 mSDsluCounter, 1591 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1207 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 933 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7189 IncrementalHoareTripleChecker+Invalid, 9329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 933 mSolverCounterUnsat, 400 mSDtfsCounter, 7189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 1195 SyntacticMatches, 69 SemanticMatches, 576 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 10265 ImplicationChecksByTransitivity, 30.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=14, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 444 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 38 PreInvPairs, 89 NumberOfFragments, 1488 HoareAnnotationTreeSize, 38 FomulaSimplifications, 274091 FormulaSimplificationTreeSizeReduction, 13.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 49656 FormulaSimplificationTreeSizeReductionInter, 114.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1761 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2109 ConstructedInterpolants, 274 QuantifiedInterpolants, 17170 SizeOfPredicates, 64 NumberOfNonLiveVariables, 3096 ConjunctsInSsa, 317 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 2788/5062 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2022-02-23 20:32:25,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-02-23 20:32:25,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] Derived loop invariant: ((((((((unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown) && lh == 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || (lh <= i && (\exists v_ArrVal_570 : [int]int :: \old(unknown-#memory_int-unknown)[array := v_ArrVal_570] == unknown-#memory_int-unknown))) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || !(\valid[2] == 1)) || !(0 <= array) - InvariantResult [Line: 44]: Loop Invariant [2022-02-23 20:32:25,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,789 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] [2022-02-23 20:32:25,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_86,QUANTIFIED] Derived loop invariant: (((((((((((!(\old(\valid)[2] == 1) || ((((((((unknown-#memory_int-unknown[array][16 + array] == array + 4 && \valid[3] == 1) && 1 < array) && !(array == 3)) && i == 2) && \valid[2] == 1) && !(array == 2)) && unknown-#memory_int-unknown[array][12] == 3) && array + 8 == i * 4 + array)) || ((((((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && (\exists v_main_~i~1_86 : int :: (0 <= v_main_~i~1_86 && unknown-#memory_int-unknown[array][16 + v_main_~i~1_86 * 4 + array] == v_main_~i~1_86 + 4) && v_main_~i~1_86 <= i + 1)) && unknown-#memory_int-unknown[array][16 + i * 4 + array] == i + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && i <= 0) && \valid[2] == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\old(\valid)[3] == 1)) || (((((((((array + 4 == i * 4 + array && unknown-#memory_int-unknown[array][16 + array] == array + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && i == 1) && \valid[2] == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && unknown-#memory_int-unknown[array][i * 4 + 8] == i + 2)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || ((((((((((array == 0 && unknown-#memory_int-unknown[array][16 + array] == array + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && \valid[2] == 1) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3) && i == 0) && unknown-#memory_int-unknown[array][i * 4 + 8] == i + 2)) || ((((((((array == 0 && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && \valid[3] == 1) && 1 < array) && !(array == 3)) && 16 + array <= i * 4) && \valid[2] == 1) && !(array == 2)) && i <= 4)) || (((((((i == 3 && unknown-#memory_int-unknown[array][16 + array] == array + 4) && \valid[3] == 1) && 1 < array) && !(array == 3)) && 12 == i * 4 + array) && \valid[2] == 1) && !(array == 2))) || !(0 <= array) - InvariantResult [Line: 32]: Loop Invariant [2022-02-23 20:32:25,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] [2022-02-23 20:32:25,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_570,QUANTIFIED] Derived loop invariant: ((((((((lh + 1 <= i && lh < n) && (\exists v_ArrVal_570 : [int]int :: \old(unknown-#memory_int-unknown)[array := v_ArrVal_570] == unknown-#memory_int-unknown)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || !(\valid[2] == 1)) || !(0 <= array) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((((!(\old(\valid)[2] == 1) || (((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][8] == 2) && i == 4) && 1 < array) && !(array == 3)) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || ((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][8] == 2) && 1 < array) && 5 <= i) && !(array == 3)) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || (((((((((array == 0 && unknown-#memory_int-unknown[array][i * 4 + 4] == i + 1) && unknown-#memory_int-unknown[array][array] == 0) && unknown-#memory_int-unknown[array][8] == 2) && i == 3) && 1 < array) && !(array == 3)) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1)) || (((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && !(array == 3)) && i == 2) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3) && unknown-#memory_int-unknown[array][i * 4 + 8] == i + 2)) || (((((((((array == 0 && unknown-#memory_int-unknown[array][array] == 0) && 1 < array) && unknown-#memory_int-unknown[array][i * 4 + 12] == i + 3) && !(array == 3)) && i == 1) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\old(\valid)[3] == 1)) || !(5 <= n)) || !(3 == array)) || !(array <= 0)) || (((((((((array == 0 && 1 < array) && unknown-#memory_int-unknown[array][16] == 4) && !(array == 3)) && 2 == unknown-#memory_int-unknown[array][8 + array]) && !(array == 2)) && i == unknown-#memory_int-unknown[array][i * 4 + array]) && unknown-#memory_int-unknown[array][4 + array] == 1) && unknown-#memory_int-unknown[array][12] == 3) && i == 0)) || !(0 <= array) RESULT: Ultimate proved your program to be correct! [2022-02-23 20:32:25,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...