./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:17:45,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:17:45,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:17:45,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:17:45,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:17:45,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:17:45,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:17:45,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:17:45,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:17:45,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:17:45,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:17:45,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:17:45,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:17:45,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:17:46,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:17:46,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:17:46,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:17:46,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:17:46,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:17:46,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:17:46,012 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:17:46,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:17:46,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:17:46,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:17:46,015 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:17:46,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:17:46,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:17:46,020 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:17:46,021 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:17:46,021 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:17:46,022 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:17:46,022 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:17:46,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:17:46,024 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:17:46,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:17:46,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:17:46,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:17:46,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:17:46,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:17:46,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:17:46,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:17:46,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:17:46,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:17:46,058 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:17:46,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:17:46,059 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:17:46,059 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:17:46,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:17:46,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:17:46,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:17:46,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:17:46,061 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:17:46,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:17:46,062 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:17:46,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:17:46,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:17:46,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:17:46,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:17:46,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:17:46,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:17:46,063 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:17:46,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:17:46,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:17:46,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:17:46,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:17:46,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:17:46,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:17:46,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:17:46,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:17:46,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:17:46,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:17:46,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:17:46,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:17:46,072 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:17:46,073 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:17:46,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:17:46,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4caa1f295436b297cae57f4102149db941e37f67b5d377cc8e9aa7b58bbf9350 [2022-07-19 10:17:46,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:17:46,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:17:46,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:17:46,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:17:46,297 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:17:46,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-19 10:17:46,336 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b47423a1/e5c46c4e103d45f5b4f1bc7bcf6b850e/FLAG345f89218 [2022-07-19 10:17:46,722 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:17:46,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c [2022-07-19 10:17:46,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b47423a1/e5c46c4e103d45f5b4f1bc7bcf6b850e/FLAG345f89218 [2022-07-19 10:17:46,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b47423a1/e5c46c4e103d45f5b4f1bc7bcf6b850e [2022-07-19 10:17:46,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:17:46,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:17:46,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:17:46,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:17:46,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:17:46,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:46,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e5044d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46, skipping insertion in model container [2022-07-19 10:17:46,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:46,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:17:46,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:17:46,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2022-07-19 10:17:46,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:17:46,943 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:17:46,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_init_pair_symmetr2.c[415,428] [2022-07-19 10:17:46,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:17:46,975 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:17:46,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46 WrapperNode [2022-07-19 10:17:46,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:17:46,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:17:46,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:17:46,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:17:46,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:46,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,006 INFO L137 Inliner]: procedures = 15, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 77 [2022-07-19 10:17:47,006 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:17:47,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:17:47,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:17:47,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:17:47,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,035 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:17:47,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:17:47,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:17:47,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:17:47,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (1/1) ... [2022-07-19 10:17:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:17:47,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:17:47,073 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-07-19 10:17:47,090 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-07-19 10:17:47,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:17:47,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 10:17:47,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 10:17:47,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:17:47,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:17:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:17:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:17:47,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:17:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:17:47,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:17:47,150 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:17:47,151 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:17:47,297 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:17:47,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:17:47,306 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 10:17:47,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:17:47 BoogieIcfgContainer [2022-07-19 10:17:47,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:17:47,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:17:47,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:17:47,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:17:47,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:17:46" (1/3) ... [2022-07-19 10:17:47,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa05b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:17:47, skipping insertion in model container [2022-07-19 10:17:47,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:17:46" (2/3) ... [2022-07-19 10:17:47,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa05b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:17:47, skipping insertion in model container [2022-07-19 10:17:47,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:17:47" (3/3) ... [2022-07-19 10:17:47,329 INFO L111 eAbstractionObserver]: Analyzing ICFG array_init_pair_symmetr2.c [2022-07-19 10:17:47,338 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:17:47,338 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:17:47,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:17:47,406 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@442b0cb7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60bdf2b4 [2022-07-19 10:17:47,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:17:47,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:17:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-19 10:17:47,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:17:47,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:17:47,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:17:47,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:17:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1607472667, now seen corresponding path program 1 times [2022-07-19 10:17:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:17:47,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380565488] [2022-07-19 10:17:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:17:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:17:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:17:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380565488] [2022-07-19 10:17:47,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380565488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:17:47,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:17:47,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:17:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610656622] [2022-07-19 10:17:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:17:47,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:17:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:17:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:17:47,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:17:47,609 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-19 10:17:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:17:47,625 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-07-19 10:17:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:17:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2022-07-19 10:17:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:17:47,631 INFO L225 Difference]: With dead ends: 50 [2022-07-19 10:17:47,631 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 10:17:47,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:17:47,640 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:17:47,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:17:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 10:17:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 10:17:47,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:17:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-19 10:17:47,668 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2022-07-19 10:17:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:17:47,668 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-19 10:17:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-19 10:17:47,669 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-19 10:17:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-19 10:17:47,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:17:47,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:17:47,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:17:47,671 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:17:47,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:17:47,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1898116011, now seen corresponding path program 1 times [2022-07-19 10:17:47,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:17:47,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333251352] [2022-07-19 10:17:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:47,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:17:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:17:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:17:47,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333251352] [2022-07-19 10:17:47,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333251352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:17:47,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:17:47,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:17:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807886148] [2022-07-19 10:17:47,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:17:47,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:17:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:17:47,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:17:47,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:17:47,754 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-07-19 10:17:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:17:47,819 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-19 10:17:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:17:47,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2022-07-19 10:17:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:17:47,821 INFO L225 Difference]: With dead ends: 40 [2022-07-19 10:17:47,821 INFO L226 Difference]: Without dead ends: 30 [2022-07-19 10:17:47,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:17:47,826 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:17:47,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:17:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-19 10:17:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-19 10:17:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:17:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-19 10:17:47,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 9 [2022-07-19 10:17:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:17:47,842 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-19 10:17:47,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-07-19 10:17:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-19 10:17:47,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:17:47,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:17:47,845 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:17:47,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:17:47,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:17:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:17:47,849 INFO L85 PathProgramCache]: Analyzing trace with hash 544146986, now seen corresponding path program 1 times [2022-07-19 10:17:47,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:17:47,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294283651] [2022-07-19 10:17:47,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:47,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:17:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:17:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:47,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 10:17:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:17:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:17:47,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:17:47,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294283651] [2022-07-19 10:17:47,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294283651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:17:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861516844] [2022-07-19 10:17:47,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:47,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:17:47,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:17:47,999 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-07-19 10:17:48,002 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-07-19 10:17:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 10:17:48,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:17:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:17:48,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:17:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 10:17:48,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861516844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:17:48,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:17:48,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-07-19 10:17:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008706832] [2022-07-19 10:17:48,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:17:48,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:17:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:17:48,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:17:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:17:48,287 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 10:17:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:17:48,463 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2022-07-19 10:17:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:17:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 29 [2022-07-19 10:17:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:17:48,465 INFO L225 Difference]: With dead ends: 72 [2022-07-19 10:17:48,465 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 10:17:48,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:17:48,466 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 136 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:17:48,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 38 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:17:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 10:17:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2022-07-19 10:17:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-19 10:17:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2022-07-19 10:17:48,491 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 29 [2022-07-19 10:17:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:17:48,491 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2022-07-19 10:17:48,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 10:17:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-07-19 10:17:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-19 10:17:48,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:17:48,497 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:17:48,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 10:17:48,697 WARN L477 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-07-19 10:17:48,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:17:48,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:17:48,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1645511465, now seen corresponding path program 2 times [2022-07-19 10:17:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:17:48,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773575531] [2022-07-19 10:17:48,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:48,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:17:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:17:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 10:17:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:17:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 10:17:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 10:17:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:17:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:17:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 10:17:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 10:17:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 10:17:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:17:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 10:17:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-19 10:17:48,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:17:48,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773575531] [2022-07-19 10:17:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773575531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:17:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553335339] [2022-07-19 10:17:48,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:17:48,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:17:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:17:48,898 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-07-19 10:17:48,899 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-07-19 10:17:48,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:17:48,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:17:48,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 10:17:48,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:17:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-19 10:17:49,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:17:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-19 10:17:49,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553335339] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:17:49,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:17:49,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2022-07-19 10:17:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331360280] [2022-07-19 10:17:49,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:17:49,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:17:49,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:17:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:17:49,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:17:49,305 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-19 10:17:49,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:17:49,593 INFO L93 Difference]: Finished difference Result 162 states and 206 transitions. [2022-07-19 10:17:49,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:17:49,594 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 89 [2022-07-19 10:17:49,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:17:49,595 INFO L225 Difference]: With dead ends: 162 [2022-07-19 10:17:49,595 INFO L226 Difference]: Without dead ends: 145 [2022-07-19 10:17:49,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2022-07-19 10:17:49,597 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 315 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:17:49,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 63 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:17:49,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-19 10:17:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2022-07-19 10:17:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-19 10:17:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 127 transitions. [2022-07-19 10:17:49,610 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 127 transitions. Word has length 89 [2022-07-19 10:17:49,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:17:49,610 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 127 transitions. [2022-07-19 10:17:49,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-19 10:17:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 127 transitions. [2022-07-19 10:17:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-19 10:17:49,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:17:49,622 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:17:49,645 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-07-19 10:17:49,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 10:17:49,828 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:17:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:17:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash 548463335, now seen corresponding path program 3 times [2022-07-19 10:17:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:17:49,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609980389] [2022-07-19 10:17:49,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:49,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:17:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:17:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 10:17:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:17:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 10:17:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 10:17:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:17:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:17:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 10:17:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 10:17:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 10:17:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:17:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 10:17:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 10:17:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 10:17:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 10:17:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 10:17:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 10:17:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 10:17:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 10:17:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 10:17:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 10:17:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 10:17:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 10:17:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 10:17:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 10:17:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 10:17:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 10:17:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 10:17:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 10:17:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 10:17:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2022-07-19 10:17:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:17:50,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609980389] [2022-07-19 10:17:50,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609980389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:17:50,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112629449] [2022-07-19 10:17:50,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:17:50,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:17:50,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:17:50,094 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-07-19 10:17:50,150 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-07-19 10:17:50,627 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-19 10:17:50,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:17:50,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:17:50,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:17:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-07-19 10:17:50,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:17:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2022-07-19 10:17:51,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112629449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:17:51,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:17:51,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2022-07-19 10:17:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327494493] [2022-07-19 10:17:51,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:17:51,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-19 10:17:51,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:17:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-19 10:17:51,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 10:17:51,213 INFO L87 Difference]: Start difference. First operand 96 states and 127 transitions. Second operand has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-19 10:17:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:17:51,924 INFO L93 Difference]: Finished difference Result 342 states and 434 transitions. [2022-07-19 10:17:51,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 10:17:51,925 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 209 [2022-07-19 10:17:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:17:51,927 INFO L225 Difference]: With dead ends: 342 [2022-07-19 10:17:51,927 INFO L226 Difference]: Without dead ends: 313 [2022-07-19 10:17:51,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2022-07-19 10:17:51,929 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 677 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:17:51,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 131 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:17:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-07-19 10:17:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 192. [2022-07-19 10:17:51,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 124 states have (on average 1.0241935483870968) internal successors, (127), 124 states have internal predecessors, (127), 66 states have call successors, (66), 1 states have call predecessors, (66), 1 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-19 10:17:51,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 259 transitions. [2022-07-19 10:17:51,947 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 259 transitions. Word has length 209 [2022-07-19 10:17:51,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:17:51,948 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 259 transitions. [2022-07-19 10:17:51,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.7567567567567566) internal successors, (102), 37 states have internal predecessors, (102), 12 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2022-07-19 10:17:51,948 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 259 transitions. [2022-07-19 10:17:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2022-07-19 10:17:51,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:17:51,953 INFO L195 NwaCegarLoop]: trace histogram [66, 66, 66, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:17:51,993 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-07-19 10:17:52,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:17:52,170 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:17:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:17:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1915094685, now seen corresponding path program 4 times [2022-07-19 10:17:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:17:52,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435402833] [2022-07-19 10:17:52,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:17:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:17:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:17:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 10:17:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:17:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 10:17:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 10:17:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:17:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:17:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 10:17:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 10:17:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 10:17:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:17:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 10:17:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 10:17:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 10:17:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 10:17:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 10:17:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 10:17:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 10:17:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 10:17:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 10:17:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 10:17:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 10:17:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 10:17:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-19 10:17:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 10:17:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-19 10:17:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 10:17:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 10:17:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 10:17:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 10:17:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 10:17:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 10:17:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-19 10:17:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-19 10:17:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-19 10:17:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-19 10:17:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-19 10:17:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 10:17:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 10:17:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-19 10:17:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-19 10:17:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-07-19 10:17:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-19 10:17:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-19 10:17:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-19 10:17:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-19 10:17:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-07-19 10:17:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-07-19 10:17:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-19 10:17:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-19 10:17:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-19 10:17:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-07-19 10:17:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-19 10:17:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-19 10:17:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-07-19 10:17:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-07-19 10:17:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-19 10:17:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2022-07-19 10:17:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-19 10:17:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-19 10:17:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2022-07-19 10:17:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-07-19 10:17:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 373 [2022-07-19 10:17:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 381 [2022-07-19 10:17:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-19 10:17:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2022-07-19 10:17:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:17:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 0 proven. 1408 refuted. 0 times theorem prover too weak. 9064 trivial. 0 not checked. [2022-07-19 10:17:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:17:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435402833] [2022-07-19 10:17:52,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435402833] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:17:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653254748] [2022-07-19 10:17:52,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:17:52,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:17:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:17:52,692 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-07-19 10:17:52,736 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-07-19 10:17:52,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:17:52,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:17:52,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 280 conjunts are in the unsatisfiable core [2022-07-19 10:17:52,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:17:52,998 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 10:17:52,999 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 32 treesize of output 28 [2022-07-19 10:17:53,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:17:53,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-07-19 10:17:53,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-19 10:17:53,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:17:53,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 10:17:53,524 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:53,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:53,838 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:53,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:54,202 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:54,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:54,545 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:54,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:54,890 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:54,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:55,209 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:55,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:55,526 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:55,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:55,826 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:55,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:56,142 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:56,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:56,429 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:56,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:56,724 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:56,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:57,056 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:57,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:57,417 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:57,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:57,752 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:57,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:58,100 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:58,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:58,440 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:58,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:58,791 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:58,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:59,223 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:59,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:59,584 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:59,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:59,866 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-07-19 10:17:59,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 44 [2022-07-19 10:17:59,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2022-07-19 10:17:59,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-07-19 10:18:00,121 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,209 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,312 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,413 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,514 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,596 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,676 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,773 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,862 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:00,962 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:00,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,065 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,184 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,302 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,435 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,528 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,615 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,725 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,810 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:01,913 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:01,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:02,060 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:18:02,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2022-07-19 10:18:02,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 12 [2022-07-19 10:18:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10472 backedges. 2757 proven. 590 refuted. 0 times theorem prover too weak. 7125 trivial. 0 not checked. [2022-07-19 10:18:02,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:18:04,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_117| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (forall ((v_ArrVal_854 Int)) (< 0 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4)))))) is different from false [2022-07-19 10:18:15,920 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_118| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_118|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (< 0 (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))))))) is different from false [2022-07-19 10:22:28,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_120| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_120|)) (forall ((v_ArrVal_851 Int) (v_ArrVal_848 Int) (|v_ULTIMATE.start_main_~i~0#1_118| Int) (|v_ULTIMATE.start_main_~i~0#1_117| Int) (v_ArrVal_854 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int) (v_ArrVal_853 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_118| 1) |v_ULTIMATE.start_main_~i~0#1_117|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_120| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (< 0 (select (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#c~0#1.base|) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_120| 4)) v_ArrVal_848) (+ (* |v_ULTIMATE.start_main_~i~0#1_119| 4) |c_ULTIMATE.start_main_~#c~0#1.offset|) v_ArrVal_851) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_118| 4)) v_ArrVal_853) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_117| 4)) v_ArrVal_854) (+ |c_ULTIMATE.start_main_~#c~0#1.offset| 4))) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_119| 1) |v_ULTIMATE.start_main_~i~0#1_118|)))))) is different from false